Space-Efficiency for Routing Schemes of Stretch Factor Three

Journal of Parallel and Distributed Computing

Volumn 61, Issue 5, 2001, Pages 679-687

  Gavoille, Cyril ^a   Gengler, Marc ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Compact routing in distributed networks; near shortest path routing; routing tables

Indexed keywords

EID: 0038757172     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2000.1705     Document Type: Article

References (12)

1. Awerbuch B., Bar-Noy A., Linial N., Peleg D. Improved routing strategies with succint tables. J. Algorithms. 11:1990;307-341.
2. Buhrman H., Hoepman J. H., Vitányi P. Space-efficient routing tables for almost all networks and the incompressibility method. SIAM J. Comput. 28:1999;1414-1432.
3. Eilam T., Gavoille C., Peleg D. Compact routing schemes with low stretch factor. 17th Annual ACM Symposium on Principles of Distributed Computing (PODC). 1998;. p. 11-20.
4. Flocchini P., Mans B., Santoro N. Sense of direction: Formal definitions and properties. 1st International Colloquium on Structural Information and Communication complexity (SIROCCO). 1994;Carleton University Press. p. 9-34.
5. Fraigniaud P., Gavoille C. Memory requirement for universal routing schemes. 14th Annual ACM Symposium on Principles of Distributed Computing (PODC). 1995;. p. 223-230.
6. Gavoille C. A survey on interval routing. Theoret. Comput. Sci. 245:2000;217-253.
7. Gavoille C., Gengler M. Research Report. October 1997.
8. Gavoille C., Pérennès S. Memory requirement for routing in distributed networks. 15th Annual ACM symposium on Principles of Distributed Computing (PODC). 1996;. p. 125-133.
9. Kranakis E., Krizanc D. Lower bounds for compact routing. 13th Annual Symposium on theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science. 1046:1996;Springer-Verlag, Berlin/New York. p. 529-540.
10. Li M., Vitányi P. M. B. An Introduction to Kolmogorov Complexity and Its Applications. 1993;Springer-Verlag, Berlin/New York.
11. Peleg D., Upfal E. A trade-off between space and efficiency for routing tables. J. Assoc. Comput. Math. 36:1989;510-530.
12. Wright E. M. Graphs on unlabelled nodes with a given number of edges. Acta Math. 126:1971;1-9.