Abstract
We consider linear interval routing schemes studied in [3, 5] from a graph theoretic perspective. We examine how the number of linear intervals needed to obtain shortest path routings in networks is affected by the product, join and composition operations on graphs. This approach allows us to generalize some of the results in [3, 5] concerning the minimum number of intervals needed to achieve shortest path routings in certain special classes of networks. We also establish the precise value of the minimum number of intervals needed to achieve shortest path routings in the network considered in [11].
Research supported in part by NSERC grants OPG0137991 and OPG0122227.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, A. Bar-Noy, N. Linial and D. Peleg, “Improved Routing Strategies with Succinct Tables”, J. Algorithms, vol. 11, no. 3, Sept. 1990, pp. 307–341.
B. Awerbuch and D. Peleg, “Routing with Polynomial Communication-Space Trade-off”, SIAM J. Disc. Math., vol. 5, no. 2, May 1992, pp. 151–162.
E. M. Bakker, “Combinatorial Problems in Information Networks and Distributed Datastructuring”, Ph.D. Thesis, Dept. of Computer Science, Utrecht University, The Netherlands, 1991.
E. M. Bakker, J. van Leeuwen and R. B. Tan, “Prefix Routing Schemes in Dynamic Networks”, Tech. Report RUU-CS-90-10, Dept. of Computer Science, Utrecht University, The Netherlands, Mar. 1990.
E. M. Bakker, J. van Leeuwen and R. B. Tan, “Linear Interval Routing Schemes”, Tech. Report RUU-CS-91-7, Dept. of Computer Science, Utrecht University, The Netherlands, Feb. 1991.
G. N. Frederickson and R. Janardan, “Designing Networks with Compact Routing Tables”, Algorithmica, vol. 3, 1988, pp. 171–190.
G. N. Frederickson and R. Janardan, “Efficient Message Routing in Planar Networks”, SIAM J. Comput., vol. 18, no. 4, Aug. 1989, pp. 843–857.
G. N. Frederickson and R. Janardan, “Space-Efficient Message Routing in c-Decomposable Networks”, SIAM J. Comput., vol. 19, no. 1, Feb. 1990, pp. 164–181.
F. Harary, Graph Theory, Addison-Wesley Publishing Co., Reading, MA, 1969.
The T9000 Transputer Products Overview Manual, Inmos, 1991.
P. Ružička, “On the Efficiency of Interval Routing Algorithms”, in Proceedings of MFCS, Carlsbad, Chechoslovakia, Aug.–Sep. 1988, Lecture Notes in CS vol. 324 (Edited by M. P. Chytil, L. Janiga and V. Koubek), pp. 492–500, 1988.
N. Santoro and R. Khatib, “Labelling and Implicit Routing in Networks”, The Computer Journal, vol. 28, no. 1, 1985, pp. 5–8.
J. van Leeuwen and R. B. Tan, “Computer Networks with Compact Routing Tables”, in The Book of L, Edited by G. Rozenberg and A. Salomaa, Springer-verlag, Berlin 1986, pp 259–273.
J. van Leeuwen and R. B. Tan, “Interval Routing”, The Computer Journal, vol. 30, no. 4, 1987, pp. 298–307.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kranakis, E., Krizanc, D., Ravi, S.S. (1994). On multi-label linear interval routing schemes. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_64
Download citation
DOI: https://doi.org/10.1007/3-540-57899-4_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57899-4
Online ISBN: 978-3-540-48385-4
eBook Packages: Springer Book Archive