A Lagrangean Relaxation Algorithm for Flow Optimization in Survivable MPLS Networks

K. Walkowiak

DOI:10.2478/V10179-010-0017-X

Corpus ID: 53443806

A Lagrangean Relaxation Algorithm for Flow Optimization in Survivable MPLS Networks

@article{Walkowiak2010ALR,
  title={A Lagrangean Relaxation Algorithm for Flow Optimization in Survivable MPLS Networks},
  author={K. Walkowiak},
  journal={Theoretical and Applied Informatics},
  year={2010},
  volume={22},
  pages={19-47}
}

K. Walkowiak
Published 2010
Computer Science
Theoretical and Applied Informatics

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… Expand

View via Publisher