Share Email Print
cover

Proceedings Paper

Traffic grooming algorithm based on Hamiltonian cycle protection in WDM mesh networks
Author(s): Bing Xiang; Sheng Wang; Lemin Li; Hongfang Yu; Haibo Wen
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 15 April 2004
PDF: 8 pages
Proc. SPIE 5282, Network Architectures, Management, and Applications, (15 April 2004); doi: 10.1117/12.519724
Show Author Affiliations
Bing Xiang, Univ. of Electronic Science and Technology of China (China)
Sheng Wang, Univ. of Electronic Science and Technology of China (China)
Lemin Li, Univ. of Electronic Science and Technology of China (China)
Hongfang Yu, Univ. of Electronic Science and Technology of China (China)
Haibo Wen, Univ. of Electronic Science and Technology of China (China)


Published in SPIE Proceedings Vol. 5282:
Network Architectures, Management, and Applications
S. J. Ben Yoo; Kwok-wai Cheung; Yun-Chur Chung; Guangcheng Li, Editor(s)

© SPIE. Terms of Use
Back to Top