通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。
The problem of minimum cost multicast tree satisfying bandwidth request and delay-constraint in communication network is a NP-complete problem. It is difficult to be solved by traditional methods.
在组播树建立之初，计算好组播节点之间的最小代价路径，以便于出现故障之后寻找最优备用链路；
Using STP algorithm, the least cost paths between nodes are computed when computing the working tree, so the best backup path can be found as soon as the failure occurs.
在适合数据融合的生成树算法的基础上，分析能够有效延长网络生命的最小代价生成树路由协议的原理和特点。
Consider the too much redundant data and the non-balanced energy consumption of the routing protocol based on the minimum cost, proposed a new algorithm——MHEP routing algorithm.
该算法基于MPH算法的基本思想进行扩展，在满足时延限制条件和多播树代价增加最小的基础上，逐步将目的节点添加到多播树上。
This algorithm was based on MPH algorithm. It added the destination node to the tree step by step based on satisfying the delay constraint and increasing the multicast tree cost least.
这样，便解决了现有方法无法兼顾使测试代价相对最少和使生成的故障定位树相对最小的问题。
In this way, the invention solves the problems that the existing method cannot minimize the testing cost and the generated fault locating tree t relatively at the same time.
本文考虑到节点度的代价问题，提出了广义最小生成树的概念，并分析了最小生成树在实际应用中的局限性。
In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.
本文考虑到节点度的代价问题，提出了广义最小生成树的概念，并分析了最小生成树在实际应用中的局限性。
In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.
应用推荐