On the dilation of interval routing

Computer Journal

Volumn 43, Issue 3, 2000, Pages 243-249

  Gavoille, Cyril ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); ROUTERS; TELECOMMUNICATION TRAFFIC;

DILATION; INTERVAL ROUTING;

TELECOMMUNICATION NETWORKS;

EID: 0033697987     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/43.3.243     Document Type: Article

References (18)

1. Santoro, N. and Khatib, R. (1985) Labelling and implicit routing in networks. Camp. J., 28, 5-8.
2. Van Leeuwen, J. and Tan, R. B. (1987) Interval routing. Comp. J., 30, 298-307.
3. Gavoille, C. (1999) A survey on interval routing. Theoret. Comp. Sci., 245.
4. May, D. and Thompson, P. (1990) Transputers and routers: components for concurrent machines. INMOS Ltd.
5. Zerrouk, B., Reibaldi, V., Potter, F., Greiner, A. and Anne, D. (1996) RCube: a gigabit serial links low latency adaptive router. Records of the IEEE Hot Interconnects IV.
6. Tse, S. S. H. and Lau, F. C. M. (1997) An optimal lower bound for interval routing in general networks. In Proc. 4th Int. Coll. on Structural Information & Communication Complexity (SIROCCO), pp. 112-124. Carleton Scientific, Ottawa, Canada.
7. Kráľovič, R., Ružička, P. and Štefankovič D. (1997) The complexity of shortest path and dilation bounded interval routing. In Proc. 3rd Int. Euro-Par Conf. (Lecture Notes in Computer Science, vol. 1300), pp. 258-265. Springer, Berlin.
8. Tse, S. S. H. and Lau, F. C. M. (1999) Some results on the space requirement of interval routing. In Proc. 6th Int. Coll. on Structural Information & Communication Complexity (SIROCCO), pp. 264-279. Carleton Scientific, Ottawa, Canada.
9. Flammini, M., van Leeuwen, J. and Marchetti-Spaccamela, A. (1998) The complexity of interval routing on random graphs. Comp. J., 41, 16-25.
10. Gavoille, C. and Guévremont, E. (1998) Worst case bounds for shortest path interval routing. J. Algorithms, 27, 1-25.
11. Gavoille, C. and Peleg, D. (1999) The compactness of interval routing. SIAM J. Discrete Math., 12, 459-473.
12. Fraigniaud, P. and Gavoille, C. (1998) Interval routing schemes. Algorithmica, 21, 155-182.
13. Ružička, P. (1991) A note on the efficiency of an interval routing algorithm. Comp. J., 34, 475-476.
14. Tse, S. S. H. and Lau, F. C. M. (1999) On the space requirement of interval routing. IEEE Trans. Comp., 48, 752-757.
15. Gavoille, C. (1997) On the dilation of interval routing. In Proc. 22nd Int. Symp. on Mathematical Foundations of Computer Science (MFCS) (Lecture Notes in Computer Science, vol. 1300), pp. 259-268. Springer, Berlin.
16. Tse, S. S. H. and Lau, F. C. M. (1997) Two lower bounds for multi-interval routing. In Proc. Computing: The Australasian Theory Symp. (CATS), Australian Comp. Sci. Commun., 19, 36-13.
17. Gavoille, C. and Gengler, M. (1997) Space-efficiency of routing schemes of stretch factor three. In Proc. 4th Int. Coll. on Structural Information & Communication Complexity (SIROCCO), pp. 162-175. Carleton Scientific, Ottawa, Canada.
18. Li, M. and Vitányi, P. M. B. (1997) An Introduction to Kolmogorov Complexity and its Applications (2nd Edition). Springer, Berlin.