Theory of Computing Systems

, Volume 36, Issue 2, pp 137–157 | Cite as

Routing in Series Parallel Networks

  • Paola Flocchini
  • Flaminia L. Luccio


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.


Short Path Space Complexity Parallel Composition Node Level Node Label 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York 2003

Authors and Affiliations

  • Paola Flocchini
    • 1
  • Flaminia L. Luccio
    • 2
  1. 1.SITE, University of Ottawa, Ottawa, CA
  2. 2.Università di Trieste, luccio@dsm.univ.trieste.itIT

Personalised recommendations