Abstract
In this paper, the problem of routing messages along shortest paths in a distributed network without using complete routing tables is considered. In particular, the complexity of designing minimum (in terms of number of intervals) Interval Routing Schemes is analyzed under different requirements. For all the considered cases NP-hardness proofs are given, while some approximability results are provided. Moreover, relations among the different considered cases are studied.
Work supported by the EEC ESPRIT II Basic Research Action Program under contract No.7141 “Algorithms and Complexity II”, by the EEC “Human Capital and Mobility” MAP project and by the Italian MURST 40% project “Algoritmi, Modelli di Calcolo e Strutture Informative”.
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, D. Peleg. Compact distributed data structures for adaptive routing. Proc. 21st ACM Symp. on Theory of Computing, pp. 479–489, 1989.
B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11, pp. 307–341, 1990.
N. Christofides. Worst case analysis of a new heuristic for the travelling salesman problem. Report No. 388, GSIA, Carnegie-Mellon University, Pittsburgh, PA, 1976.
G.N. Frederickson, R. Janardan. Designing networks with compact routing tables. Algorithmica, 3, pp. 171–190, 1988.
G.N. Frederickson, R. Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18, pp. 843–857, 1989.
G.N. Frederickson, R. Janardan. Space efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19, pp. 164–181, 1990.
M. Flammini, G. Gambosi, S. Salomone. Boolean Routing. Proc. 7th Int. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science n. 725, Springer Verlag, pp. 219–233, 1993.
M.R. Garey, D.S. Johnson. Computers and Intractability. A guide to the theory of NP-completeness. W.H. Freeman, San Francisco, 1979.
D. Peleg, E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36, 3, pp. 510–530, 1989.
M. Santoro, R. Khatib. Labelling and implicit routing in networks. The Computer Journal, 28, pp. 5–8, 1985.
J. van Leeuwen, R.B. Tan. Routing with compact routing tables. In “The book of L”, G. Rozemberg and A. Salomaa eds., Springer Verlag, pp. 259–273, 1986.
J. van Leeuwen, R.B. Tan. Interval routing. The Computer Journal, 30, pp. 298–307, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flammini, M., Gambosi, G., Salomone, S. (1995). Interval routing schemes. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_80
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive