Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Comparative analysis of path computation techniques for MPLS traffic engineering
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
A Load Balancing Scheme for Congestion Control in MPLS Networks
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Formulation of the Traffic Engineering Problems in MPLS Based IP Networks
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
| Hi-index | 0.00 |
This paper proposes a new approach for providing different levels of QoS in IP networks over MPLS. The system’s operator wishes to maximize the throughput of the high priority flows by choosing the less congested paths while taking care of the applications’ requirements. These requirements give rise to an optimization problem that consists of finding resource-constrained shortest paths in a directed graph. The problem can be formally cast in mathematical programming and its solution can follow two directions: (i) a centralized, heuristic approach that aims at approximating the optimal solution in a fast and efficient way; (ii) a distributed approach that relies on Lagrangean relaxation to decompose the optimization problem in small subproblems and thereby divide the computational burden between distributed routers. By means of numerical analysis and simulation, this paper demonstrates the effectiveness of the proposed approaches and shows QoS improvements of the high priority flows.