The complexity of shortest path and dilation bounded interval routing

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

Volumn 1300 LNCS, Issue , 1997, Pages 258-265

  Kralovic R ^a   Ruzicka P ^a   Stefankovic D ^a  

^a Physics and Informatics   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

CUBE-CONNECTED CYCLES; GENERAL NETWORKS; INTERVAL ROUTING; POINT-TO-POINT COMMUNICATION; POSITIVE CONSTANT; ROUTING TECHNOLOGIES; SHUFFLE-EXCHANGE GRAPHS; SPACE REQUIREMENTS;

NETWORK ROUTING;

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

References (17)

1. T. Eilam, S. Moran, S. Zaks: A Lower Bound for Linear Interval Routing. International Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, Springer Verlag, pp. 191-205, 1996.
2. M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela: The complexity of interval routing on random graphs. In MFCS, Lecture Notes in Computer Science 969, Springer-Verlag, pp. 37-49, 1995.
3. M. Flammini, E. Nardelli: On the Path Length in Interval Routing Schemes. Manuscript. Submitted for publication, 1997.
4. P. Fraigniaud, C. Gavoille: Optimal interval routing. In CONPAR, Lecture Notes in Computer Science 854, Springer-Verlag, pp. 785-796, 1994.
5. P. Fraigniaud, C. Gavoille: Local Memory Requirement of Universal Routing Schemes. In 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, June 1996.
6. C. Gavoille, S. Pérennes: Lower Bounds for Shortest Path Interval Routing. In SIROCCO, Siena, June 6-8, 1996.
7. C. Gavoille: On the Dilation of Interval Routing. Manuscript. Accepted to MFCS'97, August 1997.
8. R. Královië, P. Ruzicka, D. Stefankovič: The Complexity of Shortest Path and Dilation Bounded Interval Routing. Technical Report, Department of Computer Science, Comenius University, Bratislava, August 1996 (submitted for publication).
9. E. Kranakis, D. Krizanc: Lower Bounds for Compact Routing. In 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS), February 1996.
10. F. Meyer auf der Heide, C. Scheideler: Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. Proc. of the 37th Symposium on Foundations of Computer Science (FOCS), November 1996.
11. D. Peleg, E. Upfal: A Tradeoff between Space and Efficiency for Routing Tables. Journal of the ACM, 36, pp. 510-530, 1989.
12. P. Ružička: On the efficiency of interval routing algorithms. In MFCS'88, Lecture Notes in Computer Science 324, Springer-Verlag, pp. 492-500, 1988.
13. M. Santoro, R. Khatib: Labelling and implicit routing in networks. The Computer Journal, 28, pp. 5-8, 1985.
14. S.S.H. Tse, F.C.M. Lau: A lower bound for interval routing in general networks. Technical Report 94-04, Dept. of Computer Science, The University of Hong Kong, Hong Kong, p. 10, July 1994 (to appear in Networks).
15. S.S.H. Tse, F.C.M. Lau: Lower bounds for m, ulti-label interval routing. Proceedings of SIROCCO'95, pp. 123-134, 1995.
16. S.S.H. Tse, F.C.M. Lau: Two lower bounds for multi-label interval routing. Proceeding of Computing: The Australasian Theory Symposium (CATS'97), Sydney, Australia, February 1997.
17. J. van Leeuwen, R. B. Tan: Interval routing. The Computer Journal, 30, pp. 298-307, 1987