Paper
19 November 2008 Resource assignment for sliding scheduled lightpath demands
Rui Tang, Guoying Zhang, Haiyi Zhang
Author Affiliations +
Proceedings Volume 7137, Network Architectures, Management, and Applications VI; 71371U (2008) https://doi.org/10.1117/12.802826
Event: Asia-Pacific Optical Communications, 2008, Hangzhou, China
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.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Rui Tang, Guoying Zhang, and Haiyi Zhang "Resource assignment for sliding scheduled lightpath demands", Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71371U (19 November 2008); https://doi.org/10.1117/12.802826
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithms

Networks

Wavelength division multiplexing

Optimization (mathematics)

Annealing

Algorithm development

Computer simulations

RELATED CONTENT


Back to Top