Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
MPLS and Label Switching Networks
MPLS and Label Switching Networks
Advances in Network Simulation
Computer
Profile-Based Routing: A New Framework for MPLS Traffic Engineering
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Design and Implementation of MPLS Network Simulator Supporting LDP and CR-LDP
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Traffic engineering with MPLS in the Internet
IEEE Network: The Magazine of Global Internetworking
Reinforcement learning-based load shared sequential routing
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
On M-concurrency path computation and its application in dynamic service multi-layer networks
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Anycasting in connection-oriented computer networks: Models, algorithms and results
International Journal of Applied Mathematics and Computer Science - Computational Intelligence in Modern Control Systems
Autonomic interference avoidance with extended shortest path algorithm
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
QoS dynamic routing in content delivery networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
| Hi-index | 0.00 |
The main contribution of this paper is a new online routing algorithm, called Dynamic Online Routing Algorithm (DORA), for dynamic setup of bandwidth guaranteed paths in MPLS networks. The goal of DORA is to accept as many network path setup requests as possible by carefully mapping paths with reserved bandwidth evenly across the network. The key operation behind DORA is to avoid routing over links that: 1) have high potential to be part of any other paths, and 2) have less residual bandwidth available. We compare DORA against other existing constraint-based routing algorithms based on two performance metrics: path setup rejection ratio and percentage of successful reroutes. Our result shows that DORA performs better than the other algorithms in both metrics.