This is archived content, mostly untouched since 2003. For newer content/updated versions, see netfuture.ch/Publications.

  W and AWaldvogel & Aschwanden
   Roman Pletka
   Nicola Aschwanden
   Lars Waldvogel
    Kinderlieder+Spiele
   Marcel Waldvogel
    Contact
    Publications
     Traffic
      Backup Path
    Research
    Tutorials
    Classes
    Software
    Archive
    Fun

  

Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks

Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri:
Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks,
Computer Networks, 7 October 2004, 46(2):197-218.

Abstract

A Network Service Provider (NSP) operating a label-switched networks such as ATM or Multi-Protocol Label Switching (MPLS) networks, sets up end-to-end bandwidth-guaranteed Label-Switched Paths (LSPs) to satisfy the connectivity requirements of its client networks. To make such a service highly available, the NSP may set up one or more backup LSPs for every active LSP. The backup LSPs are activated when the corresponding active LSP fails. Accordingly, the problem of LSP routing with and without restoration backup has received some attention in the recent past.

In this paper, we investigate distributed algorithms for routing of end-to-end LSPs with backup restoration in the context of label-switched networks. Specifically, we propose a new concept of the Backup Load Distribution (BLD) matrix that captures partial network state and eliminates the problems of bandwidth wastage, pessimistic link selection, and bandwidth release ambiguity. We describe two new, distributed routing algorithms that utilize the BLD matrix and require a bounded amount of run time. We can realize these algorithms in the current Internet architecture using the OSPF extensions for Quality-of-Service (QoS) routing to exchange the proposed BLD matrix among peer routers/switches. Our simulation results for realistic sample topologies show an excellent (30-50%) improvement in terms of rejected requests and 30-40% savings in the total bandwidth used for backup connections. We also show that, although the performance of our routing scheme is sensitive to the frequency of BLD matrix updates, the performance degradation resulting due to stale state information is insignificant for typical update periods.

Documents

BibTeX entry

@Article{norden04routing,
  Author =       {Samphel Norden and Milind M. Buddhikot and Marcel Waldvogel and Subhash Suri},
  Title =        {Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks},
  Journal =	 {Computer Networks},
  Year =         2004,
  Volume =       46,
  Number =       2,
  Month =        "7 " # oct,
  Pages =        {197-218}
}

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.