Efficient Protection in MPλS Networks Using Backup Trees: Part One—Concepts and Heuristics

Abstract

Multi-protocol lambda switching (MPλS) has recently been applied in the optical network control plane to provide fast lightpath provisioning. As an increasing amount of traffic is carried in optical transport networks (OTNs), single network failures can affect a vast amount of traffic, making lightpath protection crucial. Therefore, shared backup tree (BT) lightpath protection is a promising paradigm in MPλS networks due to its ability of fast recovery and its efficiency in consumed resources. A shared BT is used to protect a group of working lightpaths towards the same destination. From the working lightpaths in such a group, only one affected lightpath at a time can be recovered using the BT. The main problem is how to group and route the working paths (WPs) and how to route the BTs, in such a way that the capacity resources used by the WPs and the BTs are minimized. In Part One of this study (presented in this paper), we propose three approaches to cope with this problem. The first approach is a purely integer linear programming (ILP) based method. The second one is a combination of ILP and a heuristic technique. The last one is a purely heuristic approach. In this paper, these approaches are theoretically compared. In Part Two [1] of this study, several simulations are carried out in order to compare these approaches in terms of performance and computing effort. The experimental results are in line with the theoretical expectations.