Sciweavers

2190 search results - page 377 / 438
» Distributed algorithms for dynamic coverage in sensor networ...
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 25 days ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICDCSW
2008
IEEE
14 years 3 months ago
RETROFIT: Reliable Exchanges through Resilient Overlays for Internet Teleoperation
Emergence of successful teleoperation applications requires the convergence of diverse domains like robotics, machine learning, sensing, actuation, control and communication. We e...
Invited Talk Lakshamanan, Raj Rajkumar
INFOCOM
2010
IEEE
13 years 7 months ago
Overcoming Failures: Fault-tolerance and Logical Centralization in Clean-Slate Network Management
—We investigate the design of a clean-slate control and nt plane for data networks using the abstraction of 4D architecture, utilizing and extending 4D’s concept of logically c...
Hammad Iqbal, Taieb Znati
CEEMAS
2003
Springer
14 years 2 months ago
Airports for Agents: An Open MAS Infrastructure for Mobile Agents
Airports for Agents1 (AA) is an implemented distributed multi-agent infrastructure designed for dynamic and unstable Internet environment. The infrastructure consists of platforms ...
Jan Tozicka
SIGCOMM
2000
ACM
14 years 1 months ago
FIRE: Flexible intra-AS routing environment
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
Craig Partridge, Alex C. Snoeren, W. Timothy Stray...