Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
01 January 2002
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth gauaranteed paths between customer sites [6,3,10,8]. 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.