The complexity of shortest path and dilation bounded interval routing

Theoretical Computer Science

Volumn 234, Issue 1-2, 2000, Pages 85-107

  Kráľovič, Rastislav ^a   Ružička, Peter ^a   Štefankovič, Daniel ^a  

^a Physics and Informatics   (Slovakia)

Author keywords

Compact routing; Complexity; Dilation bounded interval routing

Indexed keywords

EID: 0038419088     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00042-5     Document Type: Article

References (23)

1. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, in: Proc. Internat. Conf. on Parallel Processing, 1987, pp. 393-400.
2. E.M. Bakker, J. van Leeuwen, R.B. Tan, Linear interval routing schemes, Algorithms Rev. 2 (2) (1991) 45-61.
3. T. Eilam, S. Moran, S. Zaks, A lower bound for linear interval routing, in: 10th Internat. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, vol. 1151, Springer, Berlin, 1996, pp. 191-205.
4. M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela, The complexity of interval routing on random graphs, in: MFCS'95, Lecture Notes in Computer Science, vol. 969, Springer, Berlin, 1995, pp. 37-49.
5. M. Flammini, E. Nardelli, On the path length in interval routing schemes, Manuscript, 1997.
6. P. Fraigniaud, C. Gavoille, Interval routing schemes, Research Report 94-04, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, January 1994, Algorithmica, to appear.
7. P. Fraigniaud, C. Gavoille, Optimal interval routing, in: CONPAR'94, Lecture Notes in Computer Science, vol. 854, Springer, Berlin, 1994, pp. 785-796.
8. P. Fraigniaud, C. Gavoille, Local memory requirement of universal routing schemes, in: 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA), ACM Press, New York, 1996.
9. C. Gavoille, S. Pérennes, Lower bounds for interval routing on 3-regular networks, in: Proc. SIROCCO'96, Carleton Press, 1996, pp. 88-103.
10. C. Gavoille, On the dilation of interval routing. Manuscript, accepted to MFCS'97, 1997.
11. E. Kranakis, D. Krizanc, S.S. Ravi, On multi-label linear interval routing schemes, in: Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 790, Springer, Berlin, 1994, pp. 338-349.
12. E. Kranakis, D. Krizanc, Lower bounds for compact routing, in: 13th Annual Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, vol. 1046, Springer, Berlin, 1996, pp. 529-540.
13. D. May, P. Thompson, Transputers and Routers: Components for Concurrent Machines, Inmos, 1991.
14. F. Meyer auf der Heide, C. Scheideler, Deterministic routing with bounded buffers: turning offline into onlines protocols, Proc. 37th Symp. on Foundations of Computer Science (FOCS), November 1996.
15. D. Peleg, E. Upfal, A tradeoff between space and efficiency for routing tables, J. ACM 36 (1989) 510-530.
16. P. Ružička, On the efficiency of interval routing algorithms, in: MFCS'88, Lecture Notes in Computer Science, vol. 324, Springer, Berlin, 1988, pp. 492-500.
17. M. Santoro, R. Khatib, Labelling and implicit routing in networks, Comput. J. 28 (1985) 5-8.
18. S.S.H. Tse, F.C.M. Lau, A lower bound for interval routing in general networks. Networks 29 (1) (1997) 49-53.
19. S.S.H. Tse, F.C.M. Lau, Lower bounds for multi-label interval routing, Proc. SIROCCO'95, Carleton Press, 1995, pp. 123-134.
20. S.S.H. Tse, F.C.M. Lau, Two lower bounds for multi-label interval routing. Proc. Computing: The Australasian Theory Symp. (CATS'97), Sydney, Australia, February 1997.
21. J. van Leeuwen, R.B. Tan, Interval Routing, Comput. J. 30 (1987) 298-307.
22. J. van Leeuwen, R.B. Tan, Compact routing methods: a survey, in: Proc. Colloquium on Structural Information and Communication Complexity (SICC). Carleton Press, 1995, pp. 99-109.
23. J. Vounckx, G. Deconinck, R. Cuyvers, R. Lauwereins, J.A. Peperstraete, Network fault-tolerance with interval routing devices, in: Proc. 11th IASTED Internat. Symp. on Applied Informatics, Annecy, France, 1993, pp. 293-296.