基于图论最小费用流对偶算法的通信数据传输网的设计

Design of Communication Data Network Based on DualAlgorithm of Minimum Cost Flow of Graph Theory

随着互联网技术在社会各领域的广泛应用,人们对通信数据传输速度的要求越来越高.通信数据的传输量受资源等成本的制约.在有限的成本下,如何设计通讯数据传输网络,使数据的传输量达到最大化,是值得研究的问题.基于此问题,应用图论中的最小费用流对偶算法给出设计数据传输网络的一个有效的算法.并将简单的数据传输模型推广为更一般的模型,解决了更为普遍的一类通信数据传输问题.

With the wide application of Internet technology in various fields of society,people have higher and higher requirements for the transmission speed of communication data.However,the transmission capacity of communication data is also restricted by the cost of resources and other costs.Under the limited cost,how to design the communication data transmission network to maximize the transmission capacity of data is a problem worthy of study.Based on this problem,In this paper,an effective algorithm for designing data transmission network is given by using the dual algorithm of minimum cost flow in graph theory,and the simple data transmission model is extended to a more general model to solve a more general communication data transmission problem.