Resource assignment for sliding scheduled lightpath demands

Rui Tang; Guoying Zhang; Haiyi Zhang

doi:10.1117/12.802826

19 November 2008 Resource assignment for sliding scheduled lightpath demands

Rui Tang, Guoying Zhang, Haiyi Zhang

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.

Citation Download Citation

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

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

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
8 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Algorithms

Networks

Wavelength division multiplexing

Optimization (mathematics)

Annealing

Algorithm development

Computer simulations

Show All Keywords

Keywords/Phrases

Search In:

Publication Years