4th International IEEE Conference on Broadband Communications, Networks, Systems

Research Article

Approximating Optimal Survivable Sched Service Provisioning in WDM Optical Networks with Shared Risk Link Groups

  • @INPROCEEDINGS{10.1109/BROADNETS.2007.4550489,
        author={Tianjian Li and Bin Wang},
        title={Approximating Optimal Survivable Sched Service Provisioning in WDM Optical Networks with Shared Risk Link Groups},
        proceedings={4th International IEEE Conference on Broadband Communications, Networks, Systems},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2010},
        month={5},
        keywords={},
        doi={10.1109/BROADNETS.2007.4550489}
    }
    
  • Tianjian Li
    Bin Wang
    Year: 2010
    Approximating Optimal Survivable Sched Service Provisioning in WDM Optical Networks with Shared Risk Link Groups
    BROADNETS
    IEEE
    DOI: 10.1109/BROADNETS.2007.4550489
Tianjian Li1,*, Bin Wang2,*
  • 1: Cisco Systems, Inc San Jose, CA 95134
  • 2: Department of Computer Science and EngineeringWright State University Dayton, Ohio
*Contact email: litianjian99@yahoo.com, bin.wang@wright.edu

Abstract

Survivable service provisioning design has been an important issue in communication networks. In this work, we study survivable service provisioning using shared path based protection under a scheduled traffic model in wavelength convertible WDM optical mesh networks with Shared Risk Link Groups (SRLGs). In the scheduled traffic model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. The objective is to minimize the total network resources (e.g., the number of wavelength-links) used by working paths and protection paths of the given set of demands while 100% restorability is guaranteed against any single SRLG failure. This problem is known to be NP-hard. We therefore study a time efficient approach to approximating the optimal solution to the problem. Our proposed approach is based on an iterative survivable routing scheme that utilizes a capacity provision matrix and processes demands sequentially. Our simulation results indicate that the proposed ISR-SRLG algorithm achieves excellent performance in terms of the total network resources used.