MAXIMIZING RESTORABLE THROUGHPUT IN MPLS NETWORKS
M. Prasanna Lakshmi, N. Nithya Lakshmi · 2014
MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths are established in advance, before a failure event takes place. Most research on the establishment of primary and backup paths has focused on minimizing the added capacity required by the backup paths in the network. This so-called Spare Capacity Allocation (SCA) metric is less practical for network operators who have a fixed capacitated network and want to maximize their revenues. We present a comprehensive study on restorable throughput maximization in MPLS networks. We present the first polynomial-time algorithms for the split table version of the problem. We provide a lower bound for the approximation ratio and propose an approximation algorithm with an almost identical bound. We present an efficient heuristic which is shown to have excellent performance. One of our most important conclusions is that when one seeks to maximize revenue, local recovery should be the recovery scheme of choice. We present a comprehensive study on restorable throughput maximization in MPLS networks. We present the first polynomial-time algorithms for the split table version of the problem. We provide a lower bound for the approximation ratio and propose an approximation algorithm with an almost identical bound. We present an efficient heuristic which is shown to have excellent performance. One of our most important conclusions is that when one seeks to maximize revenue, local recovery should be the recovery scheme of choice. The IP routing protocols are not suitable for fast restoration. Using these protocols, a node first detects a failure and then disseminates routing updates to other nodes. These updates are used for calculating new paths. This process takes several seconds before proper routing of data can resume. During this time, packets