Share Email Print
cover

Proceedings Paper

Resource assignment for sliding scheduled lightpath demands
Author(s): Rui Tang; Guoying Zhang; Haiyi Zhang
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

Modeling the traffic demands accurately has important significance for network resource utilization and performance optimization. The uncertainty of demands has made the long term forecasting of traffic a particularly difficult problem. So the traffic model named as sliding scheduled lightpath demands (SSLDs) is considered in this paper. A time-disjointness maximizing algorithm is proposed, which is combined with simulated annealing (SA) algorithm to solve routing and resource assignment problem for SSLDs. This solution is evaluated and compared with two fixed routing algorithms. Simulation results show that SA algorithm has a better performance for routing and resource assignment.

Paper Details

Date Published: 19 November 2008
PDF: 8 pages
Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71371U (19 November 2008); doi: 10.1117/12.802826
Show Author Affiliations
Rui Tang, Research Institute of Telecommunication Technology (China)
Guoying Zhang, Research Institute of Telecommunication Technology (China)
Haiyi Zhang, Research Institute of Telecommunication Technology (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