Robust path design algorithms for traffic engineering with restoration in MPLS networks

Abstract

In this paper we study traffic

Linear programming models for traffic engineering in 100% survivable networks under combined IS–IS/OSPF and MPLS-TE

“…This goal can be unachievable for pathological network topologies [49]. In [21] the SCA problem is addressed by separate design of working and restoration paths resulting in a minimum capacity usage; for this purpose, two LP models are sequentially solved. An improvement of the model is developed to take into account load balancing.…”

“…This is somewhat surprising, as several routing problems under realistic conditions are difficult, especially if survivability has to be taken into account, as discussed in Section 3. Indeed, while several optimization models under the MPLS-TE technology have been presented in the literature [20][21][22][23][24][25][26], the majority of these papers either only consider the normal (or working) condition, or deal with survivability constraints as a two phase design process, where the working paths are firstly chosen to optimize the routing in working conditions, and only then restoration (or backup) paths are selected that protect the links along the primary LSP. To the best of our knowledge, no paper considers at the same time optimal routing and survivability in the specific (but very reasonable in practice) set of technological requirements described here, which fortunately happen to make it easy to solve.…”

Maximizing Restorable Throughput in MPLS Networks

“…In [20], a local search algorithm which adopts the tabu search technique is proposed. In [21], a two-phase approach is proposed. First, a set of link-disjoint paths for a given set of demands is found.…”

Network protection design for MPLS networks

“…Kodialam and Lakshman [11] have presented optimization models and algorithms for guaranteed tunnels with restoration. Yetginer and Karasan [12] have given integer linear programming based formulation to design working and recovery paths, while optimizing the MPLS network. This paper considers one of the main issues for traffic engineering of MPLS networks: How to set up explicit label-switched paths between edges nodes of a MPLS network, such that a pre-defined objective is optimized.…”