摘要
研究了WDM网状网在hose业务模型下基于Valiant负载平衡的鲁棒选路问题。借助业务量疏导的方法,以hose模型吞吐量最大化为优化目标,采用整数线性规划(ILP)加以解决,进而提出了2种快速的启发式算法———最短路径选路的最小跳数优先(SPR&MHF)算法和平衡选路的最小跳数优先(BR&MHF)算法。计算机仿真表明,SPR&MHF算法适用于链路数较少的小规模WPM网状网,而BR&MHF适用于链路数较多的大规模WDM网状网。
The scheme of robust routing is investigated based on Valiant load-balancing under the hose uncertainty model,and the scheme is implemented into WDM mesh networks with traffic grooming. The optimization objective is to maximize the hose throughput. The mathematic formulation integer linear programming(ILP) is formulated. Two fast heuristic algorithms are proposed, Computer simulation results show SPR & MHF algorithm is fit for the WDM mesh networks with fewer links,and BR & MHF algorithm is fit for the WDM mesh networks with more links.
出处
《光电子.激光》
EI
CAS
CSCD
北大核心
2006年第11期1351-1355,共5页
Journal of Optoelectronics·Laser
基金
国家自然科学基金资助项目(90604002)
教育部新世纪优秀人才支持计划资助项目(NCET-05-0807)