How reliable can two-path protection Be?

IEEE/ACM Transactions on Networking

Volumn 18, Issue 3, 2010, Pages 922-933

  She, Qingya ^a   Huang, Xiaodong ^b   Jue, Jason P ^c  

^a FUJITSU LABORATORIES OF AMERICA   (United States)

^b Citrix Systems Inc   (United States)

^c The University of Texas at Dallas   (United States)

Author keywords

Availability; Diverse routing; Protection; Reliability; Survivability

Indexed keywords

COMPUTING COMPLEXITY; DIVERSE ROUTING; FAILURE PROBABILITY; LINK FAILURES; LINK RELIABILITY; LOWER BOUNDS; MAXIMUM RELIABILITY; MESH NETWORK; MIN-MAX; MIN-SUM; NP COMPLETE; PATH PROTECTION; PROTECTION; SOURCE-DESTINATION PAIRS; TIME EFFICIENCIES; TWO-LINK; UPPER BOUND; WORST CASE;

MESH NETWORKING; RELIABILITY;

HEURISTIC ALGORITHMS;

EID: 77953685576     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2036911     Document Type: Article

References (31)

1. W. D. Grover, Mesh-Based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Englewood Cliffs, NJ: Prentice-Hall, 2003.
2. B. Mukherjee, Optical WDM Networks. New York: Springer, 2006.
3. S. Ramamurthy and B. Mukherjee, "Survivable WDM networks. Part I\Protection," in Proc. IEEE INFOCOM, 1999, vol.2, pp. 744-751.
4. C. L. Li, S. T. McCormick, and D. Simchi-Levi, "The complexity of finding two disjoint paths with min-max objective function," Discrete Appl. Math., vol.26, no.1, pp. 105-115, Jan. 1990.
5. B. Yang, S. Q. Zheng, and S. Katukam, "Finding two disjoint paths in a network with min-min objective function," in Proc. IASTED Int. Conf. Parallel Distrib. Comput. Syst., 2003, pp. 75-80.
6. D. Xu, Y. Chen, Y. Xiong, C. Qiao, and X. He, "On finding disjoint paths in single and dual link cost networks," in Proc. IEEE INFOCOM, Mar. 2004, pp. 705-715.
7. J. W. Suurballe, "Disjoint paths in a network," Networks, vol.4, no.2, pp. 125-145, 1974.
8. J. W. Suurballe and R. E. Aarjan, "A quick method for finding shortest pairs of disjoint path," Networks, vol.14, no.2, pp. 325-336, 1984.
9. R. Bhandari, Survivable Networks Algorithms for Diverse Routing. Norwell, MA: Kluwer, 1999.
10. J. Hu, "Diverse routing in optical mesh networks," IEEE Trans. Commun., vol.51, no.3, pp. 489-494, Mar. 2003.
11. M. Tacca, A. Fumagalli, A. Paradisi, F. Unghvary, K. Gadhiraju, S. Lakshmanan, S. M. Rossi, A. C. Sachs, and D. S. Shah, "Differentiated reliability in optical networks: Theoretical and practical results," J. Lightw. Technol., vol.21, no.11, pp. 2576-2586, Nov. 2003.
12. W. D. Grover and D. Stamatelakis, "Cycle-oriented distributed pre-configuration: Ring-like speed with mesh-like capacity for self-planning network restoration," in Proc. IEEE ICC, Jun. 1998, vol.1, pp. 537-543.
13. H. Choi, S. Subramaniam, and H. Choi, "On double-link failure recovery in WDM optical networks," in Proc. IEEE INFOCOM, Jun. 2002,vol. 2, pp. 808-816.
14. M. Clouqueur and W. D. Grover, "Availability analysis of span-restorable mesh networks," IEEE J. Sel. Areas Commun., vol.20, no.4, pp. 810-821, May 2002.
15. B. G. Jozsa, D. Orincsay, and A. Kern, "Surviving multiple network failures using shared backup path protection," in Proc. IEEE ISCC, 2003, vol. 2, pp. 1333-1340.
16. D. Schupke and R. Prinz, "Performance of path protection and rerouting for wdm networks subject to dual failures," in Proc. OFC, 2003, vol.1, pp. 209-210.
17. X. Cheng, T. Y. Chai, X. Shao, and Y. Wang, "Complementary protection under double-link failure for survivable optical networks," in Proc. IEEE Globecom, 2006, pp. 1-5.
18. S. K. Ahuja and S. Ramasubramanian, "Enhancing robustness under dual-link failures," in Proc. ICCCN, 2007, pp. 510-515.
19. H. Komine, T. Chujo, T. Ogura, and T. Soejima, "A distributed restoration algorithm for multiple-link and node failures of transport networks," in Proc. IEEE Globecom, 1990, vol.1, pp. 459-463.
20. D. A. Schupke, A. Autenrieth, and T. Fischer, "Survivability of multiple fiber duct failures," in Proc. Int. Workshop DRCN, 2001, pp. 7-10.
21. S. Kim and S. Lumetta, "Evaluation of protection reconfiguration for multiple failures in WDM mesh networks," in Proc. OFC, Mar. 2003, vol.1, pp. 210-211.
22. M. T. Frederick and A. K. Somani, "A single-fault recovery strategy for optical networks using sub-graph routing," in Proc. IFIP Working Conf. Opt. Netw. Design Model., 2003, pp. 549-568.
23. J. Zhang, K. Zhu, and B. Mukherjee, "A comprehensive study on backup reprovisioning to remedy the effect of multiple-link failures in WDM mesh networks," in Proc. IEEE ICC, 2004, vol.3, pp. 1654-1658.
24. P.D.T. Connor, Practical Reliability Engineering. New York: Wiley, 1991.
25. R. Billinton and R. N. Allan, Reliability Evaluation of Engineering Systems: Concepts and Techniques. New York: Plenum, 1992.
26. M. L. Shooman, Reliability of Computer Systems and Networks: Fault Tolerance, Analysis, and Design. New York: Wiley-InterScience, 2002.
27. W. D. Grover, "High availability path design in ring-based optical networks,"IEEE/ACM Trans. Netw., vol.7, no.4, pp. 558-574, Aug. 1999.
28. R. L. Freeman, Telecommunication System Engineering. New York: Wiley, 1996.
29. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
30. C. Li, S. T. McCormick, and D. Simchi-Levi, "Finding disjoint paths with different path costs: Complexity and algorithms," Networks, vol.22, no.7, pp. 653-667, 1992.
31. "Rocketfuel maps," [Online]. Available: http://www.cs.wash- ington.edu/research/networking/rocketfuel/interactive/