The compactness of interval routing

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 4, 1999, Pages 459-473

  Gavoille, Cyril ^a   Peleg, David ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Compact routing tables; Interval routing; Random graphs; Shortest path

Indexed keywords

EID: 0001538805     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197328631     Document Type: Article

References (18)

1. T. EILAM, S. MORAN, AND S. ZAKS, The complexity of the characterization of networks supporting shortest-path interval routing, in 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO), D. Krizanc and P. Widmayer. eds., Carleton Scientific, Ottawa, Canada, 1997, pp. 99-111
2. M. FLAMMINI, Deadlock-free interval routing schemes, in 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), R. Reischuk and M. Morvan, eds., Lecture Notes in Comput. Sci , Springer. Berlin. 1997, pp. 351-362.
3. M. FLAMMINI, G. GAMBOSI, U. NANNI, AND R. B. TAN, Multidimensional interval routing schemes. Theoret. Comput. Sci., 205 (1998). pp. 115-133.
4. M. FLAMMINI AND G. GAMBOSI, On devising Boolean routing schemes, Theoret. Comput. Sci., 186 (1997), pp. 171-198.
5. P. FRAIGNIAUD AND C. GAVOILLE, Interval routing schemes, Algorithmica, 21 (1998), pp. 155-182.
6. G. N. FREDERICKSON AND R. JANARDAN. Designing networks with compact routing tables, Algorithmica, 3 (1988), pp 171-190.
7. C. GAVOILLE, A survey on interval routing scheme. Theoret. Comput. Sci., 245 (1999).
8. C. GAVOILLE AND M. GENGLER, Space-efficiency of routing schemes of stretch factor three, in 4th International Colloquium on Structural Information &: Communication Complexity (SIROCCO), D. Krizanc and P. Widmayer, eds., Carleton Scientific, Ottawa, Canada, 1997, pp. 162-175.
9. C. GAVOILLE AND E. GUÉVREMONT, Worst case bounds for shortest path interval routing, J. Algorithms, 27 (1998), pp. 1-25.
10. C. GAVOILLE AND S. PÉRENNÈS, Lower bounds for interval routing on 3-regular networks, in 3rd International Colloquium on Structural Information & Communication Complexity (SIROCCO), N. Santoro and P. Spirakis, Carleton University Press, Ottawa, Canada, 1996, pp. 88-103.
11. R. L. GRAHAM, D. E. KNUTH, AND O. PATASHNIK, Concrete Mathematics: A Foundation for Computer Science, 2nd ed., Addison-Wesley, Reading, MA, 1994.
12. E. KRANAKIS, D. KRIZANC, S. S. RAVI, On multi-label linear interval routing schemes, in 19th International Workshop on Graph-Theoretic Concepts in Computer Science - Distributed Algorithms (WG), Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 1994, pp. 338-349.
13. R KRÁĽOVǏC, P. RUŽIČKA, AND D. ŠTEFANKOVIČ, The complexity of shortest path and dilation bounded interval routing, in 3rd International Euro-Par Conference, C. Lengaur, M. Griebl, and S. Gorlatch, eds., Lecture Notes in Comput. Sci., Springer, Berlin, 1997, pp. 258-265.
14. M. LI AND P M. B. VITÁNYI, An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, New York, 1993.
15. L. NARAYANAN AND J. OPATRNY, Compact routing on chordal rings of degree four, in 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO), D. Krizanc and P. Widmayer, eds., Carleton Scientific, Ottawa, Canada, 1997, pp. 125-137.
16. L. NARAYANAN AND S. SHENDE, Characterizations of networks supporting shortest-path interval labeling schemes, in 3rd International Colloquium on Structural Information & Communication Complexity (SIROCCO), N. Santoro and P. Spirakis, eds., Carleton University Press, Ottawa, Canada, 1996, pp. 73-87.
17. N. SANTORO AND R. KHATIB, Labelling and Implicit routing in networks, Comput. J., 28 (1985), pp. 5-8.
18. J. VAN LEEUWEN AND R. B. TAN, Interval routing, Comput. J., 30 (1987), pp. 298-307.