Capacity allocation for time-varying traffic in survivable WDM mesh networks

Meng Wu; Wenda Ni; Yabin Ye; Xiaoping Zheng; Yili Guo; Hanyi Zhang

doi:10.1117/12.804301

19 November 2008 Capacity allocation for time-varying traffic in survivable WDM mesh networks

Meng Wu, Wenda Ni, Yabin Ye, Xiaoping Zheng, Yili Guo, Hanyi Zhang

Proceedings Volume 7137, Network Architectures, Management, and Applications VI; 71370G (2008) https://doi.org/10.1117/12.804301
Event: Asia-Pacific Optical Communications, 2008, Hangzhou, China

Abstract

Capacity allocation(CA) problem modelled by a new method for time-varying traffic is formulated and solved. An upper bound of the capacity saving is given by theoretical analysis. The numerical results show that approximately 25% of the total required capacity can be saved which corresponds to the theoretical analysis.

Citation Download Citation

Meng Wu, Wenda Ni, Yabin Ye, Xiaoping Zheng, Yili Guo, and Hanyi Zhang "Capacity allocation for time-varying traffic in survivable WDM mesh networks", Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71370G (19 November 2008); https://doi.org/10.1117/12.804301

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