Compact routing schemes with low stretch factor

Journal of Algorithms

Volumn 46, Issue 2, 2003, Pages 97-114

  Eilam, Tamar ^a   Gavoille, Cyril ^b   Peleg, David ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NETWORK PROTOCOLS; PROGRAM PROCESSORS; ROUTERS;

INTERVAL ROUTING SCHEMES (IRS); PIVOT INTERVAL ROUTING (PIR);

TELECOMMUNICATION NETWORKS;

EID: 0038680382     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00002-6     Document Type: Article

References (24)

1. B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg, Improved routing strategies with succinct tables, J. Algorithms 11 (1990) 307-341.
2. B. Awerbuch, D. Peleg, Sparse partitions, in: 31st Symp. on Foundations of Computer Science (FOCS), 1990, pp. 503-513.
3. B. Awerbuch, D. Peleg, Routing with polynomial communication-space trade-off, SIAM J. Discrete Math. 5 (1992) 151-162.
4. L.J. Cowen, Compact routing with minimum stretch, J. Algorithms 38 (2001) 170-183.
5. T. Eilam, S. Moran, S. Zaks, Lower bounds for linear interval routing, Networks 34 (1999) 37-46.
6. M. Flammini, G. Gambosi, U. Nanni, R.B. Tan, Multidimensional interval routing schemes, Theoret. Comput. Sci. 205 (1998) 115-133.
7. P. Fraigniaud, C. Gavoille, Universal routing schemes, J. Distrib. Comput. 10 (1997) 65-78.
8. P. Fraigniaud, C. Gavoille, Routing in trees, in: 28th Int. Colloquium on Automata, Languages and Programming (ICALP), in: Lecture Notes in Comput. Sci., Vol. 2076, Springer-Verlag, 2001, pp. 757-772.
9. G.N. Frederickson, R. Janardan, Separator-based strategies for efficient message routing, in: 27th Symp. on Foundations of Computer Science (FOCS), 1986, pp. 428-437.
10. G.N. Frederickson, R. Janardan, Designing networks with compact routing tables, Algorithmica 3 (1988) 171-190.
11. G. Gambosi, P. Vocca, Topological routing schemes, in: 10th Int. Workshop on Distributed Algorithms (WDAG), in: Lecture Notes in Comput. Sci., Vol. 1151, Springer-Verlag, 1996, pp. 206-219.
12. C. Gavoille, A survey on interval routing, Theoret. Comput. Sci. 245 (2000) 217-253.
13. C. Gavoille, M. Gengler, Space-efficiency of routing schemes of stretch factor three, J. Parallel Distrib. Comput. 61 (2001) 679-687.
14. C. Gavoille, E. Guévremont, Worst case bounds for shortest path interval routing, J. Algorithms 27 (1998) 1-25.
15. C. Gavoille, D. Peleg, The compactness of interval routing, SIAM J. Discrete Math. 12 (1999) 459-473.
16. C. Gavoille, S. Pérennès, Memory requirement for routing in distributed networks, in: 15th Annual ACM Symp. on Principles of Distributed Computing (PODC), ACM Press, 1996, pp. 125-133.
17. M.J. Hall, Combinatorial Theory, 2nd edition, Wiley-Interscience, 1986.
18. R. Kráľovič, P. Ružička, D. Štefankovič, The complexity of shortest path and dilation bounded interval routing, Theoret. Comput. Sci. 234 (2000) 85-107.
19. L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975) 383-390.
20. D. Peleg, E. Upfal, A trade-off between space and efficiency for routing tables, J. ACM 36 (1989) 510-530.
21. N. Santoro, R. Khatib, Labelling and implicit routing in networks, Comput. J. 28 (1985) 5-8.
22. M. Thorup, U. Zwick, Compact routing schemes, in: 13th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA), Hersonissos, Crete, Greece, ACM Press, 2001, pp. 1-10.
23. S.S.H. Tse, F.C.M. Lau, An optimal lower bound for interval routing in general networks, in: 4th Int. Colloquium on Structural Information & Communication Complexity (SIROCCO), Carleton Scientific, 1997, pp. 112-124.
24. J. van Leeuwen, R.B. Tan, Computer networks with compact routing tables, in: The Book of L. Springer-Verlag, 1986, pp. 259-273.