Interval Routing & Layered Cross Product: Compact routing schemes for butterflies, mesh of trees and fat trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1470 LNCS, Issue , 1998, Pages 1029-1039

  Calamoneri, Tiziana ^a   Di Ianni, Miriam ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; NETWORK LAYERS; ROUTING PROTOCOLS; TREES (MATHEMATICS);

COMPACT ROUTING; CROSS PRODUCT; GENERAL GRAPH; INTERVAL ROUTING; MESH OF TREES; ROUTING SCHEME; SHORTEST PATH; SPACE AND TIME COMPLEXITY;

NETWORK ROUTING;

EID: 22044442740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0057963     Document Type: Conference Paper

References (14)

1. th ACM SPAA, 60-69, 1992.
2. M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela, "The complexity of interval routing in random graphs", MFCS 1995, LNCS 969, 37-49, 1995.
3. P. Fraigniaud, C. GavoiUe, "Optimal interval routing", CONPAR, LNCS 854, 785-796, 1994.
4. C. Gavoille, S. Perennes, "Lower bounds for shortest path interval routing", SIROCCO'96, 1996.
5. R. Kráľovič, P. Ružička, D. Štefankovič, "The complexity of shortest path and dilation bounded interval routing", Euro-Par'97, LNCS 1300, 258-265, 1997.
6. J. van Leenwen, R.B. Tan, "Computer networks with compact routing tables", in: G. Rozemberg and A. Salomaa (Eds.) The Book of L, Springer-Verlag, Berlin, 298-307, 1986.
7. J. van Leeuwen, R.B. Tan, "Interval routing", Computer Journal, 30, 298-307, 1987.
8. J. van Leeuwen, R.B. Tan, "Compact routing methods: a survey", Colloquium on Structural Information and Communication Complexity (SICC'94), 1994.
9. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmaan Publishers, Inc.,1992.
10. C.E. Leiserson, "Fat-Trees: universal networks for hardware-efficient supercomputing', IEEE Trans. on Comp., 34, 892-901, 1985.
11. P. Ružička, "On efficiency of Interval Routing algorithms", in: M.P. Chytil, L. Janiga, V. Koubeck (Eds.), MFCS 1988, LNCS 324, 492-500, 1988.
12. N. Santoro, R. Khatib, "Routing without routing tables", Tech. Rep. SCS-TR-6, School of Computer Science, Carleton University, 1982.
13. Also as: "Labelling and implicit routing in networks", Computer Journal, 28, 5-8, 1985.
14. S.S.H. Tse, F.C.M. Lau, "A lower bound for interval routing in general networks", Tech. Rep. 94-04, Dept. of Computer Science, The University of Hong Kong, 1994 (to appear in Networks).