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

References

SHOWING 1-10 OF 37 REFERENCES
A New Function for Optimization of Working Paths in Survivable MPLS Networks
  • 11
Maximizing Restorable Throughput in MPLS Networks
  • 14
  • PDF
Virtual path routing for survivable ATM networks
  • 109
A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks
  • 18
Path selection and bandwidth allocation in MPLS networks
  • 47
  • PDF
Survivable Online Routing for MPLS Traffic Engineering
  • 16
  • PDF
A Lagrangean approach to network design problems
  • 28
Survivable design of reconfigurable MPLS VPN networks
  • Robert J. Cotter, D. Medhi
  • Computer Science
  • 2009 7th International Workshop on Design of Reliable Communication Networks
  • 2009
  • 3
  • PDF
...
1
2
3
4
...