树状军事通信网中的文件传输优化算法  

An optimal Algorithm for Files Transfer in the Tree-Type Network of Military Communication Network

作　　者：王洪利[1] 梁幼鸣[1] 

机构地区：[1]空军雷达学院,湖北武汉430019

出　　处：《情报指挥控制系统与仿真技术》2005年第3期33-36,共4页Information Command Control System and Simulation Technology

摘　　要：针对树状军事通信网中的文件传输优化问题,提出了一种有效的寻找最优的树图边着色算法,该算法保证了边着色后的树图中“延迟损耗”总和最小,并由求取最小“延迟损耗”的反向推导过程得到最优的树状通信网文件传输方案。算法的计算复杂度是Ο(n?2),其中n为顶点数,?为树的最大度。This paper introduces an efficient algorithm for the optimal edge-coloring of tree, which can solve the problem to optimize files transfer in tree-type military communication network like, and the algorithm makes sure that the sum of delay wastage of the edge-coloring tree is the smallest and receives the optimal project of files transfer by deducing reversely. The computational complexity of the algorithm is Ο( n ?2),n is the number of vertices and ? is the maximum degree of tree.

关 键 词：军事通信网 带成本边着色 延迟损耗 匹配 树状网 

分 类 号：E961[军事—军事通信学]