Abstract
In this paper, the problem of routing messages along shortest paths in a network of processors without using complete routing tables is considered.
The Boolean Routing model is considered and it is shown that it provides optimal representations of all shortest routes on some specific network topologies (such as paths, rings, trees, hypercubes, different types of d-dimensional grids, complete graphs and complete bipartite graphs). Moreover, it is also shown that the model deals efficiently with graphs resulting from applying some types of graph compositions, thus resulting in very efficient routing schemes for some classes of networks with regular topology. This is done by considering different significant cost measures of the space efficiency of the schemes considered.
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”;.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Flammini, G. Gambosi, and S. Salomone. Boolean routing. In Proceedings 7th International Workshop on Distributed Algorithms (WDAG), volume 725 of Lecture Notes in Computer Science, pages 219–233. Springer-Verlag, 1993.
N. Santoro and R. Khatib. Labelling and implicit routing in networks. The Computer Journal, 28:5–8, 1985.
J. van Leeuwen and R.B. Tan. Routing with compact routing tables. In G. Rozemberg and A. Salomaa, editors, The book of L, pages 259–273. Springer-Verlag, 1986.
J. van Leeuwen and R.B. Tan. Interval routing. The Computer Journal, 30: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). On devising Boolean Routing schemes. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1995. Lecture Notes in Computer Science, vol 1017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_78
Download citation
DOI: https://doi.org/10.1007/3-540-60618-1_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60618-5
Online ISBN: 978-3-540-48487-5
eBook Packages: Springer Book Archive