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

Minimum interference routing with fast protection

โœ Scribed by Calle, E.; Urra, A.; Marzo, J.L.; Geng-Sheng Kuo; Hai-Bo Guo


Book ID
117893131
Publisher
IEEE
Year
2006
Tongue
English
Weight
135 KB
Volume
44
Category
Article
ISSN
0163-6804

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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 name-independent routing with mi
โœ Abraham, Ittai; Gavoille, Cyril; Malkhi, Dahlia; Nisan, Noam; Thorup, Mikkel ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 130 KB