A Lower Bound for Interval Routing in General Networks

Networks

Volumn 29, Issue 1, 1997, Pages 49-53

  Tse, Savio S H ^a   Lau, Francis C M ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

ARBITRARY GRAPHS; GENERAL NETWORKS; INTERVAL ROUTING; LABELING SCHEME; OPTIMAL LABELING; POINT-TO-POINT COMMUNICATION; SHORTEST PATH; SPACE EFFICIENT;

NETWORK ROUTING;

EID: 0346880118     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199701)29:1<49::AID-NET5>3.0.CO;2-C     Document Type: Article

References (7)

1. E. M. Bakker, J. van Leeuwen, and R. B. Tan, Linear interval routing schemes. Algor. Rev. 2 (1991) 45-61.
2. P. Fraigniaud and C. Gavoille, Interval Routing Schemes. Research Report No. 94-04, Laboratoire de L'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon (1994).
3. M. D. May, P. W. Thompson, and P. H. Welch, Eds., Networks, Routers and Transputers. IOS Press, Amsterdam (1993).
4. P. Ružička, A note on the efficiency of an interval routing algorithm. Comput. J. 34 (1991) 475-476.
5. N. Santoro and R. Khatib, Labelling and implicit routing in networks. Comput. J. 28 (1985) 5-8.
6. S. S. H. Tse and F. C. M. Lau, Lower bounds for multi-label interval routing. Proceedings of 2nd Colloquium on Structural Information & Communication Complexity (SI-ROCCO '95) (1995) 123-134.
7. J. van Leeuwen and R. B. Tan, Interval routing. Comput. J. 30 (1987) 298-307.