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, we first study the complexity of deriving minimum (in terms of number of intervals) Interval Routing schemes, proving the NP-completeness of such a problem and giving an approximation algorithm for it. Next, we propose a different routing model and show how it can be applied to improve the space requirements of representing shortest paths among all pairs of nodes for some specific network topologies. Networks considered are paths, rings, trees, hypercubes, different types of d-dimensional grids, complete graphs and complete bipartite graphs. We show that such an approach behaves strictly better than the classical Interval Routing Scheme in terms of classes of graphs which can be efficiently handled and of global knowledge mantained at each node. In particular, for all the above cases optimal representations are given. Moreover, we show that Boolean Routing is more powerful than any intervalbased routing scheme: this is done by showing that any such a scheme (on any graph) can be efficiently simulated by Boolean Routing.
Work supported by the ESPRIT II Basic Research Action Program of the European Community under contract No.7141 “Algorithms and Complexity II” and by the Italian MURST 40% project “Algoritmi, Modelli di Calcolo e Strutture Informative”.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. Afek, E. Gafni, M. Ricklin. Upper and lower bounds for routing schemes in dynamic networks. Proc. 30th Symp. on Foundations of Computer Science, pp. 370–375,1989.
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.
E. Bakker, J. van Leeuwen, R. Tan. Linear interval routing. Algorithms review, 2, 2, pp. 45–61, 1991.
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.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
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flammini, M., Gambosi, G., Salomone, S. (1993). Boolean Routing. In: Schiper, A. (eds) Distributed Algorithms. WDAG 1993. Lecture Notes in Computer Science, vol 725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57271-6_38
Download citation
DOI: https://doi.org/10.1007/3-540-57271-6_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57271-8
Online ISBN: 978-3-540-48029-7
eBook Packages: Springer Book Archive