Sciweavers

266 search results - page 9 / 54
» Distributed Routing in Tree Networks with Few Landmarks
Sort
View
PODC
2004
ACM
14 years 27 days ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 1 months ago
Scalable Resilient Overlay Networks Using Destination-Guided Detouring
— Routing policies used in the Internet tend to be restrictive limiting communication between source-destination pairs to one route, when often better alternates exist. To avoid ...
Sameer Qazi, Tim Moors
JNW
2006
88views more  JNW 2006»
13 years 7 months ago
A Genetic Algorithms Based Approach for Group Multicast Routing
Whereas multicast transmission in one-to-many communications allows the operator to drastically save network resources, it also makes the routing of the traffic flows more complex ...
Luca Sanna Randaccio, Luigi Atzori
SENSYS
2006
ACM
14 years 1 months ago
Lazy cross-link removal for geographic routing
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
AIMS
2010
Springer
14 years 8 days ago
Automatic Link Numbering and Source Routed Multicast
We present a new paradigm for multicasting. Our paradigm combines two ideas: a simple distributed algorithm for automatically numbering network links with a small amount of numbers...
Visa Holopainen, Raimo Kantola, Taneli Taira, Olli...