By Topic

Routing Wavelength and Timeslot Reassignment Algorithms for TDM based Optical WDM Networks - Multi rate traffic demands

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rajalakshmi, P. ; Dept. of Electr. Eng., Indian Inst. of Technol., Chennai ; Jhunjhunwala, A.

In this paper, we consider the problem of maximizing the time of first lightpath request rejection, T in the circuit-switched time division multiplexed (TDM) wavelength-routed (WR) optical WDM networks. TDM is incorporated into WDM, to increase the channel utilization when the carried traffic does not require the entire channel bandwidth. In TDM-WDM network, multiple sessions are multiplexed on each wavelength by assigning a sub-set of the TDM slots to each session. Thus, given a session request with a specified bandwidth, a lightpath has to be established by using the routing, wavelength and time-slot assignment (RWTA) algorithms. If the lightpath cannot be established, lightpath request rejection or call blocking occurs. As each lightpath is substantial revenue and long-lived, lightpath request rejection is highly unfavourable in the opitcal backbone networks. In this paper, we are proposing an intelligent routing, wavelength and time-slot reassignment algorithm for multi rate traffic demands, where, when a call gets blocked, the already established calls in the network are rerouted, wavelength and timeslot reassigned so as to accomodate the blocked call. Since we are talking of slow arrivals and long holding times for the lightpaths, it is possible to do this reassignment while provisioning a new call. Simulation based analyses are used to study the performance of the proposed reassignment algorithm. The results show that the proposed reassignment algorithm can be used to maximize the time of first call blocking, thereby accommodating more calls in the network before upgrading the network capacity.

Published in:

Networks, 2006. ICON '06. 14th IEEE International Conference on  (Volume:2 )

Date of Conference:

Sept. 2006