链路容量分配的最小最大原则并分组优化算法

A MIN MAX PRINCIPLE AND GROUPING OPTIMAL ALGORITHM FOR LINK CIRCUIT CAPACITY DISTRIBUTIVE

本文给出一种链路容量分配的新算法．应用此算法，不但可以得到与已有算法的链路容量分配相同的结果，而且还可以被用户所接受，在尽量减少链路时延差异情况下，具有最小网络时延的链路容量分配结果．对于通信软件和优化计算机网络。

In the article,a new algorithm for link circuit capacitr distributive is introduced.Using it,not only the original distributive result for link circuit capacity but also minimum network delay ditributive result for link circuit capacity which can be accepted by the users and reduce some contrast for link circuit delay is obtained. It has the significance for communication software and network optimum.