DocumentCode :
396055
Title :
On a preemptive multi-class routing scheme with protection paths for WDM networks
Author :
Sen, A. ; Shen, B.H. ; Hao, B. ; Jayakumar, H. ; Bandyopadhyay, S.
Author_Institution :
Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA
Volume :
2
fYear :
2003
fDate :
11-15 May 2003
Firstpage :
1417
Abstract :
A large optical network may carry multiple traffic classes with different priorities and fault-tolerance requirement. Higher priority traffic may require having a back-up path so that the traffic can be switched quickly to this path in case of a failure in the primary path. The lower priority traffic classes may not have any such requirement. In the path protection schemes currently in use for the WDM networks, a backup path is computed for all traffic, whenever a primary path is established between a source-destination pair. The resource needed for communication using the backup path are reserved (or set aside) for data communication between a source-destination pair, and are utilized only when the primary path is unavailable due to a failure in the network. The traffic carrying capacity of a network can be increased, if the resources set aside for the backup paths are utilized for data communication. In this paper we propose a path protection scheme for networks with multiple classes of traffic. The key features of our scheme are (i) not all traffic classes have backup paths - only higher priority classes have backup paths, (ii) primary paths of lower priority share wavelengths with secondary paths of higher priority traffic, and (iii) lower priority traffic can be preempted by higher priority traffic in case of a failure. The sharing of a wavelength between a primary path of a lower priority communication with the secondary path of a higher priority communication allows the network to satisfy more call requests, thereby reducing the call blocking probability. We provide a mathematical programming formulation for computing the primary and backup paths for call requests in a dynamic environment. We also compute the call blocking probability of our scheme and compare it with the call blocking probability of the conventional scheme through simulation. Our experimental results show significant gain by the proposed scheme over the conventional scheme.
Keywords :
mathematical programming; optical fibre networks; telecommunication network routing; telecommunication traffic; wavelength division multiplexing; WDM networks; call blocking probability; higher priority communication; lower priority communication; mathematical programming; multiclass routing scheme; multiple traffic class; optical network; path protection scheme; protection paths; wavelength division multiplexing; Computer networks; Data communication; Dynamic programming; Fault tolerance; Mathematical programming; Optical fiber networks; Protection; Routing; Telecommunication traffic; WDM networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2003. ICC '03. IEEE International Conference on
Print_ISBN :
0-7803-7802-4
Type :
conf
DOI :
10.1109/ICC.2003.1204624
Filename :
1204624
Link To Document :
بازگشت