On the dilation of interval routing

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

Volumn 1295, Issue , 1997, Pages 259-268

  Gavoille, Cyril ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ROUTING PROTOCOLS;

BOUNDED DEGREE; INTERVAL ROUTING; LOWER BOUNDS; NON NEGATIVES; PATH LENGTH; ROUTING PATH;

NETWORK ROUTING;

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

References (12)

1. M. Flammini and E. Nardelli, On the path length in interval routing schemes. Manuscript, 1996.
2. P. Fraigniaud and C. Gavoille, Optimal interval routing, in Parallel Processing: CONPAR’94-VAPP VI, B. Buchberger and J. Volkert, eds., vol. 854 of Lecture Notes in Computer Science, Springer-Verlag, Sept. 1994, pp. 785-796.
3. C. Gavoille and M. Gengler, Space-efficiency of routing schemes of stretch factor three, in 4th Colloquium on Structural Information & Communication Complexity (SIROCCO), July 1997.
4. C. Gavoille and E. Guévremont, Worst case bounds for shortest path interval routing, Research Report 95-02, LIP, École Normale Superienre de Lyon, 69364 Lyon Cedex 07, France, Jan. 1995.
5. R. Královič, P. Ružička, and D. Štefankovič, The complexity of shortest path and dilation bounded interval routing, in 3rd International Euro-Par Conference, Aug. 1997.
6. M. Li and P. M. B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, 1993.
7. D. May and P. Thompson, Transputers and routers: Components for concurrent machines, INMOS Ltd., (1990).
8. P. Ružička, On efficient of interval routing algorithms, in Mathematical Foundations of Computer Science (MFCS), M. Chytil, L. Janiga, and V. Koubek, eds., vol. 324 of Lectures Notes in Computer Science, Springer-Verlag, 1988, pp. 492-500.
9. N. Santoro and R. Khatib, Labelling and implicit routing in networks, The Computer Journal, 28 (1985), pp. 5-8.
10. S. S. H. Tse and P. C. M. Lau, Two lower bounds for multi-interval routing, in Computing: The Australasian Theory Symposium (CATS), Sydney, Australia, Feb. 1996.
11. S. S. H. Tse and F. C. M. Lau, An optimal lower bound for interval routing in general networks, in 4th Colloquium on Structural Information & Communication Complexity (SIROCCO), July 1997.
12. J. VAN Leeuwen and R. B. Tan, Interval routing, The Computer Journal, 30 (1987), pp. 298-307.