Cited By
View all- Yu RXue GZhang X(2017)The Critical Network Flow ProblemIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2017.274758825:6(3545-3558)Online publication date: 1-Dec-2017
A polynomial-time algorithm for computing disjoint lightpath pairs in minimum isolated-failure-immune WDM optical networks
Editor: R. Srikant Authors: 
Guoliang Xue, Ravi Gottapu, Xi Fang, Dejun Yang, Krishnaiyan ThulasiramanAuthors Info & Claims
Guoliang Xue, Ravi Gottapu, Xi Fang, Dejun Yang, Krishnaiyan ThulasiramanAuthors Info & ClaimsPages 470 - 483
Abstract
A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard when the underlying network topology is a general mesh network. As a result, heuristic algorithms and integer linear programming (ILP) formulations for solving this problem have been proposed. In this paper, we advocate the use of 2-edge connected (or 2-node connected) subgraphs of minimum isolated failure immune networks as the underlying topology for WDM optical networks. We present a polynomial-time algorithm for computing a pair of link-disjoint lightpaths with shortest total length in such networks. The running time of our algorithm is O(nW2), where n is the number of nodes, and W is the number of wavelengths per link. Numerical results are presented to demonstrate the effectiveness and scalability of our algorithm. Extension of our algorithm to the node-disjoint case is straightforward.
References
[1]
S. Ahuja, S. Ramasubramanian, and M. Krunz, "SRLG failure localization in all-optical networks using monitoring cycles and paths," in Proc. IEEE INFOCOM, 2008, pp. 700-708.
[2]
V. Anand and C. Qiao, "Static versus dynamic establishment of protection paths in WDM networks," J. High Speed Netw., vol. 10, pp. 317-327, 2001.
[3]
R. Andersen, F. Chung, A. Sen, and G. Xue, "On disjoint path pairs with wavelength continuity constraint in WDM networks," in Proc. IEEE INFOCOM, 2004, pp. 524-535.
[4]
D. Banerjee and B. Mukherjee, "Wavelength-routed optical networks: Linear formulation, resource budgeting tradeoffs, and a reconfiguration study," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 598-607, Oct. 2002.
[5]
R. Banner and A. Orda, "The power of tuning: A novel approach for the efficient design of survivable networks," IEEE/ACM Trans. Netw., vol. 15, no. 4, pp. 737-749, Aug. 2007.
[6]
H. F. Beltran and D. Skorin-Kapov, "On minimum cost isolated failure immune networks," Telecommun. Syst., vol. 3, pp. 183-200, 1994.
[7]
I. Chlamtac, A. Ganz, and G. Karmi, "Lightpath communications: An approach to high bandwidth optical WAN's," IEEE Trans. Commun., vol. 40, no. 7, pp. 1171-1182, Jul. 1992.
[8]
H. Choi, S. Subramaniam, and H. A. Choi, "On double-link failure recovery in WDM optical networks," in Proc. IEEE INFOCOM, 2002, pp. 808-816.
[9]
C. J. Colbourn and G. Xue, "Grade of service Steiner trees in series-parallel networks," in Advances in Steiner Trees, D. Z. Du, J.M. Smith, and J. H. Rubinstein, Eds. Norwell, MA, USA: Kluwer, 2000, pp. 163-174.
[10]
P. Datta and A. K. Somani, "Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures," Comput. Netw., vol. 52, pp. 2381-2394, (08).
[11]
D. A. Dunn, W. D. Grover, and M. H. MacGregor, "Comparison of k-shortest paths and maximum flow routing for network facility restoration," IEEE J. Sel. Areas Commun., vol. 2, no. 1, pp. 88-99, Jan. 1994.
[12]
J. Q. Hu, "Diverse routing in optical mesh networks," IEEE Trans. Commun., vol. 51, no. 3, pp. 489-494, Mar. 2003.
[13]
A. M. Farley, "Networks immune to isolated failures," Networks, vol. 11, pp. 255-268, 1981.
[14]
G. Jayavelu, S. Ramasubramanian, and O. Younis, "Maintaining colored trees for disjoint multipath routing under node failures," IEEE/ACM Trans. Netw., vol. 17, no. 1, pp. 346-359, Feb. 2009.
[15]
A. Jukan, AoS-based Wavelength Routing in Multi-Service WDM Networks. Vienna, Austria: Springer-Verlag/Wien, 2001.
[16]
R. M. Krishnaswamy and K. N. Sivarajan, "Design of logical topologies: A linear formulation for wavelength-routed optical networks with no wavelength changers," IEEE/ACM Trans. Netw., vol. 9, no. 2, pp. 186-198, Apr. 2001.
[17]
M. Kurant and P. Thiran, "Survivable routing of mesh topologies in IP-over-WDM networks by recursive graph contraction," IEEE J. Sel. Areas Commun., vol. 25, no. 5, pp. 922-933, Jun. 2007.
[18]
E. Leonardi, M. Mellia, and M. Marsan, "Algorithms for the logical topology design in WDM all-optical networks," Opt. Netw., vol. 1, pp. 35-46, 2000.
[19]
S. S. Lumetta and M. Medard, "Towards a deeper understanding of link restoration algorithms for mesh networks," in Proc. IEEE INFOCOM, 2001, pp. 367-375.
[20]
M. Medard, R. A. Barry, S. G. Finn, W. He, and S. S. Lumetta, "Generalized loop-back recovery in optical mesh networks," IEEE/ACM Trans. Netw., vol. 10, no. 1, pp. 153-164, Feb. 2002.
[21]
M. Medard, S. G. Finn, R. A. Barry, and R. G. Gallager, "Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs," IEEE/ACM Trans. Netw., vol. 7, no. 5, pp. 641-652, Oct. 1999.
[22]
E. Modiano and A. Narula-Tam, "Survivable lightpath routing: A new approach to the design of WDM-based networks," IEEE J. Sel. Areas Commun., vol. 20, no. 4, pp. 800-809, May 2002.
[23]
B. Mukherjee, "WDM optical communication networks: Progress and challenges," IEEE J. Sel. Areas Commun., vol. 18, no. 10, pp. 1810-1824, Oct. 2000.
[24]
C. Qiao and D. Xu, "Distributed partial information management (DPIM) schemes for survivable networks--Part I," in Proc. IEEE INFOCOM, 2002, pp. 302-311.
[25]
S. Ramamurthy and B. Mukherjee, "Survivable WDM mesh networks. Part I--Protection," in Proc. IEEE INFOCOM, 1999, pp. 744-751.
[26]
R. Ramaswami and K. N. Sivarajan, Optical Networks: A Practical Perspective. San Mateo, CA, USA: Morgan Kaufmann, 1998.
[27]
D. J. Rose, "On simple characterizations of k-trees," Discrete Math., vol. 7, pp. 317-322, 1974.
[28]
Q. She, X. Huang, and J. P. Jue, "How reliable can two-path protection be?," IEEE/ACM Trans. Netw., vol. 18, no. 3, pp. 922-933, Jun. 2010.
[29]
L. Shen, X. Yang, and B. Ramamurthy, "Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks," IEEE/ACM Trans. Netw., vol. 13, no. 4, pp. 918-931, Aug. 2005.
[30]
J. W. Suurballe, "Disjoint paths in a network," Networks, vol. 4, pp. 125-145, 1974.
[31]
K. Thulasiraman, M. Javed, and G. Xue, "Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks," in Proc. IEEE INFOCOM, 2009, pp. 1026-1034.
[32]
P. Thulasiraman, S. Ramasubramanian, and M. Krunz, "Disjoint multipath routing to two distinct drains in a multi-drain sensor network," in Proc. IEEE INFOCOM, 2007, pp. 643-651.
[33]
J. A. Wald and C. J. Colbourn, "Steiner trees, partial 2-trees, and minimum IFI networks," Networks, vol. 13, pp. 159-167, 1983.
[34]
D. B. West, Introduction to Graph Theory. Upper Saddle River, NJ, USA: Prentice-Hall, 1996, 2001.
[35]
G. Xue, L. Chen, and K. Thulasiraman, "Quality-of-service and quality protection issues in preplanned recovery schemes using redundant trees," IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1332-1345, Oct. 2003.
[36]
S. Yuan and J. P. Jue, "Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints," Comput. Netw., vol. 48, pp. 91-112, 2005.
[37]
W. Zhang, G. Xue, J. Tang, and K. Thulasiraman, "Faster algorithms for construction of recovery trees enhancing QoP and QoS," IEEE/ACM Trans. Netw., vol. 16, no. 3, pp. 642-655, Jun. 2008.
[38]
Q. Zheng and K. G. Shin, "Establishment of isolated failure immune real-time channels in HARTS," IEEE Trans. ParallelDistrib. Syst., vol. 6, no. 2, pp. 113-119, Feb. 1995.
[39]
S. Q. Zheng, J. Wang, B. Yang, and M. Yang, "Minimum-cost multiple paths subject to minimum link and node sharing in a network," IEEE/ACM Trans. Netw., vol. 18, no. 5, pp. 1436-1449, Oct. 2010.
Index Terms
- A polynomial-time algorithm for computing disjoint lightpath pairs in minimum isolated-failure-immune WDM optical networks
Recommendations
Dynamic lightpath allocation in translucent WDM optical networks
ICC'09: Proceedings of the 2009 IEEE international conference on CommunicationsThe optical reach (the distance an optical signal can travel before the signal quality degrades to a level that necessitates regeneration) ranges from 500 to 2000 miles. To establish a lightpath of length greater than the optical reach, it is necessary ...
Lightpath setup time optimization in wavelength routed all-optical networks
Wavelength Division Multiplexing (WDM) technology evolved to utilize effectively the enormous bandwidth of optical fiber. In circuit-switched WDM networks data transfer between a given pair of source and destination nodes takes place by using a ...
Dynamic lightpath establishment considering four-wave mixing in multifiber WDM networks
This paper proposes a dynamic lightpath establishment scheme considering four-wave mixing (FWM) in multifiber wavelength-division multiplexed (WDM) all-optical networks. The FWM is one of the most important physical impairments to be resolved in WDM ...
Comments
Information & Contributors
Information
Published In
Publisher
IEEE Press
Publication History
Published: 01 April 2014
Accepted: 01 March 2013
Revised: 06 August 2012
Received: 29 November 2011
Published in TON Volume 22, Issue 2
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 274Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025
Other Metrics
Citations
Cited By
View all- Yu RXue GZhang X(2017)The Critical Network Flow ProblemIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2017.274758825:6(3545-3558)Online publication date: 1-Dec-2017
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in