本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
相比于传统MRA算法，该算法生成的组播树中源点到组播成员节点的平均延时大约为前者的90%。
The average delay from the source to all destinations in the tree generated by the algorithm is about 90% of the traditional MRA algorithm.
基于生成树组播钥匙分配方案的各种方法在提供有效的用户删除方法的同时努力将用户钥匙存储最小化。
All kinds of different methods based on rooted-tree multicast key distribution schemes make efforts to minimize the user key storage while providing efficient member deletion.
本文作者分析讨论了组播路由协议的生成树构建方法，在此基础上进一步对IP组播技术中核心的组播路由协议和算法进行了分析。
This paper intends to discuss the way to construct the spanning tree, on which the algorithm for routing protocol, which is the kernel of the IP multicasting, shall be analyzed.
研究了由MSN节点组成的应用层组播网络，讨论了度约束最小直径生成树(D - MDST)问题，并给出了求解该问题的BCT算法。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for Degree-constrained Minimum Diameter Spanning Tree (D-MDST) problem.
仿真结果表明：与传统的LEO卫星网络组播路由算法相比，该算法具有较低的计算复杂度，生成的组播路由树具有较小的开销。
Simulations show that the computing complexity and the tree cost are lower than the traditional multicast routing algorithm for LEO satellite networks.
传统的聚合组播包括三个主要步骤，分别是候选树生成，树选择和组树匹配。
The traditional Aggregated Multicast was divided the problem into three sub-problems, namely, candidate tree generation, tree selection and group-to-tree mapping.
传统的聚合组播包括三个主要步骤，分别是候选树生成，树选择和组树匹配。
The traditional Aggregated Multicast was divided the problem into three sub-problems, namely, candidate tree generation, tree selection and group-to-tree mapping.
应用推荐