Survivable design of reconfigurable MPLS VPN networks

Cotter, R.; Medhi, Deep

doi:10.1109/drcn.2009.5340021

Cited by 2 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Network survivability in MPLS Networks can be improved in several ways [2], [3]. One possibility is to enforce path diversity at the time of flow allocation, namely employing diversity constraints, where the volume of traffic is split into more than one path.…”

Section: Introductionmentioning

confidence: 99%

Dynamic alternative routing with local protection paths in MPLS networks

Francisco

Martins

Redol

et al. 2010

International Congress on Ultra Modern Telecommunications and Control Systems

View full text Add to dashboard Cite

MPLS is a core technology for nowadays and future networks, and must meet the needs of real-time applications for which network survivability is critical. Dynamic alternative routing has already been proposed several times to increase MPLS network performance. In this paper, a proposal of a protection scheme to be used with dynamic alternative routing is presented and its performance is evaluated through a simulation study.

show abstract

Section: Introductionmentioning

confidence: 99%

Dynamic alternative routing with local protection paths in MPLS networks

Francisco

Martins

Redol

et al. 2010

International Congress on Ultra Modern Telecommunications and Control Systems

View full text Add to dashboard Cite

show abstract

“…Moreover, since network technologies continue to improve and converge, protection and restoration schemes become available at multiple layers. Therefore, many researches formulate and solve different optimization problems related to network survivability [1], [3][4][5], [10], [20], [24][25][26][27][28][29][30].…”

Section: Introductionmentioning

confidence: 99%

A Lagrangean Relaxation Algorithm for Flow Optimization in Survivable MPLS Networks

Walkowiak¹

2010

Theoretical and Applied Informatics

View full text Add to dashboard Cite

The problem that this paper investigates, namely, the working route assignment (WRA) problem, is one that arises naturally from problems of survivable network design that have recently received significant attention in data networking community. We consider an existing MPLS backbone transport network, which is in an operational phase and augmenting its resources is not possible. To address the issue of network survivability we apply restoration, i.e. after a network failure broken connections are dynamically restored. The main goal of our work is twofold. First, we want to develop an effective objective function for optimization of working routes in order to scale network flows and prepare the network for future failures and restoration. Second, we plan to find an efficient method to solve the WRA problem with this new objective function. Therefore, a function called RCL (Residual Capacity and Lost Flow in Link) facilitating the function LFL (Lost Flow in Link) developed previously by the author is formulated. Next, we present an approximation approach, called Lagrangean relaxation with heuristics (LRH) aimed to solve WRA with RCL as objective function. We further draw comparisons between LRH and an existing heuristic based on Flow Deviation algorithm. We also examine the performance of RCL against other functions in the context of network survivability. The results of simulation tests demonstrate that the new algorithm provides sub-optimal results, which are significantly better than other heuristic and the new function RCL can be effectively applied for assignment of working routes in survivable MPLS networks.

show abstract

Survivable design of reconfigurable MPLS VPN networks

Cited by 2 publications

References 23 publications

Dynamic alternative routing with local protection paths in MPLS networks

Dynamic alternative routing with local protection paths in MPLS networks

A Lagrangean Relaxation Algorithm for Flow Optimization in Survivable MPLS Networks

Contact Info

Product

Resources

About