Availability guarantee in survivable WDM mesh networks: A time perspective

  • Authors:
  • Xuetao Wei;Lei Guo;Xingwei Wang;Qingyang Song;Lemin Li

  • Affiliations:
  • College of Information Science and Engineering, Northeastern University, P.O. Box 134, Shenyang 110004, China and Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks, ...;College of Information Science and Engineering, Northeastern University, P.O. Box 134, Shenyang 110004, China and Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks, ...;College of Information Science and Engineering, Northeastern University, P.O. Box 134, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, P.O. Box 134, Shenyang 110004, China;Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu 610054, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.07

Visualization

Abstract

Since availability is an important quality-of-service (QoS) factor in mesh networks, different service provision with availability guarantee have been discussed by many researchers in the literature. However, with the increasing demand for mesh networks to support both data and real-time multimedia traffic, multiple availability requirements may be made during one connection's holding time. The traffic of different availability requirements has to be routed by special wavelengths. In this paper we discuss availability guarantee in mesh networks from the perspective of time and propose a new scheme called Time Aware Availability Guarantee (TAAG). The routing paths of each connection are adjusted according to the different availability requirements in different time spans. Simulation results show that the proposed scheme outperforms the previous schemes such as Time Unaware Availability Guarantee (TUAG) in terms of resource utilization, blocking probability and traffic throughput.