Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks

The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic Label Switched Path (LSP) routing is often enhanced using restoration routing which sets up alternate LSPs to guarantee uninterrupted connectivity in case network links or nodes along primary path fail. In this paper, we address the problem of distributed routing of restoration paths, which can be defined as follows: given a request for a bandwidth guaranteed LSP between two nodes, find a primary LSP and a set of backup LSPs that protect the links along the primary LSP. A routing algorithm that computes these paths must optimize the restoration latency and the amount of bandwidth used. In this paper, we introduce the concept of “backtracking” to bound the restoration latency. We consider three different cases characterized by a parameter called backtracking distance : (1) no backtracking ( ¼), (2) limite...

• Type: Conference
• Year: 2002
• Where: ICNP
• Authors: Erran L. Li, Milind M. Buddhikot, Chandra Chekuri, Jinhong Katherine Guo
• Keywords: Bandwidth Guaranteed Paths, Computer Networks, ICNP 2002, Primary Lsp, Restoration Latency