The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed.
研究有度和延时约束的覆盖多播路由问题，提出了一个新的覆盖多播路由协议-延时受限的树协议（DBTP）。
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.
研究了由MSN节点组成的应用层组播网络，讨论了度约束最小直径生成树(D - MDST)问题，并给出了求解该问题的BCT算法。
应用推荐