Sciweavers

482 search results - page 51 / 97
» On routing table growth
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Scalable Routing Via Greedy Embedding
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Cédric Westphal, Guanhong Pei
ICCS
2009
Springer
14 years 2 months ago
Improving the Scalability of SimGrid Using Dynamic Routing
Research into large-scale distributed systems often relies on the use of simulation frameworks in order to bypass the disadvantages of performing experiments on real testbeds. SimG...
Silas De Munck, Kurt Vanmechelen, Jan Broeckhove
INFOCOM
2007
IEEE
14 years 2 months ago
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
Roland Flury, Roger Wattenhofer
IWCMC
2006
ACM
14 years 1 months ago
Performance of Taroko: a cluster-based addressing and routing scheme for self-organized networks
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
Julien Ridoux, Meriem Kassar, Mathias Boc, Anne Fl...
ICNP
2005
IEEE
14 years 1 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood