本文研究了由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.
应用推荐