Enhancement and Implementation of Dedicated Path Protection for SONET/SDH Network

Deepak Dhadwal; Ashok Arora; V R Singh

doi:https://doi.org/10.14445/22315381/IJETT-V14P222

Research Article | Open Access | Download PDF

Volume 14 | Number 1 | Year 2014 | Article Id. IJETT-V14P222 | DOI : https://doi.org/10.14445/22315381/IJETT-V14P222

Enhancement and Implementation of Dedicated Path Protection for SONET/SDH Network

Deepak Dhadwal , Ashok Arora , V R Singh

Citation :

Deepak Dhadwal , Ashok Arora , V R Singh, "Enhancement and Implementation of Dedicated Path Protection for SONET/SDH Network," International Journal of Engineering Trends and Technology (IJETT), vol. 14, no. 1, pp. 105-113, 2014. Crossref, https://doi.org/10.14445/22315381/IJETT-V14P222

Abstract

Synchronous Digital Hierarchy (SDH) and Synchronous Optical Network (SONET) are time-division multiplexing technologies which are used to provide the Bandwidth Services for the end user. Dynamic Service provisioning requires the use of online algorithms. These kind of algorithms compute the efficient paths and proceed data flow in it. The allocation of the path depends on the service requests and bandwidth demand. SONET/SDH networks multiplexing techniques are used for this purpose to allocate the medium for desired Bandwidth. In this paper we have applied an engine for the use of application and use of dedicated path protection for the SONET/SDH network. In this paper, we have investigated and implemented the dedicated path protection scheme and analyzed the performance matrices like blocking probability, Quality of services etc. The performance is evaluated for different values for the relative weight of dedicated path for the complete and minimum information scenarios.

Keywords

Dedicated protection, SONET/SDH, NP-completeness, Shared Risk Link Group (SRLG), Link, Trail.

References

