Multidimensional interval routing schemes

Theoretical Computer Science

Volumn 205, Issue 1-2, 1998, Pages 115-133

  Flammini, Michele ^a   Gambosi, Giorgio ^b   Nanni, Umberto ^c   Tan, Richard B ^d,e  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d UTRECHT UNIVERSITY   (Netherlands)

^e University of Science and Arts of Oklahoma   (United States)

Author keywords

Compact routing methods; Dimensions; Interconnection networks; Interval routing schemes; Product graphs

Indexed keywords

EID: 0001821578     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00070-4     Document Type: Article

References (29)

1. B. Arden, H. Lee, Analysis of chordal ring network, IEEE Trans. Comput. 30 (1981) 291-294.
2. B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg, Compact distributed data structures for adaptive routing, in: Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 479-489.
3. B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg, Improved routing strategies with succinct tables, J. Algorithms 11 (1990) 307-341.
4. E.M. Bakker, J. van Leeuwen, R.B. Tan, Linear interval routing schemes, Tech. Rep. RUU-CS-91-7, Dept. of Computer Science, Utrecht University, 1991. Also in: Algorithms Rev. 2 (2) (1991) 45-61.
5. E.M. Bakker, J. van Leeuwen, R.B. Tan, Linear interval routing schemes, Tech. Rep. RUU-CS-91-7, Dept. of Computer Science, Utrecht University, 1991. Also in: Algorithms Rev. 2 (2) (1991) 45-61.
6. E.M. Bakker, J. van Leeuwen, R.B. Tan, Some characterization results in compact routing schemes, manuscript, 1994.
7. M. Flammini, Compact routing models: some complexity results and extensions, Ph.D. Thesis, Dept. of System and Computer Science, University of Rome "La Sapienza", 1995.
8. M. Flammini, G. Gambosi, S. Salomone, Boolean routing, in: Proc. 7th Internat. Workshop on Distributed Algorithms (WDAG'93), Lecture Notes in Computer Science, vol. 725, Springer, Berlin, 1993, pp. 219-233.
9. M. Flammini, G. Gambosi, S. Salomone, On devising boolean routing schemes, in: Proc. 21st Internat. Workshop on Graph-Theoretic Concepts in Computer Science (WG'95), Lecture Notes in Computer Science, vol. 1017, Springer, Berlin, (1995); full version to appear in Theoretical Computer Science.
10. M. Flammini, G. Gambosi, S. Salomone, Interval routing schemes, Algorithmica 16 (1996) 549-568.
11. M. Flammini, J. van Leeuwen, A. Marchetti Spaccamela, The complexity of interval routing on random graphs, Proc. 20th Symp. on Mathematical Foundation of Computer Science (MFCS'95), Lecture Notes in Computer Science, vol. 969, Springer, Berlin, 1995, pp. 37-49.
12. G.N. Frederickson, R. Janardan, Optimal message routing without complete routing tables, in: Proc. 5th Ann. ACM Symp. on Principles of Distributed Computing, 1986, pp. 88-97. Also as: Designing networks with compact routing tables, Algorithmica 3 (1988) 171-190.
13. G.N. Frederickson, R. Janardan, Optimal message routing without complete routing tables, in: Proc. 5th Ann. ACM Symp. on Principles of Distributed Computing, 1986, pp. 88-97. Also as: Designing networks with compact routing tables, Algorithmica 3 (1988) 171-190.
14. G.N. Frederickson, R. Janardan, Efficient message routing in planar networks, SIAM J. Comput. 18 (1989) 843-857.
15. G.N. Frederickson, R. Janardan, Space efficient message routing in c-decomposable networks, SIAM J. Comput. 19 (1990) 164-181.
16. H. Hofestädt, A. Klein, E. Reyzl, Performance benefits from locally adaptive interval routing in dynamically switched interconnection networks, in: Proc. 2nd European Distributed Memory Computing Conf, 1991, pp. 193-202.
17. The T9000 Transputer Products Overview Manual, Inmos, 1991.
18. E. Kranakis, D. Krizanc, S.S. Ravi, On multi-label linear interval routing schemes, in: J. van Leeuwen (Ed.), Graph-Theoretic Concepts in Computer Science (WG'93), Proc. 19th Internat. Workshop, Lecture Notes in Computer Science, vol. 790, Springer, Berlin, 1993, pp. 338-349.
19. J. van Leeuwen, R.B. Tan, Routing with compact routing tables, Tech. Rep. RUU-CS-83-16, Dept. of Computer Science, Utrecht University, 1983. Also as: Computer networks with compact routing tables, in: G. Rozenberg, A. Salomaa (Eds.) The Book of L, Springer, Berlin, 1986, pp. 298-307.
20. J. van Leeuwen, R.B. Tan, Routing with compact routing tables, Tech. Rep. RUU-CS-83-16, Dept. of Computer Science, Utrecht University, 1983. Also as: Computer networks with compact routing tables, in: G. Rozenberg, A. Salomaa (Eds.) The Book of L, Springer, Berlin, 1986, pp. 298-307.
21. J. van Leeuwen, R.B. Tan, Interval Routing, Tech. Rep. RUU-CS-85-16, Dept. of Computer Science, Utrecht University, 1985. Also in: Comput. J. 30 (1987) 298-307.
22. J. van Leeuwen, R.B. Tan, Interval Routing, Tech. Rep. RUU-CS-85-16, Dept. of Computer Science, Utrecht University, 1985. Also in: Comput. J. 30 (1987) 298-307.
23. J. van Leeuwen, R.B. Tan, Compact routing methods: a survey, in: Proc. Coll. on Structural Information and Communication Complexity (SICC'94), Carleton University Press, Carleton, 1994.
24. D. May, P. Thompson, Transputers and Routers: Components for Concurrent Machines, Inmos, 1990.
25. D. Peleg, E. Upfal, A trade-off between space and efficiency for routing tables, J. ACM 36 (3) (1989) 510-530.
26. J.P. Robinson, M. Cohn, Counting Sequences, IEEE Trans. Comput. C-30 (1) (1981) 17-23.
27. P. Ružička, On efficiency of interval routing algorithms, in: M.P. Chytil, L. Janiga, V. Koubek (Eds.), Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 324, Springer, Berlin, 1988, pp. 492-500.
28. N. Santoro, R. Khatib, Routing without routing tables, Tech. Rep. SCS-TR-6, School of Computer Science, Carleton University 1982. Also as: Labelling and implicit routing in networks, Comput. J. 28 (1) (1985) 5-8.
29. N. Santoro, R. Khatib, Routing without routing tables, Tech. Rep. SCS-TR-6, School of Computer Science, Carleton University 1982. Also as: Labelling and implicit routing in networks, Comput. J. 28 (1) (1985) 5-8.