Abstract
Abstract. We consider the problem of routing messages between pairs of nodes of a distributed network, along shortest paths. We introduce a new routing technique, called Distance Routing that, due to its structure, is naturally well applicable on a family of networks called Series Parallel Graphs. We compute the time and space complexities of Distance Routing in Series Parallel Graphs, and we compare them with the relative complexities of Interval Routing, showing the improvement of Distance Routing especially in terms of time complexity.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Flocchini, P., Luccio, F.L. Routing in Series Parallel Networks . Theory Comput. Systems 36, 137–157 (2003). https://doi.org/10.1007/s00224-002-1033-y
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-002-1033-y