On the Complexity of Finding a Minimum Cycle Cover of a Graph
SIAM Journal on Computing
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Introduction to Linear Optimization
Introduction to Linear Optimization
Allocation of Protection Domains in Dynamic WDM Mesh Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
A framework for service-guaranteed shared protection in WDM mesh networks
IEEE Communications Magazine
A novel distributed control protocol in dynamic wavelength-routed optical networks
IEEE Communications Magazine
Protection cycles in mesh WDM networks
IEEE Journal on Selected Areas in Communications
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
IEEE/ACM Transactions on Networking (TON)
Network survivability in large-scale regional failure scenarios
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Spare capacity reprovisioning for high availability shared backup path protection connections
Computer Communications
Redirection based recovery for MPLS network systems
Journal of Systems and Software
Availability-aware multiple working-paths capacity provisioning in GMPLS networks
IPOM'07 Proceedings of the 7th IEEE international conference on IP operations and management
An efficient fault-tolerant approach for MPLS network systems
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Efficient distributed solution for MPLS fast reroute
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 |
This paper introduces a novel approach, called Short Leap Shared Protection with spare capacity Reallocation (SLSP-R), to deal with dynamic reconfiguration of spare capacity for MPLS-based recovery in the Internet backbone networks. SLSP-R is based on the SLSP framework and is designed to quantify the impact of computation complexity on network performance. The basic idea for SLSP-R is to subdivide a lengthy optimization process into several subtasks in order to trade the optimization quality with computation time. For this purpose, we compare three strategies for grouping working paths before an integer programming (InP) formulation is solved, namely, the Most Overlapped, Most Diverse, and Randomly Distributed. Analytical modeling of the problem is provided to show the feasibility of the subgrouping strategy. A numerical experiment as well as simulation-based study are conducted on four networks with different topology to evaluate the SLSP-R algorithm. The design methodology to determine the size of each subset of working paths is verified in the simulation.