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 deriving minimum (in terms of number of intervals) interval routing schemes is analyzed under different requirements. For all the cases considered NP-hardness proofs are given, while some approximability results are provided. Moreover, relations among the different cases considered are studied.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive routing.Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 479–489.
B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Improved routing strategies with succinct tables.Journal of Algorithms,11 (1990), 307–341.
B. Awerbuch and D. Peleg. Routing with polynomial communication-space tradeoff.SIAM Journal on Discrete Mathematics,5(2) (1992), 151–162.
E. Bakker, J. van Leeuwen, and R. B. Tan. Linear interval routing.Algorithms Review,2 (1991), 45–61.
N. Christofides. Worst case analysis of a new heuristic for the travelling salesman problem. Report No. 388, GSIA, Carnegie-Mellon University, Pittsburgh, PA, 1976.
M. Flammini, G. Gambosi, and S. Salomone. Boolean routing.Proc. 7th Internat. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, vol. 725, Springer-Verlag, 1993, pp. 219–233.
P. Fraigniaud and C. Gavoille. A characterization of networks supporting linear interval routing.Proc. 13th ACM Symp. on Principles of Distributed Computing, 1994, pp. 216–224.
G. N. Frederickson and R. Janardan. Designing networks with compact routing tables.Algorithmica,3 (1988), 171–190.
G. N. Frederickson and R. Janardan. Efficient message routing in planar networks.SIAM Journal on Computing,18 (1989), 843–857.
G. N. Frederickson and R. Janardan. Space efficient message routing inc-decomposable networks.SIAM Journal on Computing,19 (1990), 164–181.
M. R. Garey and D. S. Johnson.Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
L. Kleinrock and F. Kamoun. Hierarchical routing for large networks.Computer Networks,1 (1977), 155–174.
L. Kleinrock and F. Kamoun. Optimal clustering structures for hierarchical topological design of large computer networks.Networks,10 (1980), 221–248.
D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables.Journal of the ACM,36(3) (1989), 510–530.
M. Santoro and R. Khatib. Labelling and implicit routing in networks.The Computer Journal,28 (1985), 5–8.
J. van Leeuwen and R. B. Tan. Routing with compact routing tables. InThe book of L, G. Rozemberg and A. Salomaa, eds., Springer-Verlag, New York, 1986, pp. 259–273.
J. van Leeuwen and R. B. Tan. Interval routing.The Computer Journal,30 (1987), 298–307.
Author information
Authors and Affiliations
Additional information
Communicated by G. N. Frederickson.
This work was 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.”
Rights and permissions
About this article
Cite this article
Flammini, M., Gambosi, G. & Salomone, S. Interval routing schemes. Algorithmica 16, 549–568 (1996). https://doi.org/10.1007/BF01944351
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01944351