𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Compact Routing with Name Independence

✍ Scribed by Arias, Marta; Cowen, Lenore J.; Laing, Kofi A.; Rajaraman, Rajmohan; Taka, Orjeta

Book ID
118198476
Publisher
Society for Industrial and Applied Mathematics
Year
2006
Tongue
English
Weight
303 KB
Volume
20
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Compact name-independent routing with mi
Compact name-independent routing with minimum stretch
✍ Abraham, Ittai; Gavoille, Cyril; Malkhi, Dahlia; Nisan, Noam; Thorup, Mikkel πŸ“‚ Article πŸ“… 2008 πŸ› Association for Computing Machinery 🌐 English βš– 130 KB
Compact Routing with Minimum Stretch
Compact Routing with Minimum Stretch
✍ Lenore J Cowen πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 111 KB

We present the first universal compact routing algorithm with maximum stretch bounded by 3 that uses sublinear space at every vertex.The algorithm uses local routing tables of size O(n2j3 log413 n) and achieves paths that are most 3 times the length of the shortest path distances for all nodes in an