Simple Pre-Provisioning Scheme to Enable Fast Restoration

Abstract

Abstract-Supporting fast restoration for general mesh topologies with minimal network over-build is a technically challenging problem. Traditionally, ring-based SONET networks have offered close to 50 ms restoration at the cost of requiring 100% over-build. Recently, fast (local) reroute has gained momentum in the context of MPLS networks. Fast reroute, when combined with pre-provisioning of protection capacities and bypass tunnels, enables faster restoration times in mesh networks. Pre-provisioning has the additional advantage of greatly simplifying network routing and signaling. Thus, even for protected connections, online routing can now be oblivious to the offered protection, and may only involve single shortest path computations.In this paper, we are interested in the problem of reserving the least amount of the network capacity for protection, while guaranteeing fast (local) reroute-based restoration for all the supported connections. We show that the problem is NP-complete, and we present efficient approximation algorithms for the problem. The solution output by our algorithms is guaranteed to use at most twice the protection capacity, compared to any optimal solution. These guarantees are provided even when the protection is for multiple link failures. In addition, the total amount of protection capacity reserved by these algorithms is just a small fraction of the amount reserved by existing ring-based schemes (e.g., SONET), especially on dense networks. The presented algorithms are computationally efficient, and can even be implemented on the network elements. Our simulation, on some standard core networks, show that our algorithms work well in practice as well.

Maximizing Restorable Throughput in MPLS Networks

“…In addition, with this recovery scheme, the number of backup LSPs and the incurred state overhead are significantly reduced. 5) Extended k-facility local recovery (EkFLR) schemes [9] [ Fig. 1(e)]: Backup LSPs are constructed as in RLR.…”

Fast reroute with pre-established bypass tunnel in MPLS

“…The recently presented methods for restoration of label switched paths (LSP) are fast reroute extensions to RSVP-TE for LSP [8], Efficient Pre-Qualify [14,15], distributed label switched path (D-LSP) [16], simple pre-provisioning scheme [17] and the scheme of Hundessa [18,19] and Das [20].…”

“…Simple pre-provisioning scheme [17] reserves the least amount of protection capacity to guarantee the routing restoration, and computes the set of pre-installed bypass tunnels. It can offer the protection to online routing and only computes the single shortest path.…”

“…In the proposed method, each LSR establishes the bypass tunnels to its NNHop LSR, and the PBT (n hops) means that the bypass tunnels established by a LSR can have n extra hops over the LSR and its NNHop LSR. RSVP represents Extended RSVP [11], and Pre-Qualify represents Efficient Pre-Qualify [17]. Fig.…”

“…Some methods also consider the traffic engineering when establishing the backup path [7,9,11,17]. A broken link or LSR affects all working paths passing through it.…”