On multi-label linear interval routing schemes

Computer Journal

Volumn 39, Issue 2, 1996, Pages

  Kranakis, Evangelos ^a   Krizanc, Danny ^a   Ravi, S S ^b  

^a CARLETON UNIVERSITY   (Canada)

^b State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; DATA TRANSFER; GRAPH THEORY; OPTIMIZATION; SIGNAL ENCODING; TELECOMMUNICATION NETWORKS;

INTERVAL ROUTING;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0029698208     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Santoro, N. and Khatib, R. (1985) Labelling and Implicit Routing in Networks. The Computer Journal, 28, 5-8.
2. The T9000 Transputer Products Overview Manual (1991), Inmos.
3. Frederickson, G. N. and Janardan, R. (1998) Designing Networks with Compact Routing Tables. Algorithmica, 3, 171-190.
4. Frederickson, G. N. and Janardan, R. (1989) Efficient Message Routing in Planar Networks. SIAM J. Comput., 18, 843-857.
5. Frederickson, G. N. and Janardan, R. (1990) Space-Efficient Message Routing in c-Decomposable Networks. SIAM J. Comput., 19, 164-181.
6. van Leeuwen, J. and Tan, R. B. (1986) Computer Networks with Compact Routing Tables. In Rozenberg, G. and Salomaa, A. (eds) The Book of L, Springer-Verlag, Berlin, 259-273.
7. van Leeuwen, J. and Tan, R. B. (1987) Interval Routing. The Computer Journal, 30, 298-307.
8. Ružička, P. (1988) On the Efficiency of Interval Routing Algorithms. In Chytil, M. P., Janiga, L. and Koubek, V. (eds), Proceedings of MFCS, Carlsbad, Chechoslovakia, Aug.-Sep., Lecture Notes in CS, 324, 492-500.
9. Awerbuch, B., Bar-Noy, A., Linial, N. and Peleg, D. (1990) Improved Routing Strategies with Succinct Tables. J. Algorithms, 11, 307-341.
10. Awerbuch, B. and Peleg, D. (1992) Routing with Polynomial Communication-Space Trade-off. SIAM J. Disc. Math., 5, 151-162.
11. Bakker, E. M. (1991) Combinatorial Problems in Information Networks and Distributed Datastructuring. Ph.D. Thesis, Dept of Computer Science, Utrecht University, The Netherlands.
12. Bakker, E. M., van Leeuwen, J. and Tan, R. B. (1991) Linear Interval Routing Schemes. Algorithms Review, 2, 45-61.
13. Bakker, E. M., van Leeuwen, J. and Tan, R. B. (1993) Prefix Routing Schemes in Dynamic Networks. Computer Networks and ISDN Systems, 26, 403-421.
14. Harary, F. (1969) Graph Theory. Addison-Wesley Publishing Co., Reading, MA.
15. Tse, S. S. H. and Lau, F. C. M. (1996) Lower Bounds for Multi-label Interval Routing. In Kirousis, L. M. and Kranakis, E. (eds) Proceedings of 2nd Annual International Colloquium on Structure Information and Communication Complexity; Olympia, Greece, June 18-20, Carleton University Press, International Informatics Series, 2, 123-134.