By Topic

Effective traffic grooming in WDM rings

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
$33 $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

3 Author(s)
A. R. B. Billah ; Dept. of Comput. Sci. & Eng., Wright State Univ., Dayton, OH, USA ; Bin Wang ; A. A. S. Awwal

Much work has focused on traffic grooming in WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing the number of ADMs, minimizing the number of wavelengths, single hub and multiple hub architectures, switching capabilities, etc. We derive general and tighter bounds on the number of wavelengths in WDM ring networks that may be capable of switching streams across wavelengths. We also study traffic grooming in unswitched UPSRs (unidirectional path-switched rings) and derive a more general lower bound for the number of ADMs required in traffic grooming. This bound reduces to special cases first obtained by E. Modiano and A. Chiu (see IEEE J. of Light-wave Technology, 2000). A cost-effective multi-phase traffic grooming algorithm is proposed and studied for UPSRs. Our numerical results show that this algorithm outperforms existing traffic grooming algorithms, resulting in traffic grooming that uses a lower number of ADMs. Our algorithm in many cases also reaches the general lower bound derived.

Published in:

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE  (Volume:3 )

Date of Conference:

17-21 Nov. 2002