On the solution of reroute sequence planning problem in MPLS networks

Authors:
Balázs Gábor Józsa;Márton Makai
Affiliations:
Traffic Analysis and Network Performance Laboratory, Ericsson Research Hungary and High Speed Networks Laboratory, Department of Telecommunication and Telematics, Budapest University of Technology ...;Department of Operations Research, Eötvös University and Communication Networks Laboratory, Eötvös University, H-1117 Pázmány Péter Sétány 1/A, Budapes ...
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2003

Citing 8
Cited 5

Balancing vectors in the max norm

Combinatorica
Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
On some geometric methods in scheduling theory: a survey

Discrete Applied Mathematics
Discrepancy theory

Handbook of combinatorics (vol. 2)
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Reroute Sequence Planning for Label Switched Paths in Multiprotocol Label Switching Networks

ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
MPLS and traffic engineering in IP networks

IEEE Communications Magazine
Traffic engineering with MPLS in the Internet

IEEE Network: The Magazine of Global Internetworking

Prompt partial path optimization in MPLS networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end available bandwidth as a random autocorrelated QoS-relevant time-series

Computer Networks: The International Journal of Computer and Telecommunications Networking
Simulation of Neurocomputing Based on Photophobic Reactions of Euglena: Toward Microbe---Based Neural Network Computing

UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Characterization of graphs and digraphs with small process numbers

Discrete Applied Mathematics
Walk the line: consistent network updates with bandwidth guarantees

Proceedings of the first workshop on Hot topics in software defined networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of reroute sequence planning for label switched paths (LSPs) in multiprotocol label switching networks from both the theoretical and practical points of view. This issue arises when the set of LSPs is recalculated by a central path optimization tool to attain a better resource utilization in the network. In this case a sequence of LSPs has to be found for their one by one reconfiguration without service interruption, involving the constraint that the link capacities should not be violated at any time during the rerouting process. The underlying problem is related to discrepancy theory and it is NP-complete. The conditions of existence of any feasible reroute sequence are examined, and algorithms are described for solving the problem. Alternative solutions are also presented for the case when feasible solutions do not exist, finally the performance of these algorithms is investigated by empirical analysis.