Fairness-based traffic grooming in survivable WDM mesh networks

Rongxi He; Haibo Wen; Limin Song; Lemin Li; Lei Guo; Hongbin Luo

doi:10.1117/12.572674

8 February 2005 Fairness-based traffic grooming in survivable WDM mesh networks

Rongxi He, Haibo Wen, Limin Song, Lemin Li, Lei Guo, Hongbin Luo

Proceedings Volume 5626, Network Architectures, Management, and Applications II; (2005) https://doi.org/10.1117/12.572674
Event: Asia-Pacific Optical Communications, 2004, Beijing, China

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.

Citation Download Citation

Rongxi He, Haibo Wen, Limin Song, Lemin Li, Lei Guo, and Hongbin Luo "Fairness-based traffic grooming in survivable WDM mesh networks", Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); https://doi.org/10.1117/12.572674

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