Share Email Print

Proceedings Paper

Capacity allocation for time-varying traffic in survivable WDM mesh networks
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 19 November 2008
PDF: 8 pages
Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71370G (19 November 2008); doi: 10.1117/12.804301
Show Author Affiliations
Meng Wu, Tsinghua Univ. (China)
Wenda Ni, Tsinghua Univ. (China)
Yabin Ye, Create-Net (Italy)
Xiaoping Zheng, Tsinghua Univ. (China)
Yili Guo, Tsinghua Univ. (China)
Hanyi Zhang, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 7137:
Network Architectures, Management, and Applications VI
Weisheng Hu; Shoa-Kai Liu; Ken-ichi Sato; Lena Wosinska, Editor(s)

© SPIE. Terms of Use
Back to Top