Quantifying the restoration capacity in optical mesh networks
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
A new heuristics/GA-based algorithm for the management of the S-DRWA in IP/WDM networks
APNOMS'07 Proceedings of the 10th Asia-Pacific conference on Network Operations and Management Symposium: managing next generation networks and services
| Hi-index | 0.00 |
Spare capacity planning is to find the minimum amount of spare capacity to be allocated throughout a network so that the network can survive from network component failures. In this paper, the spare capacity planning problem is investigated for long haul wavelength division multiplexing (WDM) networks. A three-step method is developed for solving the problem. First, heuristic approaches are used to select both candidate working routes and protection routes in order to achieve approximate optimal performance while maintaining a computational feasibility. Second, traffic requests are distributed on the obtained candidateworking and protection routes optimally using genetic algorithms (GA). Finally wavelengths are assigned to working lightpaths and shared protection lightpaths. The major advantage of the new approach is the ability to incorporate nonlinear constraints and nonlinear cost functions into the GA, which are introduced by sharing protection links between shared risk link groups (SRLG). Moreover, by considering SRLG constraints in the spare capacity planning phase, wavelengths can be allocated to each shared protection route before failures happen, sothat shorter restoration latency can be achieved. Numerical results illustrate that the proposed approach is more cost-effective than the single-path protection method.