๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Compact name-independent routing with minimum stretch

โœ Scribed by Abraham, Ittai; Gavoille, Cyril; Malkhi, Dahlia; Nisan, Noam; Thorup, Mikkel

Book ID
120734572
Publisher
Association for Computing Machinery
Year
2008
Tongue
English
Weight
130 KB
Volume
4
Category
Article
ISSN
1549-6325

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Compact Routing with Name Independence
Compact Routing with Name Independence
โœ Arias, Marta; Cowen, Lenore J.; Laing, Kofi A.; Rajaraman, Rajmohan; Taka, Orjet ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 303 KB