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 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算法。
Focuses on the algorithms of the minimum-delay spanning tree for the application-layer multicast, and proposes an improved BCT-H (balance compact tree-heuristic) algorithms based on strategy function.
文中着重研究构建最小延迟应用层组播树的算法,提出一种基于策略函数构造应用层最小直径组播树的启发式算法BCT - H。
应用推荐