By Topic

Fairness-based dynamic traffic grooming in WDM mesh networks

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
$31 $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)
Rongxi He ; Sch. of Inf. Eng., Dalian Maritime Univ., China ; Haibo Wen ; Lemin Li

Under the constraints of the number of transceivers per node and wavelength continuity, the fairness issue of connections with different bandwidth granularities in traffic-grooming WDM mesh networks is investigated. Based on an auxiliary graph model, two fairness-based dynamic grooming algorithms are proposed. We evaluate the performance of our schemes via simulations. The results show that they provide good fairness while at the same time ensure a small increase in the overall traffic blocking probability.

Published in:

Communications, 2004 and the 5th International Symposium on Multi-Dimensional Mobile Communications Proceedings. The 2004 Joint Conference of the 10th Asia-Pacific Conference on  (Volume:2 )

Date of Conference:

29 Aug.-1 Sept. 2004