Performance Comparison of Protection Strategies in WDM Mesh Networks

• Autorzy: Singh H. K. , Aggarwal S. , Singh S. , Mohapatra B. , Nagaria R. K. , Tiwari S.
• Języki publikacji: EN

Abstrakty

EN

Recent development in optical networking employing wavelength division multiplexing (WDM) fulfills the high bandwidth demand applications. Failure of such networks, leads to enormous data and revenue loss. Protection is one of the key techniques, which is used in designing survivable WDM networks. In this paper we compare dedicated and shared protection strategies employed inWDMmesh networks to protect optical networks failure, particularly fiber failure. Dijkstra's shortest path algorithm is considered for carrying out simulations. The paper compares the performance of protection schemes, such as, dedicated path protection (DPP), shared path protection (SPP) and shared link protection (SLP) schemes. Capacity utilization, switching time and blocking probability are the parameters considered to measure the performance of the protection schemes. Simulation results show that, SPP is more efficient in terms of capacity utilization over DPP and SLP schemes, whereas, SLP offered better switching time than both DPP and SPP schemes. The average call drop rate is minimum for shared path protection scheme and maximum for shared link protection scheme.

Słowa kluczowe

EN

blocking probability; protection; survivability; switching time; WDM network

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2010
• Tom: nr 1
• Strony: 62--69
• Opis fizyczny: Bibliogr. 20 poz., rys., tab.

Twórcy

autor

Singh H. K.

autor

Aggarwal S.

autor

Singh S.

autor

Mohapatra B.

autor

Nagaria R. K.

autor

Tiwari S.

• Department of Electronics, and Communication Engineering, Motilal Nehru National Institute of Technology, Telierganj, Allahabad-211004, India,

Bibliografia

• [1] R. Ramaswami and K. N. Sivarajan, Optical Networks: A Practical Perspective. New Delhi: Morgan Kaufmann, 2002.
• [2] G. Mohan and A. K. Somani, “Routing dependable connections with specified failure restoration guarantees in WDM networks”, in Proc. IEEE INFOCOM Conf., Tel Aviv, Israel, 2000, pp. 1761–1770.
• [3] G. Mohan, C. S. R. Murthy, and A. K. Somani, “Efficient algorithms for routing dependable connections in WDM optical networks”, IEEE/ACM Trans. Netw., vol. 9, no. 5, pp. 553–566, 2001.
• [4] C. V. Saradhi, L. K. Wei, and M. Gurusami, “Provisioning faulttolerant scheduled lightpath demands in WDM mesh networks”, in Proc. Broadband Netw., BROADNETS Conf., San Jose, USA, 2004.
• [5] M. A. Azim, X. Jiang, P.-H. Ho, M. M. R. Khandker, and S. Horiguchi, “A new scheme for lightpath restoration in WDM networks”, in Proc. Parall. Proces. Worksh. ICPPW’04 Conf., Montreal, Canada, 2004.
• [6] S. Rani, A. K. Sharma, and P. Singh, “Resource allocation strategies for survivability in WDM optical networks”, Opt. Fiber Technol., vol. 13, no. 3, pp. 202–208, 2007.
• [7] S. Zhong and A. Jaekel, “Optimal priority-based lightpath allocation for survivable WDM networks”, in Proc. Comput. Commun. Netw. ICCCN 2004, Rosemont, USA, 2004, pp. 17–22.
• [8] J. L. Kennington, E. V. Olinick, and G. Spiride, “Basic mathematical programming models for capacity allocation in mesh-based survivable networks”, J. Manage. Sci., vol. 35, no. 6, pp. 629–644, 2007.
• [9] S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, “Survivable WDM mesh networks”, J. Lightw. Technol., vol. 21, no. 4, pp. 870–883, 2003.
• [10] B. T. Doshi, S. Dravida, P. Harshavardhana, O. Hauser, and Y. Wang, “Optical network design and restoration”, Bell Labs Techn. J., vol. 4, no. 1, pp. 58–84, 1999.
• [11] M. Sridharan, M. V. Salapaka, and A. K. Somani, “Operating mesh survivable WDM transport networks”, in Proc. SPIE Int. Symp. Terabit Opt. Netw., Boston, USA, 2000, pp. 113–123.
• [12] M. Sridharan, A. K. Somani, and M. V. Salapaka, “Approaches for capacity and revenue optimization in survivable WDM networks”, J. High Speed Netw., vol. 10, no. 2, pp. 109–125, 2001.
• [13] C. Sivakumar and G. Mohan, “Protocol for rapid restoration in WDM optical networks”, J. Comput. Commun., vol. 28, no. 1, pp. 86–96, 2005.
• [14] I. Cerutti, A. Fumagalli, and S. Sheth, “Performance versus cost analysis of WDM networks with dynamic traffic grooming capabilities”, in Proc. Comput. Commun. Netw. ICCCN 2004, Rosemont, USA, 2004, pp. 425–430.
• [15] B. Mohapatra, R. K. Nagaria, and S. Tiwari, “A review of survivable WDM optical networks for unicast and multicast traffic”, Int. J. Comput. Sci. Eng. Syst., vol. 3, no. 3, pp. 257–264, 2009.
• [16] W. D. Grover and D. Stamatelakis, “Cycle-oriented distributed preconfiguration: ring-like speed with meshlike capacity for selfplanning network restoration”, in Proc. IEEE Int. Conf. Commun. ICC 1998, Atlanta, USA, 1998, pp. 537–543.
• [17] D. Stamatelakis and W. D. Grover, “IP layer restoration and network planning based on virtual protection cycles”, IEEE J. Select. Areas Commun., vol. 18, no. 10, pp. 1938–1949, 2000.
• [18] D. Stamatelakis and W. D. Grover, “Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (“p-cycles”)”, IEEE Trans. Commun., vol. 48, no. 8, pp. 1262–1265, 2000.
• [19] W. D. Grover and D Stamatelakis, “Bridging the ring-mesh dichotomy with p-cycles”, in Proc. IEEE/VDE DRCN 2000 Conf., Munich, Germany, 2000, pp. 92–104.
• [20] H. Wang and H. T. Mouftah, “p-cycles in multi-failure network survivability”, in Proc. ICTON 2005 Conf., Barcelona, Spain, 2005, pp. 381–384.