Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

An Improved Shared-Path Protection Algorithm for Double-Link Failures in Meshed WDM Optical Networks

  • Wang, Xingwei (College of Information Science and Engineering, Northeastern University) ;
  • Guo, Lei (College of Information Science and Engineering, Northeastern University) ;
  • Li, Lemin (Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology) ;
  • Wei, Xuetao (Department of Computer of Science and Engineering, University of California)
  • Published : 2008.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we investigate survivability in wavelength division multiplexing (WDM) mesh networks and propose a new algorithm called improved shared-path protection (ISPP) to completely tolerate the double-link failures. Compared with previous algorithms for protecting double-link failures, i.e., shared-path protection (SPP) and shared-link protection (SLP), the advantage of ISPP is to allow primary paths and backup paths to share the mixed wavelength-links based on the proposed new rules in which some primary wavelength-links can be changed to mixed wavelength-links, which can be shared by primary paths and backup paths. In addition, some mixed wavelength-links also can be shared by different backup paths for saving resources. Simulation results show that ISPP algorithm performs better in resource utilization ratio and blocking probability than conventional SPP and SLP algorithms.

Keywords

References

  1. B. Mukherjee, Optical Communication Networks. New York: Mc-Graw- Hill, July 1997.
  2. G. Maier, A. Pattavina, S. Patre, and M. Martinelli, "Optical network survivability: protection techniques in WDM layer," Photon. Netw. Commun., vol. 4, pp. 251-269, June 2002. https://doi.org/10.1023/A:1016047527226
  3. D. Zhou and S. Subramaniam, "Survivability in optical networks," IEEE Netw., vol. 14, pp. 16-23, Nov./Dec. 2000.
  4. O. Gerstel and R. Ramaswami, "Optical layer survivability: A services perspective," IEEE Commun. Mag., vol. 38, pp. 104-113, Mar. 2002.
  5. S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, "Survivable WDM mesh networks," J. Lightw. Technol., vol. 21, pp. 870-883, Apr. 2003. https://doi.org/10.1109/JLT.2002.806338
  6. R. He, H. Wen, L. Li, and G. Wang, "Shared sub-path protection algorithm in traffic-grooming WDMmesh networks," Photon. Netw. Commun., vol. 8, pp. 239-249, Nov. 2004. https://doi.org/10.1023/B:PNET.0000041236.17592.b4
  7. S. Ramasubramanian, "On failure dependent protection in optical grooming networks," in Proc. DSN 2004, June 2004, pp. 440-449.
  8. S. Ramasubramanian and A. Harjani, "Comparison of failure dependent protection strategies in optical networks," Photon. Netw. Commun., vol. 12, pp. 195-210, Sept. 2006. https://doi.org/10.1007/s11107-006-0028-z
  9. M. Fredrick and A. Somani, "A single-fault recovery strategy for optical networks using subgraph routing," in Proc. ONDM 2003, Feb. 2003, pp. 549-568.
  10. W. He and A. Somani, "Path-based protection for surviving double-link failures in mesh-restorable optical networks," in Proc. IEEE GLOBECOM 2003, Dec. 2003, pp. 2558-2563.
  11. W. He,M. Sridharan, and A. Somani, "Capacity optimization for surviving double-link failures in mesh-restorable optical networks," Photon. Netw. Commun., vol. 9, pp. 99-111, Jan. 2005. https://doi.org/10.1007/s11107-005-4533-2
  12. H. Choi, S. Subramaniam, and H. A. Choi, "Loopback methods for double- link failure recovery in optical netw.," IEEE/ACM Trans. Netw., vol. 12, pp. 1119-1130, Dec. 2004. https://doi.org/10.1109/TNET.2004.838595
  13. L. Guo, H. Yu, and L. Li, "Path-based protection in WDM mesh networks subject to double-link failures," AEU-Int. J. Elect. Commun., vol. 60, pp. 467-470, July 2006. https://doi.org/10.1016/j.aeue.2005.10.010
  14. B. Jozsa, D. Orincsay, and A. Kern, "Surviving multiple network failures using shared backup path protection," in Proc. IEEE ISCC 2003, June 2003, pp. 1333-1340.
  15. J. Yen, "Finding the k shortest loopless paths in a network," Management Sci., vol. 17, pp. 712-716, July 1977.