一种求解网络最大流问题的算法

An Algorithm for the Solution to the Maximum-flow Problem of Networks

随着网络应用的不断深入,人们对网络传输容量和服务质量的要求和期望也越来越高,设计高性能网络成为一项迫切的工作。缓存的配置直接影响网络的时延和丢失率,网络缓存和网络传输容量的合理匹配,能很好提高网络性能。文章简述了网络最大流问题的现状,提出了一种求解网络最大流问题的算法。算法基于MPLS流量工程技术,在实现网络最大流的情况下,同时对M条分支(链路)重新分配流量,达到合理分配网络流量和利用网络资源的目的。仿真结果表明算法是有效的。

With expansion of Internet application, people＇s expectation and requirement on network transmission capacity and service quality become higher and higher. Therefore, it is imperative to design the network with strong perform ance. Configuration of buffer memory directly influences the delay and loss rate of network. Good match between buffer memory of network and network capacity will improve performance of network. The condition of the maxlmum-flow problem is proposed simply in this article, and presents a algorithm for the solution to the maximum-flow problem of networks. The algorithm solutes the maximum-flow problem of networks based on MPLS traffic engineering technology,and distributes flow again to balance load and use network resources reasonable. The simulation results show the given algorithm is effective.