Share Email Print

Proceedings Paper

On lightpath scheduling in service differentiated survivable WDM mesh networks
Author(s): Qingshan Li; Wenda Ni; Yabin Ye; Yanhe Li; Yili Guo; Hanyi Zhang; Xiaoping Zheng
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Service differentiated survivable WDM mesh networks providing dedicated path protection and shared path protection are investigated under scheduled traffic. Scheduled routing with holding-time aware and unaware are studied for comparison. To tackle the service provisioning problem, an integer linear programming(ILP) formulation is presented for either situation to find the optimal service provisioning solution for a given set of traffic demands. Numerical results show that over 48% capacity savings are achieved when the holding-time knowledge is exploited.

Paper Details

Date Published: 19 November 2008
PDF: 7 pages
Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 713734 (19 November 2008); doi: 10.1117/12.803514
Show Author Affiliations
Qingshan Li, Tsinghua Univ. (China)
Wenda Ni, Tsinghua Univ. (China)
Yabin Ye, Create-Net (Italy)
Yanhe Li, Tsinghua Univ. (China)
Yili Guo, Tsinghua Univ. (China)
Hanyi Zhang, Tsinghua Univ. (China)
Xiaoping Zheng, 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