|
|
|
| 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.
|
|
Received: 15 October 2009
|
|
|
|
Corresponding Authors:
Yang Hua-wei
E-mail: ayoung@sina.com
|
|
|
|
|
|
|
2010, Vol. 32 
