通信网络时延受限且满足带宽要求的最小代价组播树问题是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.
应用推荐