Space-efficient routing tables for almost all networks and the incompressibility method

SIAM Journal on Computing

Volumn 28, Issue 4, 1999, Pages 1414-1432

  Buhrman, Harry ^a   Hoepman, Jaap Henk ^b   Vitányi, Paul ^a  

^a CWI   (Netherlands)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; SENSITIVITY ANALYSIS; TELECOMMUNICATION NETWORKS; TOPOLOGY;

AVERAGE CASE COMPLEXITY; COMPACT ROUTING TABLES; INCOMPRESSIBILITY METHOD; KOLMOGOROV COMPLEXITY; NETWORK TOPOLOGY; RANDOM GRAPH; ROUTING ALGORITHM; SPACE COMPLEXITY;

COMPUTER NETWORKS;

EID: 0032631072     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796308485     Document Type: Article

References (10)

1. L.G. VALIANT AND D. ANGLUIN, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci., 18 (1979), pp. 155-193.
2. H.M. BUHRMAN, M. LI, J. TROMP, AND P.M.B. VITÁNYI, Kolmogorov random graphs and the incompressibility method, SIAM J. Comput., to appear.
3. M. FLAMMINI, J. VAN LEEUWEN, AND A. MARCHETTI-SPACCAMELA, The complexity of interval routing on random graphs, in Proceedings 20th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 969, Springer-Verlag, Heidelberg, 1995, pp. 37-49.
4. P. FRAIGNIAUD AND C. GAVOILLE, Memory requirement for universal routing schemes, in Proceedings 14th Annual ACM Symposium on Principles of Distributed Computing, ACM Press, New York, 1995, pp. 223-230.
5. C. GAVOILLE AND S. PÉRENNÈS, Memory requirements for routing in distributed networks, in Proceedings 15th Annual ACM Symposium on Principles of Distributed Computing, ACM Press, New York, 1996, pp. 125-133.
6. A.N. KOLMOGOROV, Three approaches to the quantitative definition of information, Problems Inform. Transmission, 1 (1965), pp. 1-7.
7. E. KRANAKIS AND D. KRIZANC, Lower bounds for compact routing schemes, in Proceedings Thirteenth Symposium on Theoretical Aspects in Computer Science, Lecture Notes in Comput. Sci. 1046, Springer-Verlag, Heidelberg, 1996, pp. 529-540.
8. E. KRANAKIS, D. KRIZANC, AND J. URRUTIA, Compact routing and shortest path information, in Proceedings Second International Colloquium on Structural Information and Communication Complexity, vol. 2, Carleton University Press, Ottawa, 1996, pp. 101-112.
9. M. LI AND P.M.B. VITÁNYI, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed., Springer-Verlag, New York, 1997.
10. D. PELEG AND E. UPFAL, A trade-off between space and efficiency for routing tables, J. ACM, 36 (1989), pp. 510-530.