Photonic Network Communications

, Volume 8, Issue 3, pp 239–249

Shared Sub-Path Protection Algorithm in Traffic-Grooming WDM Mesh Networks

  • Rongxi He
  • Haibo Wen
  • Lemin Li
  • Guangxing Wang
Article

Abstract

In this paper, we investigate the problem of dynamically establishing dependable connections in wavelength division multiplexing (WDM) mesh networks with traffic-grooming capabilities. We first develop a new wavelength-plane graph (WPG) to represent the current state of the network. We then propose a dynamic shared sub-path protection (SSPP) scheme based on this WPG. To establish a dependable connection, SSPP first searches a primary path for each connection request, and then it segments the found path into several equal-length sub-paths, and computes their corresponding backup paths, respectively. If two sub-paths in SSPP are fiber-disjoint then their backup paths can share backup resources to obtain optimal spare capacity. Based on dynamic traffic with different load, the performance of SSPP has been investigated via simulations. The results show that SSPP can make the tradeoffs between resource utilization and restoration time.

WDM mesh networks traffic grooming shared protection wavelength-plane graph sub-path protection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K. Zhu, B. Mukherjee, A review of traffic grooming in WDM optical networks: Architectures and challenges. Optical Net-works Magazine, vol. 4, no. 2, (March/April 2003), pp. 55–64.Google Scholar
  2. [2]
    R. Dutta, G. N. Rouskas, Traffic grooming in WDM networks: Past and future, IEEE Network, vol. 16, no. 6, (Nov./Dec. 2002), pp. 46–56.Google Scholar
  3. [3]
    K. Zhu, B. Mukherjee, On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks, Proc. of IEEE/OSA OFC' 02, (Anaheim, CA, U.S.A., March 2002), pp. 549–551.Google Scholar
  4. [4]
    K. Zhu, B. Mukherjee, Traffic grooming in an optical WDM mesh network, IEEE Journal on Selected Areas in Communications, vol. 20, no. I, (Jan. 2002), pp. 122–133.Google Scholar
  5. [5]
    S. Thiagarajan, A. Somani, Capacity fairness of WDM networks with grooming capabilities. Optical Networks Magazine, vol. 2, no. 3, (May/June 2001), pp. 2432.Google Scholar
  6. [6]
    O. Gerstel, R. Ramaswami, Optical layers survivability: An implementation perspective, IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, (Oct. 2000), pp. 1885–1899.Google Scholar
  7. [7]
    O. Gerstel, R. Ramaswami, Optical layers survivability: A services perspective, IEEE Communication Magazine, vol. 38, no. 3, (March 2000), pp. 104–113.Google Scholar
  8. [8]
    S. Ramamurthy, B. Mukherjee, Survivable WDM mesh networks, part Iprotection, Proc. of IEEE INEOCOM' 99, (New York, NY, U.S.A., March 1999), vol. 2, pp. 744–751.Google Scholar
  9. [9]
    S. Ramamurthy, B. Mukherjee, Survivable WDM mesh networks, part IIrestoration, Proc. of IEEE ICC' 99, vol. 3, (Vancouver, Canada, June 1999), pp. 2023–2030.Google Scholar
  10. [10]
    V. Anand, S. Chauhan, C. Qiao, Sub-path protection: A new framework for optical layer survivability and its quantitative evaluation, UB CSE Technical Report, Jan. 2002, http:// www.cse.buffalo.edu/tech-reports/2002-Ol.ps.Google Scholar
  11. [11]
    C. Qu, H. Zang, B. Mukherjee, Sub-path protection for scalability and fast recovery in WDM mesh networks, Proc. of IEEE/OSA OFC' 02, (Anaheim, CA, U.S.A., March 2002), pp. 495–97.Google Scholar
  12. [12]
    PH. Ho, T. M. Hussein, A framework for service-guaranteed shared protection in WDM mesh networks, IEEE Communication Magazine, vol. 40, no. 2, (Feb. 2002), pp. 97–103.Google Scholar
  13. [13]
    C. Ou, K. Zhu, B. Mukherjee, H. Zang, L. Sahasrabuddhe, Survivable traffic grooming in WDM mesh networks, Proc. of IEEE/OSA OFC' 03, vol. 2, (Atlanta, GA, U.S.A., March 2003), pp. 624–625.Google Scholar
  14. [14]
    S. Thiagarajan, A. K. Somani, Traffic grooming for survivable WDM mesh networks. Optical Networks Magazine, vol. 3, no. 3, (May/June 2002), pp. 88–98.Google Scholar
  15. [15]
    H. Wen, L. Li, R. He, H. Yu, S. Wang, N. Song, Dynamic grooming algorithms for survivable WDM mesh networks, Photonic Network Communications, vol. 6, no. 3, (Nov. 2003), pp. 253–263.Google Scholar
  16. [16]
    G. Li, D. Wang, C. Kalmanek, R. Doverspike, Efficient distributed path selection for shared restoration connections, Proc. of IEEE INFOCOM' 02, vol. I, (New York, NY, U.S.A., June 2002), pp. 140–149.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Rongxi He
    • 1
  • Haibo Wen
    • 2
  • Lemin Li
    • 2
  • Guangxing Wang
    • 1
  1. 1.College of Information EngineeringDalian Maritime University, Dalian 116026China and Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu 610054, China
  2. 2.Key Lab of Broadband Optical Fiber Transmission and Communication NetworksUniversity of Electronic Science and Technology of ChinaChengduChina

Personalised recommendations