最小化路径代价和流量均衡模型及算法

流量均衡是流量工程中为避免网络拥塞经常采用的路由优化目标,如何选择路径以使流量达到均衡分布是流量路由的研究热点和难点.为了最小化网络拥塞,该文在指出网络拥塞决定于流量路由时所选路径的拥塞特征后,建立了流量分布的最小化路径代价和模型.在流量路由选择路径时,提出基于瓶颈链路的最小代价路径路由算法.在实际的网络拓扑和流量矩阵数据基础上对所提模型及算法进行了实验验证,结果显示:在网络负载较大时最大链路利用率相对于已有模型可降低近20%.

Minimizing Sum of Path-cost Model and Algorithm for Traffic Balancing

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.