Resource assignment for sliding scheduled lightpath demands
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 timedisjointness 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.
traffic demands sliding time-disjointness simulated annealing routing resource assignment
Rui Tang Guoying Zhang Haiyi Zhang
Research Institute of Telecommunication Technology of Ministry of Information Industry,yuetansouth s Research Institute of Telecommunication Technology of Ministry of Information Industry,yuetan south
国际会议
2008亚太光通信会议(Asia-Pacific Optical Communications 2008)
杭州
英文
2008-10-26（万方平台首次上网日期，不代表论文的发表时间）