On the complexity of multi-dimensional interval routing schemes

Theoretical Computer Science

Volumn 245, Issue 2, 2000, Pages 255-280

  Ružička, Peter ^a   Štefankovič, Daniel ^a  

^a Physics and Informatics   (Slovakia)

Author keywords

Congestion; Interconnection networks; Interval routing; Space complexity

Indexed keywords

EID: 0141441480     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00284-4     Document Type: Article

References (21)

1. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, Proc. Internat. Conf. on Parallel Processing, 1987, pp. 393-400.
2. H. Buhrman, J.-H. Hoepman, P. Vitányi, Optimal routing tables, in: 15th Annual ACM Symp. of Distributed Computing (PODC'96), ACM Press, 1988, pp. 11-20.
3. K. Diks, H. Djidjev, O. Sýkora, I. Vrťo, Edge separators of planar and outerplanar graphs with applications, J. Algorithms 14 (2) (1993) 258-279.
4. T. Eilam, C. Gavoille, D. Peleg, Compact routing schemes with low stretch factor, LaBRI, Université Bordeaux I, 33405 Talence Cedex, France, 1998.
5. M. Flammini, G. Gambosi, U. Nanni, R. Tan, Multi-dimensional interval routing schemes, Theoret. Comput. Sci. (205) (1998) 115-133.
6. M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela, The complexity of interval routing on random graphs, Comput. J. 41 (1) (1998) 16-25.
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 requirements of universal routing schemes, Proc. eighth Annual ACM Symp. on Parallel Algorithms and Architecture (SPAA), 1996.
9. C. Gavoille, Lower bounds for interval routing on bounded degree networks, Technical Report 1144-96, LaBRI, 1996.
10. C. Gavoille, On the Dilation of Interval Routing, in: MFCS'97, Lecture Notes in Computer Science, Vol. 1295, Springer, Berlin (1997), pp. 259-268.
11. C. Gavoille, S. Perennes, Memory requirement for routing in distributed networks, Proc. 15th Annual ACM Symp. on Principles of Distributed Computing (PODC'96), 1996, pp. 125-133.
12. M.C. Heydemann, J.C. Meyer, D. Sotteau, On forwarding indices of networks, Discrete Appl. Math. 23 (1989) 103-123.
13. R. Kráľovič, P. Ružička, D. Štefankovič, The complexity of shortest path and dilation bounded interval routing, in: 3rd Euro-Par, Lecture Notes in Computer Science, Vol. 1300, Springer, Berlin (1997), pp. 258-265. The full version will appear in TCS.
14. E. Kranakis, D. Krizanc, Lower bounds for compact routing, in: 13th STACS, Lecture Notes in Computer Science, Vol. 1046, Springer, Berlin (1996), pp. 529-540.
15. E. Kranakis, D. Krizanc, S.S. Ravi, On multi-label linear interval routing schemes, Comput. J. 39 (2) (1996) 133-139.
16. J. van Leeuwen, R.B. Tan, Interval routing, Comput. J. 30 (1987) 298-307.
17. J. van Leeuwen, R.B. Tan, Compact routing methods: a survey, in: Colloquium on Structural Information and Communication Complexity (SICC 94), Proc. School of Computer Science, Carleton University, Ottawa, 1994, pp. 99-109.
18. M. Li, P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Springer, New York, 1993.
19. D. May, P. Thompson, Transputers and routers: Components for concurrent machines, INMOS, Ltd., 1991.
20. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
21. N. Santoro, R. Khatib, Labelling and implicit routing in networks, Comput. J. 28 (1985) 5-8.