Integer and combinatorial optimization
Integer and combinatorial optimization
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
INFORMS Journal on Computing
Path Generation Issues for Survivable Network Design
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
A Study on Two New Protection Strategies
IPOM '08 Proceedings of the 8th IEEE international workshop on IP Operations and Management
Designing demand-wise shared protection networks with specified minimum dual-failure restorability
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 0.00 |
In this paper, a new shared protection mechanism for meshed optical networks is presented. Significant network design cost reductions can be achieved in comparison to the well-known 1+1 protection scheme. Demand-wise Shared Protection (DSP) is based on the diversification of demand routings and exploits the network connectivity to restrict the number of backup lightpaths needed to provide the desired level of protection. Computational experiments illustrate the benefits of the DSP concept for cost efficient optical network designs.