IEEE/ACM Transactions on Networking (TON)
Reconfiguration for service and self-healing in ATM networks based on virtual paths
Computer Networks and ISDN Systems
Restoration strategies and spare capacity requirements in self-healing ATM networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
MPLS: technology and applications
MPLS: technology and applications
Approaches for capacity and revenue optimization in suvivable WDM networks
Journal of High Speed Networks - Survivable optical networks - part I
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Virtual-topology adaptation for WDM mesh networks under dynamic traffic
IEEE/ACM Transactions on Networking (TON)
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Dynamic reconfiguration in broadcast wdm networks
Dynamic reconfiguration in broadcast wdm networks
Lightpath re-optimization in mesh optical networks
IEEE/ACM Transactions on Networking (TON)
IEEE Journal on Selected Areas in Communications
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Scheduling bulk file transfers with start and end times
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic scheduling of network resources with advance reservations in optical grids
International Journal of Network Management
Hi-index | 0.00 |
This paper presents algorithms for re-optimizing network routing in connection-oriented networks such as Multi-Protocol Label Switched (MPLS) networks. The objective in re-optimization is to allow the network to carry more traffic without adding capacity. The need for re-optimization arises because of dynamic connection routing where connections, such as bandwidth guaranteed Label Switched Paths (LSPs) in MPLS networks, are routed as they arrive one-by-one to the network. Continual dynamic routing leads to network inefficiencies due to the limited information available for routing and due to simple path selection algorithms often used to satisfy connection set-up time constraints. We present a re-optimization scheme, where the re-optimizer constantly monitors the network to determine if re-optimization will lead to sufficient network efficiency benefits. When sufficient benefits can be obtained, the re-optimizer computes the least cost set of connections which must be re-routed to attain the necessary network efficiency and then computes the routes for the connections to be re-routed. We develop efficient re-optimization algorithms and demonstrate by simulations that several network performance metrics are significantly improved by re-optimization.