Interval routing on layered cross product of trees and cycles

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

Volumn 1685 LNCS, Issue , 1999, Pages 1231-1239

  Kralovic R ^a   Rovan, B ^a   Ruzicka P ^a  

^a Physics and Informatics   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84878634769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48311-x_174     Document Type: Conference Paper

References (16)

1. T. Calamoneri, M. Di Ianni: Interval Routing and Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees. In Euro-Par'98, Lecture Notes in Computer Science 1470, Springer-Verlag, 1998, pp. 1029-1039. (Pubitemid 128125181)
2. S. Even, A. Litman: Layered Cross Product - A Technique to Construct Interconnection Networks. Networks, Vol. 29, 1997, pp. 219-223. (Pubitemid 127439351)
3. M. Flammini, G. Gambosi, U. Nanni, R. Tan: Multi-Dimensional Interval Routing Schemes. Theoretical Computer Science, Issue 1-2, 1998, pp. 115-133.
4. P. Fraigniaud, C. Gavoille: Interval Routing Schemes. Algorithmica 21, 1998, pp. 155-182. (Pubitemid 128664708)
5. C. Gavoille: A Survey on Interval Routing. Research Report RR-1182-97, LaBRI, Université Bordeaux I, October 1997. To appear in Theoretical Computer Science, 1999.
6. E. Kranakis, D. Krizanc, S.S. Ravi: On Multi-Label Linear Interval Routing. The Computer Journal, Vol. 39, No. 2, 1996, pp. 133-139.
7. R. Kráľovič, P. Ružička: Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing. Accepted to SIROCCO, 1999.
8. R. Kráľovič, P. Ružička, D. Štefankovič: The Complexity of Shortest Path and Dilation Bounded Interval Routing. In Euro-Par'97, Lecture Notes in Computer Science 1300, Springer-Verlag, 1997, pp. 258-265. Full version of the paper will appear in Theoretical Computer Science. (Pubitemid 127120767)
9. T. Leighton: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes. Morgan Kaufmann, San Mateo, CA, 1991.
10. L. Narayanan, S. Shende: Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes. In 3rd SIROCCO, Carleton Scientific, 1996, pp. 73-87.
11. P. Ružička: Efficient Communication Schemes. To Appear in Theoretical Computer Science.
12. P. Ružička, D. Štefankovič: The Complexity of Multi-Dimensional Interval Routing. To appear in Theoretical Computer Science, 1999.
13. N. Santoro, R. Khatib: Labelling and implicit routing in networks. The Computer Journal 28, 1985, pp. 5-8.
14. S.S.H. Tse, F.C.M. Lau: A Lower Bound for Interval Routing in General Networks. Networks, Vol. 29, No. 1, 1997, pp. 49-53. (Pubitemid 127439344)
15. J. van Leeuwen, R.B. Tan: Interval Routing. The Computer Journal 30, 1987, pp. 298-307.
16. J. van Leeuwen, R.B. Tan: Compact routing methods: A survey. In 1st International Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton Press, 1994, pp. 99-110.