Traffic grooming algorithm based on Hamiltonian cycle protection in WDM mesh networks

Bing Xiang; Sheng Wang; Lemin Li; Hongfang Yu; Haibo Wen

doi:10.1117/12.519724

15 April 2004 Traffic grooming algorithm based on Hamiltonian cycle protection in WDM mesh networks

Bing Xiang, Sheng Wang, Lemin Li, Hongfang Yu, Haibo Wen

Proceedings Volume 5282, Network Architectures, Management, and Applications; (2004) https://doi.org/10.1117/12.519724
Event: Asia-Pacific Optical and Wireless Communications, 2003, Wuhan, China

Abstract

In WDM networks, the bandwidth request of a traffic stream is usually much lower than the capacity of a wavelength. Traffic grooming can aggregate low-rate connections onto high-capacity lightpaths to make efficient use of the bandwidth. But most of the researches related to traffic grooming focused on ring networks, and fewer concerns are about the dependable traffic grooming of low-rate connections in WDM mesh networks. In our study, we present a Hamiltonian Cycle Protection based Traffic Grooming algorithm (HCPTG) considering both the survivability and traffic grooming in WDM mesh networks. Simulation results show that good performance can be achieved in terms of capacity efficiency.

Citation Download Citation

Bing Xiang, Sheng Wang, Lemin Li, Hongfang Yu, and Haibo Wen "Traffic grooming algorithm based on Hamiltonian cycle protection in WDM mesh networks", Proc. SPIE 5282, Network Architectures, Management, and Applications, (15 April 2004); https://doi.org/10.1117/12.519724

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available