Minimizing Sum of Path-cost Model and Algorithm for Traffic Balancing
Yang Hua-wei① Wang Hong-bo① Cheng Shi-duan① Chen Shan-zhi② Lin Yu①
①(State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China) ②(State key Lab of Wireless Mobile Communication, China Academy of Telecommunication Technology,Beijing 100083, China)
Abstract：Traffic balancing in routing optimization targets to minimize network congestion in traffic engineering. How to select paths for traffic balancing becomes a challenging problem. For minimizing network congestion, this paper argues that network congestion is determined by paths’ congestion, and proposes the minimizing sum of path-cost model of traffic balancing. For path selection in routing traffic, a minimal cost path algorithm is proposed. On the basis of real network topology and traffic demand, experiments are conducted to verify the model and algorithm proposed, and results show a nearly 20% decrease of maximal link utilization when network is becoming congested.
杨华卫, 王洪波, 程时端, 陈山枝, 林宇. 最小化路径代价和流量均衡模型及算法[J]. 电子与信息学报, 2010, 32(10): 2415-2420.
Yang Hua-Wei, Wang Hong-Bo, Chen Shi-Duan, Chen Shan-Zhi, Lin Yu. Minimizing Sum of Path-cost Model and Algorithm for Traffic Balancing. , 2010, 32(10): 2415-2420.
2010, Vol. 32 
