Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Zhou, S. Subramaniam (2000)
Survivability in optical networksIEEE Netw., 14
Wensheng He, Jing Fang, Arun Somani (2005)
A p-cycle based survivable design for dynamic traffic in WDM networksGLOBECOM '05. IEEE Global Telecommunications Conference, 2005., 4
Lei Guo, Jin Cao, Hongfang Yu, Le Li (2006)
Path-based routing provisioning with mixed shared protection in WDM mesh networksJournal of Lightwave Technology, 24
Rongxi He, Haibo Wen, Le Li, Guang-xing Wang (2004)
Shared Sub-Path Protection Algorithm in Traffic-Grooming WDM Mesh NetworksPhotonic Network Communications, 8
S. Kirkpatrick, C. Gelatt, Mario Vecchi (1983)
Optimization by Simulated AnnealingScience, 220
W. Grover, D. Stamatelakis (1998)
Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restorationICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220), 1
P. Ho, János Tapolcai, T. Cinkler (2004)
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnelsIEEE/ACM Transactions on Networking, 12
Sam Ou, H. Zang, N. Singhal, K. Zhu, L. Sahasrabuddhe, R. MacDonald, B. Mukherjee (2004)
Subpath protection for scalability and fast recovery in optical WDM mesh networksIEEE Journal on Selected Areas in Communications, 22
Wenda Ni, Xiaoping Zheng, C. Zhu, Yanhe Li, Yili Guo, Hanyi Zhang (2008)
Achieving Resource-Efficient Survivable Provisioning in Service Differentiated WDM Mesh NetworksJournal of Lightwave Technology, 26
E. Modiano, A. Narula-Tam (2002)
Survivable lightpath routing: a new approach to the design of WDM-based networksIEEE J. Sel. Areas Commun., 20
Dahai Xu, Yizhi Xiong, C. Qiao (2003)
Novel algorithms for shared segment protectionIEEE J. Sel. Areas Commun., 21
W. Grover (2004)
The protected working capacity envelope concept: an alternate paradigm for automated service provisioningIEEE Communications Magazine, 42
G. Shen, W. Grover (2003)
Exploiting forcer structure to serve uncertain demands and minimize redundancy of p-cycle networks, 5285
D. Schupke, C. Gruber, A. Autenrieth (2002)
Optimal configuration of p-cycles in WDM networks2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 5
S. Sebbah, B. Jaumard (2008)
Survivable WDM Networks Design with Non-Simple p-Cycle-Based PWCEIEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
A. Haque, P. Ho (2006)
OPN02-2: Inter-Group Shared Protection (I-GSP): A Scalable Solution for Survivable WDM NetworksIEEE Globecom 2006
Zhenrong Zhang, W. Zhong, S. Bose (2005)
Dynamically survivable WDM network design with p-cycle-based PWCEIEEE Communications Letters, 9
S. Ramamurthy, L. Sahasrabuddhe, B. Mukherjee (2003)
Survivable WDM mesh networksJournal of Lightwave Technology, 21
S. Sebbah, B. Jaumard (2009)
Design of flexible protection plans in survivable WDM networks: An application to PWCE2009 IEEE Sarnoff Symposium
M. Sridharan, M. Salapaka, Arun Somani (2002)
A practical approach to operating survivable WDM networksIEEE J. Sel. Areas Commun., 20
Protected Working Capacity Envelope (PWCE) has been proposed to simplify resource management and traffic control for survivable WDM networks. In a PWCE-based network, part of the link capacity is reserved for accommodating working routes, and the remaining capacity is reserved for backup routes. The shortest path routing is applied in PWCE-based networks. An arrival call is accepted only when each link along the shortest path has a free working channel. Such a working path routing scheme greatly simplifies the call admission control process for dynamic traffic, and it is especially suitable for implementation in a distributed manner among network nodes. In this article, we investigate two protection strategies: Bundle Protection (BP) and Individual Protection (IDP). In BP, only one backup path can be used to protect a failure component, whereas multiple backup paths can be used in IDP. We formulate four mixed integer non-linear programming (MINLP) problems using BP and IDP strategies for single link and single node failure protection. Each model is designed to determine link metrics for shortest working path routing, working and backup channel assignments, and backup path planning. Our objective is to minimize call-blocking probability on the bottleneck link. Since these models are highly non-linear and non-convex, it is difficult to obtain exact global optimal solutions. We propose a Simulated Annealing-based Heuristic (SAH) algorithm to obtain near optimal solutions. This SAH adopts the concepts of simulated annealing as well as the bi-section technique to minimize call-blocking probabilities. To evaluate the performance, we made simulation comparisons between SAH and the unity link weight assignment scheme. The results indicate that SAH can greatly reduce call-blocking probabilities on benchmark and the randomly generated networks.
Photonic Network Communications – Springer Journals
Published: Aug 15, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.