A Load-Balancing Spare Capacity Reallocation Approach in Service-Rich SONET Metro Mesh Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels
IEEE/ACM Transactions on Networking (TON)
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
On the complexity of and algorithms for finding the shortest path with a disjoint counterpart
IEEE/ACM Transactions on Networking (TON)
Group shared protection for spare capacity reconfiguration in optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
Multiple link failures survivability of optical networks with traffic grooming capability
Computer Communications
Routing connections with differentiated reliability requirements in WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Group shared protection for spare capacity reconfiguration in optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
Algorithms and models for backup reprovisioning in WDM networks
IEEE/ACM Transactions on Networking (TON)
MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization
Journal of Network and Computer Applications
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
A load-balancing spare capacity reallocation approach in the next-generation SONET metro networks
Optical Switching and Networking
| Hi-index | 0.00 |
This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows that a heuristic algorithm can also have better overall performance than its time-consuming, Integer Linear Programming (ILP) based counterparts in the on-line case, which is non-intuitive.The proposed heuristic algorithm is useful for developing effective shared path (mesh) protection schemes that establish survivable connections in modern networks. The advantage of our heuristic algorithm over existing algorithms for finding a pair of link (or node) disjoint paths, Active Path (AP) and Backup Path (BP) comes from the following salient feature. It uses a so-called Potential Backup Cost (PBC) function when selecting an AP in thefirst phase, in order to take into consideration the backup bandwidth needed by the corresponding BP yet to be chosen in the second phase. The PBC function is derived mathematically based on rigorous statistical analysis of experimental data. While the use ofPBC only requires partial aggregate information on existing connections and distributed control, it can also be applied even more effectively when complete information is available.