Data networks (2nd ed.)
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Telecommunications network design algorithms
Telecommunications network design algorithms
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Traffic Engineering Label Switched Paths in IP Networks using a Pre-Planned Flow Optimization Model
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
The parallel optimization of network bandwidth allocation based on generalized particle model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic load balancing without packet reordering
ACM SIGCOMM Computer Communication Review
Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
Computational Optimization and Applications
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
The parallel optimization of network bandwidth allocation based on generalized particle model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Anycasting in connection-oriented computer networks: Models, algorithms and results
International Journal of Applied Mathematics and Computer Science - Computational Intelligence in Modern Control Systems
A new function for optimization of working paths in survivable MPLS networks
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Scalable, optimal flow routing in datacenters via local link balancing
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
| Hi-index | 0.00 |
Multi-protocol label switching extends the IP destination-based routing protocols to provide new and scalable routing capabilities in connectionless networks using relatively simple packet forwarding mechanisms. MPLS networks carry traffic on virtual connections called label switched paths. This paper considers path selection and bandwidth allocation in MPLS networks in order to optimize the network quality of service. The optimization is based upon the minimization of a non-linear objective function which under light load simplifies to OSPF routing with link metrics equal to the link propagation delays. The behavior under heavy load depends on the choice of certain parameters. It can essentially be made to minimize maximal expected utilization, or to maximize minimal expected weighted slacks (both over all links). Under certain circumstances it can be made to minimize the probability that a link has an instantaneous offered load larger than its transmission capacity. We present a model of an MPLS network and an algorithm which optimally distributes the traffic among a set of active paths and reserves a set of back-up paths for carrying the traffic of failed or congested paths. The algorithm is an improvement of the well-known flow deviation non-linear programming method. The algorithm is applied to compute optimal LSPs for a 100-node network carrying a single traffic class. A link carrying some 1400 routes fails. The back-up paths are activated and we compare the performance of the path sets before and after the back-up paths are deployed.