Skip to main content
SpringerLink
Log in

Routing in Series Parallel Networks

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. SITE, University of Ottawa, Ottawa, flocchin@site.uottawa.ca , Ontario, Canada, CA

    Paola Flocchini

  2. Università di Trieste, luccio@dsm.univ.trieste.it, Trieste, Italy, IT

    Flaminia L. Luccio

Authors
  1. Paola Flocchini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Flaminia L. Luccio
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-002-1033-y

Keywords

Search

Navigation