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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.