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

Compact routing schemes with low stretch factor

โœ Scribed by Tamar Eilam; Cyril Gavoille; David Peleg

Book ID
108421619
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
201 KB
Volume
46
Category
Article
ISSN
0196-6774

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

Space-Efficiency for Routing Schemes of
Space-Efficiency for Routing Schemes of Stretch Factor Three
โœ Cyril Gavoille; Marc Gengler ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 133 KB

We deal with deterministic distributed routing algorithms on arbitrary n-node networks. For each router, we want to minimize the amount of routing information that must be stored in order to implement the local routing algorithm, even if the names of the routers can be chosen in advance. We take als

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