[1] R. Madanagopal, N. U. Rani, and T. A. Gonsalves, “Path computation algorithms for dynamic service provisioning in SDH networks,” in Proc. 10th IFIP/IEEE IM, May 2007, pp. 206–215.
[2] W. Fawaz, B. Daheb, O. Audouin, B. Berde, M. Vigoureux, M. Du-Pond, and G. Pujolle, “Service level agreement and provisioning in optical networks,” IEEE Commun. Mag., vol. 42, no. 1, pp. 36–43, Jan. 2004.
[3] “Network node interface for the synchronous digital hierarchy (SDH),” ITU-T, Recommendation G.707/Y.1322, 2000.
[4] “Physical/electrical characteristics of hierarchical digital interfaces,” ITU-T, Recommendation G.703, 2001.
[5] “Types and characteristics of SDH network protection architectures,” ITU-T, Recommendation G.841, 1998.
[6] A. E. Ozdaglar and D. P. Bertsekas, “Routing and wavelength assignment in optical networks,” IEEE/ACM Trans. Netw., vol. 11, no. 2, pp. 259–272, Apr. 2003.
[7] H. Zang, C. S. Ou, and B. Mukherjee, “Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under ductlayer constraints,” IEEE/ACMTrans. Netw., vol. 11, no. 2, pp. 248–258, Apr. 2003.
[8] X. Chu, B. Li, and Z. Zhang, “A dynamic RWA algorithm in a wavelengthrouted all-optical network withwavelength converters,” in Proc.IEEE INFOCOM, Apr. 2003, pp. 1795–1804.
[9] M. Alanyali and E. Ayanoglu, “Provisioning algorithms for WDM optical networks,” IEEE/ACM Trans. Netw., vol. 7, no. 5, pp. 767–778, Oct. 1999.
[10] S. Janardhanan, A. Mahanti, D. Saha, and S. K. Sadhukhan, “A routing and wavelength assignment (RWA) technique to minimize the number of SONET ADMs inWDM rings,” in Proc. 39th HICSS, Jan. 2006, pp. 1–10.
[11] G. Shen and W. D. Grover, “Performance of protected working capacity envelopes based on p-cycles: Fast, simple, and scalable dynamic service provisioning of survivable services,” Proc. SPIE, vol. 5626, pp. 519–533, Feb. 2005.
[12] M. Kodialam and T. V. Lakshman, “Dynamic routing of bandwidth guaranteed tunnels with restoration,” in Proc. IEEE INFOCOM, Mar. 2000, pp. 902–911.
[13] J. Q. Hu, “Diverse routing in optical mesh networks,” IEEE Trans. Commun., vol. 51, no. 3, pp. 489–494, Mar. 2003.
[14] A. Todimala and B. Ramamurthy, “IMSH: An iterative heuristic for SRLG diverse routing inWDMmesh networks,” in Proc. 13th ICCCN, Oct. 2004, pp. 199–204.
[15] A. Todimala and B. Ramamurthy, “A heuristic with bounded guaranteed to compute diverse paths under shared protection in WDM mesh networks,” in Proc. IEEE GLOBECOM, Nov. 2005, pp. 1915–1919.
[16] P.-H. Ho, J. Tapolcai, and H. T. Mouftah, “Diverse routing for shared protection in survivable optical networks,” in Proc. IEEE GLOBECOM, Dec. 2003, pp. 2519–2523.
[17] D. Xu, Y. Xiong, and C. Qiao, “A new PROMISE algorithm in networks with shared risk link groups,” in Proc. IEEE GLOBECOM, Dec. 2003, pp. 2536–2540.
[18] 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.
[19] N. Ansari, G. Cheng, S. Israel, Y. Luo, J. Ma, and L. Zhu, “QoS provision with path protection for next generation SONET,” in Proc. IEEE ICC, Apr. 2002, pp. 2152–2156.
[20] A. Todimala, B. Ramamurthy, and N. V. Vinodchandran, “On computing disjoint paths with dependent cost structure in optical networks,” in Proc. 2nd BROADNETS, Oct. 2005, pp. 155–164.
[21] C. S. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, and B. Mukherjee, “Traffic grooming for survivableWDMnetworks—shared protection,” IEEE J. Sel. Areas Commun., vol. 21, no. 9, pp. 1367–1383, Nov. 2003.
[22] S. Balasubramanian and A. K. Somani, “Dynamic survivable network design for path level traffic grooming in WDM optical networks,” in Proc. IEEE GLOBECOM, Nov. 2007, pp. 2359–2363.
[23] C. S. Ou, L. H. Sahasrabuddhe, K. Zhu, C. U. Martel, and B. Mukherjee, “Survivable virtual concatenation for data over SONET/SDH in optical transport networks,” IEEE/ACM Trans. Netw., vol. 14, no. 1, pp. 218–231, Feb. 2006.
[24] J. W. Suurballe and R. E. Tarjan, “A quick method for finding shortest pairs of disjoint paths,” Networks, vol. 14, no. 2, pp. 325–336, 1984.
[25] Y. Guo, F. Kuipers, and P. V. Mieghem, “Link-disjoint paths for reliable QoS routing,” Int. J. Commun. Syst., vol. 16, no. 9, pp. 779–798, Nov. 2003.
[26] R. Bhandari, “Optimal diverse routing in telecommunication fiber networks,” in Proc. IEEE INFOCOM, Jun. 1994, pp. 1498–1508.
[27] S. Z. Shaikh, “Span-disjoint paths for physical diversity in networks,” in Proc. IEEE Symp. Comput. Commun., Jun. 1995, pp. 127–133.
[28] J. Y. Yen, “Finding the K shortest loopless paths in a network,” Manag Sci., vol. 17, no. 11, pp. 712–716, Jul. 1971.
[29] E. Q. V. Martins and M. M. B. Pascoal, “A new implementation of Yen’s ranking loopless paths algorithm,” 4OR, Quarter. J. Oper. Res., vol. 1, no. 2, pp. 121–133, Jun. 2003.
[30] “70 node network diagram (Network 1),” [Online]. Available: http://www.lantana.tenet.res.in/website_files/projects/NMS/nwdiagram1. Jp[31] “VSNL network diagram (Network 3),” [Online]. Available: http://www.lantana.tenet.res.in/website_files/projects/NMS/nwdiagram3. Jpg
[32] Available: http://en.wikipedia.org/wiki/Erlang_%28unit%29
[33] Available: en.wikipedia.org
[34] Madanagopal Ramachandran, N. Usha Rani, and Timothy A. Gonsalves, “Path Computation Algorithms for Dynamic Service Provisioning With Protection and Inverse Multiplexing in SDH/SONET Networks”, IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 5, OCTOBER 2010, pp: 1492–1054.