Share Email Print
cover

Proceedings Paper

A new dynamic-grooming algorithm for IP over WDM optical networks
Author(s): Haibo Wen; Rongxi He; Hongfang Yu; Lemin Li; Sheng Wang; Bing Xiang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Efficiently grooming low-rate traffic flows into high-capacity lightpaths will improve the network throughput and resource utilization. In this paper, we study the traffic -grooming algorithm for WDM mesh networks. A novel dynamic grooming graph is proposed, which models the number of transceivers per node and the number of wavelength per fiber in addition to the combined information of IP layer and WDM layer, while taking into account the constraints of wavelength continuity in optical domain. Based on the grooming graph, a new dynamic traffic-grooming algorithm, namely Integrated Grooming Algorithm (IGA), is developed to provide an efficient solution to the traffic-grooming problem in WDM optical mesh networks. This algorithm is evaluated via simulations and results reveal that satisfactory performance of the proposed algorithms can be achieved.

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.517456
Show Author Affiliations
Haibo Wen, Univ. of Electronic Science and Technology of China (China)
Rongxi He, Northeastern Univ. (China)
Hongfang Yu, Univ. of Electronic Science and Technology of China (China)
Lemin Li, Univ. of Electronic Science and Technology of China (China)
Sheng Wang, Univ. of Electronic Science and Technology of China (China)
Bing Xiang, 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