# American Institute of Mathematical Sciences

October  2007, 3(4): 625-643. doi: 10.3934/jimo.2007.3.625

## On the partial path protection scheme for WDM optical networks and polynomial time computability of primary and secondary paths

 1 Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287, United States, United States, United States 2 School of Computer Science, University of Oklahoma, Norman, OK 73019, United States

Received  October 2006 Revised  July 2007 Published  October 2007

As a generalization of the traditional path protection (PP) scheme in WDM networks where a backup path is needed for each active path, the partial path protection (PPP) scheme uses a collection of backup paths to protect an active path, where each backup path in the collection protects one or more links on the active path such that every link on the active path is protected by one of the backup paths. While there is no known polynomial time algorithm for computing an active path and a corresponding backup path using the PP scheme for a given source destination node pair, we show that an active path and a corresponding collection of backup paths using the PPP scheme can be computed in polynomial time, whenever they exist, under each of the following four network models: (a) dedicated protection in WDM networks without wavelength converters; (b) shared protection in WDM networks without wavelength converters; (c) dedicated protection in WDM networks with wavelength converters; and (d) shared protection in WDM networks with wavelength converters. This is achieved by proving that that for any given source $s$ and destination $d$ in the network, if one candidate active path connecting $s$ and $d$ is protectable using PPP, then any candidate active path connecting $s$ and $d$ is also protectable using PPP. It is known that the existence of PP implies the existence of PPP while the reverse is not true. We demonstrate a similar result in the case of segmented path protection. This fundamental property of the PPP scheme is of great importance in the context of achieving further research advances in the area of protection and restoration of WDM networks.
Citation: Guoliang Xue, Weiyi Zhang, Tie Wang, Krishnaiyan Thulasiraman. On the partial path protection scheme for WDM optical networks and polynomial time computability of primary and secondary paths. Journal of Industrial & Management Optimization, 2007, 3 (4) : 625-643. doi: 10.3934/jimo.2007.3.625
 [1] Shinji Imahori, Yoshiyuki Karuno, Kenju Tateishi. Pseudo-polynomial time algorithms for combinatorial food mixture packing problems. Journal of Industrial & Management Optimization, 2016, 12 (3) : 1057-1073. doi: 10.3934/jimo.2016.12.1057 [2] Kyosuke Hashimoto, Hiroyuki Masuyama, Shoji Kasahara, Yutaka Takahashi. Performance analysis of backup-task scheduling with deadline time in cloud computing. Journal of Industrial & Management Optimization, 2015, 11 (3) : 867-886. doi: 10.3934/jimo.2015.11.867 [3] Hirotada Honda. On a model of target detection in molecular communication networks. Networks & Heterogeneous Media, 2019, 14 (4) : 633-657. doi: 10.3934/nhm.2019025 [4] Joseph D. Skufca, Erik M. Bollt. Communication and Synchronization in Disconnected Networks with Dynamic Topology: Moving Neighborhood Networks. Mathematical Biosciences & Engineering, 2004, 1 (2) : 347-359. doi: 10.3934/mbe.2004.1.347 [5] Aiwan Fan, Qiming Wang, Joyati Debnath. A high precision data encryption algorithm in wireless network mobile communication. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1327-1340. doi: 10.3934/dcdss.2019091 [6] Gaidi Li, Jiating Shao, Dachuan Xu, Wen-Qing Xu. The warehouse-retailer network design game. Journal of Industrial & Management Optimization, 2015, 11 (1) : 291-305. doi: 10.3934/jimo.2015.11.291 [7] Gabriella Bretti, Roberto Natalini, Benedetto Piccoli. Fast algorithms for the approximation of a traffic flow model on networks. Discrete & Continuous Dynamical Systems - B, 2006, 6 (3) : 427-448. doi: 10.3934/dcdsb.2006.6.427 [8] Dandan Hu, Zhi-Wei Liu. Location and capacity design of congested intermediate facilities in networks. Journal of Industrial & Management Optimization, 2016, 12 (2) : 449-470. doi: 10.3934/jimo.2016.12.449 [9] Eugenia N. Petropoulou, Panayiotis D. Siafarikas. Polynomial solutions of linear partial differential equations. Communications on Pure & Applied Analysis, 2009, 8 (3) : 1053-1065. doi: 10.3934/cpaa.2009.8.1053 [10] Young-Pil Choi, Jan Haskovec. Cucker-Smale model with normalized communication weights and time delay. Kinetic & Related Models, 2017, 10 (4) : 1011-1033. doi: 10.3934/krm.2017040 [11] Tanka Nath Dhamala. A survey on models and algorithms for discrete evacuation planning network problems. Journal of Industrial & Management Optimization, 2015, 11 (1) : 265-289. doi: 10.3934/jimo.2015.11.265 [12] Ashkan Mohsenzadeh Ledari, Alireza Arshadi Khamseh, Mohammad Mohammadi. A three echelon revenue oriented green supply chain network design. Numerical Algebra, Control & Optimization, 2018, 8 (2) : 157-168. doi: 10.3934/naco.2018009 [13] Robert Ebihart Msigwa, Yue Lu, Xiantao Xiao, Liwei Zhang. A perturbation-based approach for continuous network design problem with emissions. Numerical Algebra, Control & Optimization, 2015, 5 (2) : 135-149. doi: 10.3934/naco.2015.5.135 [14] Michelle L.F. Cheong, Rohit Bhatnagar, Stephen C. Graves. Logistics network design with supplier consolidation hubs and multiple shipment options. Journal of Industrial & Management Optimization, 2007, 3 (1) : 51-69. doi: 10.3934/jimo.2007.3.51 [15] Kazuhiko Kuraya, Hiroyuki Masuyama, Shoji Kasahara. Load distribution performance of super-node based peer-to-peer communication networks: A nonstationary Markov chain approach. Numerical Algebra, Control & Optimization, 2011, 1 (4) : 593-610. doi: 10.3934/naco.2011.1.593 [16] Xiao Lan Zhu, Zhi Guo Feng, Jian Wen Peng. Robust design of sensor fusion problem in discrete time. Journal of Industrial & Management Optimization, 2017, 13 (2) : 825-834. doi: 10.3934/jimo.2016048 [17] Santanu Sarkar, Subhamoy Maitra. Further results on implicit factoring in polynomial time. Advances in Mathematics of Communications, 2009, 3 (2) : 205-217. doi: 10.3934/amc.2009.3.205 [18] Chuang Peng. Minimum degrees of polynomial models on time series. Conference Publications, 2005, 2005 (Special) : 720-729. doi: 10.3934/proc.2005.2005.720 [19] Young-Pil Choi, Seung-Yeal Ha, Jeongho Kim. Propagation of regularity and finite-time collisions for the thermomechanical Cucker-Smale model with a singular communication. Networks & Heterogeneous Media, 2018, 13 (3) : 379-407. doi: 10.3934/nhm.2018017 [20] Tomáš Gedeon. Attractors in continuous –time switching networks. Communications on Pure & Applied Analysis, 2003, 2 (2) : 187-209. doi: 10.3934/cpaa.2003.2.187

2018 Impact Factor: 1.025

## Metrics

• HTML views (0)
• Cited by (2)

• on AIMS