Abstract
Classes of network topologies are identified in which shortest-path information can be succinctly stored at the nodes, if they are assigned suitable names. The naming allows each edge at a node to be labeled with zero or more intervals of integers, representing all nodes reachable by a shortest path via that edge. Starting with the class of outerplanar networks, a natural hierarchy of networks is established, based on the number of intervals required. The outerplanar networks are shown to be precisely the networks requiring just one interval per edge. An optimal algorithm is given for determining the labels for edges in outerplanar networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
G. Chartrand and F. Harary, Planar permutation graphs,Annales de l'Institut Henri Poincaré, Section B3, 1967, pp. 433–438.
G. N. Frederickson, Approximation algorithms for some postman problems,Journal of the Association for Computing Machinery, Vol. 26, No. 3, July 1979, pp. 538–554.
G. N. Frederickson, Implicit data structures for the dictionary problem,Journal of the Association for Computing Machinery, Vol. 30, No. 1, January 1983, pp. 80–94.
G. N. Frederickson and R. Janardan, Optimal message routing without complete routing tables,Proceedings of the 5th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Calgary, August 1986, pp. 88–97.
G. N. Frederickson and R. Janardan, Separator-based strategies for efficient message routing,Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, Toronto, October 1986, pp. 428–437.
G. N. Frederickson and R. Janardan, Efficient fault-tolerant routings in outerplanar networks, manuscript, 1987.
F. Harary,Graph Theory, Addison-Wesley, Reading, MA, 1969.
R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs,SIAM Journal on Applied Mathematics, Vol. 36, No. 2, April 1979, pp. 177–189.
J. I. Munro and H. Suwanda, Implicit data structures for fast search and update,Journal of Computer and System Sciences, Vol. 21, No. 2, October 1980, pp. 236–250.
N. Santoro and R. Khatib, Labelling and implicit routing in networks,The Computer Journal, Vol. 28, No. 1, February 1985, pp. 5–8.
J. van Leeuwen and R. B. Tan, Computer networks with compact routing tables, inThe Book of L, G. Rozenberg and A. Salomaa (eds.), Springer-Verlag, New York, 1986, pp. 259–273.
J. van Leeuwen and R. B. Tan, Interval routing, Technical Report RUU-CS-85-16, Department of Computer Science, University of Utrecht, The Netherlands.
S. Warshall, A theorem on boolean matrices,Journal of the Association for Computing Machinery, Vol. 9, No. 1, January 1962, pp. 11–12.
Author information
Authors and Affiliations
Additional information
Communicated by Jeffrey Scott Vitter.
The research of this author was supported in part by the National Science Foundation under Grant DCR-8320124, and by the Office of Naval Research on contract N 00014-86-K-0689.
The research of this author was supported in part by the National Science Foundation under Grant DCR-8320124.
Rights and permissions
About this article
Cite this article
Frederickson, G.N., Janardan, R. Designing networks with compact routing tables. Algorithmica 3, 171–190 (1988). https://doi.org/10.1007/BF01762113
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01762113