244 search results - page 25 / 49 » Algorithmic Techniques for Maintaining Shortest Routes in Dy... |
NSDI
2004
13 years 9 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...
DMSN
2006
ACM
13 years 11 months ago
2006
ACM
Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we in...
CIKM
2009
Springer
13 years 12 months ago
2009
Springer
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
SENSYS
2006
ACM
14 years 1 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...