%0 Journal Article
%T Minimizing Sum of Path-cost Model and Algorithm for Traffic Balancing<br>最小化路径代价和流量均衡模型及算法
%A Yang Hua-wei Wang Hong-bo Cheng Shi-duan Chen Shan-zhi Lin Yu
%A <br>杨华卫
%A 王洪波
%A 程时端
%A 陈山枝
%A 林宇
%J 电子与信息学报
%D 2010
%I 
%X 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.
%K IP traffic engineering
%K Routing optimization
%K Congestion minimizing
%K Traffic balancing<br>IP网流量工程
%K 路由优化
%K 最小化拥塞
%K 流量均衡
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=67FD676CF736CBBD4F21ABB5A46BE955&yid=140ECF96957D60B2&vid=9971A5E270697F23&iid=F3090AE9B60B7ED1&sid=449F46B0E3CF6ED3&eid=5F9592FD29258781&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=11