Share Email Print
cover

Proceedings Paper

Fairness-based traffic grooming in survivable WDM mesh networks
Author(s): Rongxi He; Haibo Wen; Limin Song; Lemin Li; Lei Guo; Hongbin Luo
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Under the constraints of the number of transceivers per node and wavelength continuity, the fairness issue of connections with different bandwidth granularities in survivable traffic-grooming WDM mesh networks is investigated. An extended wavelength-plane graph (EWG) model and two dynamic grooming path protection algorithms with considering blocking fairness are proposed. Based on dynamic traffic with different load, the performance of our schemes has been evaluated via simulations. The results show that they provide good blocking fairness while at the same time ensure a small increase in the overall traffic blocking probability.

Paper Details

Date Published: 8 February 2005
PDF: 10 pages
Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.572674
Show Author Affiliations
Rongxi He, Dalian Maritime Univ. (China)
Haibo Wen, Alcatel Shanghai Bell Corp. (China)
Limin Song, Dalian Maritime Univ. (China)
Lemin Li, Univ. of Electronic Science and Technology of China (China)
Lei Guo, Univ. of Electronic Science and Technology of China (China)
Hongbin Luo, Univ. of Electronic Science and Technology of China (China)


Published in SPIE Proceedings Vol. 5626:
Network Architectures, Management, and Applications II
S. J. Ben Yoo; Gee-Kung Chang; Guangcheng Li; Kwok-wai Cheung, Editor(s)

© SPIE. Terms of Use
Back to Top