Interval routing & layered cross product: Compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks

Journal of Parallel and Distributed Computing

Volumn 63, Issue 11, 2003, Pages 1017-1025

  Calamoneri, Tiziana ^a   Di Ianni, Miriam ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Bene ; Butterfly; Compact routing schemes; Fat tree; Interval routing; Layered cross product; Mesh of trees

Indexed keywords

EID: 0345015377     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-7315(03)00110-2     Document Type: Article

References (15)

1. K. Batcher, Sorting Networks and their Applications, Proceedings of the AFIPS Spring Joint Computing Conference, Vol. 32, 1968, pp. 307-314.
2. V. Beneš, Permutation groups, complexes, and rearrangeable multistage connecting networks, Bell Syst. Tech. J. 43 (1964) 1619-1640.
3. S. Even, A. Litman, Layered cross product - a technique to construct interconnection networks, Fourth ACM SPAA, 1992, pp. 60-69.
4. M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela, The complexity of interval routing in random graphs, MFCS '95, Lecture Notes in Computer Science, Vol. 969, 1995, pp. 37-49.
5. P. Fraigniaud, C. Gavoille, Optimal interval routing, CONPAR, Lecture Notes in Computer Science, Vol. 854, 1994, pp. 785-796.
6. C. Gavoille, S. Perennes, Lower bounds for shortest path interval routing, SIROCCO'96, 1996.
7. The T9000 Transputer Products Overview Manual, Inmos, 1991.
8. R. Kráľovič, P. Ružička, D. Štefankovič, The complexity of shortest path and dilation bounded interval routing, Euro-Par'97, Lecture Notes in Computer Science, Vol. 1300, 1997, pp. 258-265.
9. 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. Rozemberg, A. Salomaa (Eds.), The Book of L. Springer, London, 1986, pp. 298-307.
10. J. van Leeuwen, R.B. Tan, Interval routing, Technical Report RUU-CS-85-16, Department of Computer Science, Utrecht University, 1985; also in Comput. J. 30 (1987) 298-307.
11. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, Inc., Los Altos, CA, 1992.
12. T. Leighton, B. Maggs, A.G. Ranade, S. Rao, Randomized routing and sorting on fixed-connection networks, J. Algorithms 17 (1) (1994) 157-205 a preliminary version is in 29th IEEE FOCS, 1988, pp. 256-269.
13. P. Ružička, On efficiency of interval routing algorithms, in: M.P. Chytil, L. Janiga, V. Koubeck (Eds.), MFCS 1988, Lecture Notes in Computer Science, Vol. 324, 1988, pp. 492-500.
14. N. Santoro, R. Khatib, Routing without routing tables, Technical Report SCS-TR-6, School of Computer Science, Carleton University, 1982, also as: Labelling and implicit routing in networks, Comput. J. 28 (1985) 5-8.
15. S.S.H. Tse, F.C.M. Lau, A lower bound for interval routing in general networks, Networks 29 (1997) 49-53.