Oblivious Routing Algorithm under Hose Model for WDM Mesh Network
In this paper, we introduce a novel oblivious routing scheme based on Valiant Load-Balancing for the model of polyhedral uncertainty (i.e., hose model), and the scheme is implemented with traffic-grooming approach in WDM mesh networks. Considering that a high-speed connection request in optical networks is difficult to be divided into low-speed connections, we propose the method of hose-model separation to support the multi-granularity connections for Valiant Load-Balanced oblivious routing in WDM mesh networks. Our Objective is to minimize total network cost. Two fast heuristic algorithms-MPCF and MRUF are proposed. Simulation results show MRUF performs better than MPCF.
Xiaoning Zhang Lemin Li Sheng Wang
Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks University of Electronic Science and Technology of China Chengdu, 610054, P. R. China
国际会议
2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)
广西桂林
英文
1908-1912
2006-06-25（万方平台首次上网日期，不代表论文的发表时间）