The compactness of interval routing for almost all graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1499, Issue , 1998, Pages 161-174

  Gavoille, Cyril ^a   Peleg, David ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GRAPHIC METHODS; NETWORK ROUTING; POLYNOMIAL APPROXIMATION; ROUTING PROTOCOLS;

CONSECUTIVE INTEGERS; INTERVAL ROUTING; POLYNOMIAL-TIME; ROUTING INFORMATION; ROUTING SCHEME; ROUTING TABLE; SHORTEST PATH ROUTING; THREE INTERVAL;

GRAPH THEORY;

EID: 22444455118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056481     Document Type: Conference Paper

References (10)

1. N. ALON and J. H. SPENCER, The Probabilistic Method, John Wiley & Sons, 1992.
2. B. BOLLOBÁS, Random Graphs, Academic Press, New York, 1975.
3. H. BUHRMAN, J.-H. HOEPMAN, and P. VITA. NYI, Optimal routing tables, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), May 1996.
4. H. BUHRMAN, M. LI, and P. VITÁNYI, Kolmogorov random graphs and the incompressibility method, in IEEE Conference on Compression and Complexity of Sequences, IEEE Comp. Soc. Press, 1997.
5. M. FLAMMINI, J. VAN LEEUWEN, and A. MARCHETTI-SPACCAMELA, The complexity of interval routing on random graphs, in 20th International Symposium on Mathematical Foundations of Computer Sciences (MFCS), J. Wiederman and P. Hs eds., vol. 969 of Lecture Notes in Computer Science, Springer-Verlag, Aug. 1995, pp. 37-49.
6. C. GAVOILLE, A survey on interval routing scheme, Research Report RR-1182-97, LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, Oct. 1997. Submitted for pubhcation.
7. C. GAVOILLE and D. PELEG, The compactness of interval routing, Research Report RR-1176-97, LaBRI, University of Bordeaux, 351, cours de la Liberation, 33405 Talence Cedex, France, Sept. 1997. Submitted for pubhcation.
8. C. GAVOILLE and S. PÉRENNÈS, Memory requirement for routing in distributed networks, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, ed., May 1996, pp. 125-133.
9. N. SANTORO and R. KHATIB, Labelling and implicit routing in networks, The Computer Journal, 28 (1985), pp. 5-8.
10. J. VAN LEEUWEN and R. B. TAN, Interval routing, The Computer Journal, 30 (1987), pp. 298-307.