Optical Networks: Architecture and Survivability
Optical Networks: Architecture and Survivability
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
SIAM Journal on Optimization
WDM Mesh Networks: Management and Survivability
WDM Mesh Networks: Management and Survivability
IEEE/ACM Transactions on Networking (TON)
A dynamic partitioning sub-path protection routing technique in WDM mesh networks
ICCC '02 Proceedings of the 15th international conference on Computer communication
Provisioning Fault-Tolerant Scheduled Lightpath Demands in WDM Mesh Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
Emerging technologies for fiber network survivability
IEEE Communications Magazine
Routing and wavelength assignment of scheduled lightpath demands
IEEE Journal on Selected Areas in Communications
Energy saving and cost reduction in multi-granularity green optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new model for allocating resources to scheduled lightpath demands
Computer Networks: The International Journal of Computer and Telecommunications Networking
A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks
Photonic Network Communications
| Hi-index | 0.00 |
Survivable service provisioning design has emerged as one of the most important issues in communication networks in recent years. In this work, we study survivable service provisioning with shared protection under a scheduled traffic model in wavelength convertible WDM optical mesh networks. In this model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. Based on different protection schemes used, this problem has been formulated as integer linear programs with different optimization objectives and constraints in our previous work. The problem is NP-hard. We therefore study time efficient heuristic solutions to the problem. Our approach is based on an iterative survivable routing (ISR) scheme that utilizes a capacity provision matrix and processes demands sequentially using different demand scheduling policies. The objective is to minimize the total network resources (e.g., number of wavelength-links) used by working paths and protection paths of a given set of demands while 100% restorability is guaranteed against any single failure. The proposed algorithm is evaluated against solutions obtained by integer linear programming. Our simulation results indicate that the proposed ISR algorithm is extremely time efficient while achieving excellent performance in terms of total network resources used. The impact of demand scheduling policies on the ISR algorithm is also studied.