MSTA constructed an overlay multicast tree in a dynamic, decentralized and incremental way.
MSTA以一种动态的，分散的，递增的方式构建一个覆盖多播树。
Modeling analysis proves that DCRTP reduces the influence of node failures on multicast tree.
通过建模分析，DCRTP控制环降低了节点失效对组播树的影响。
Based on logical topology similar to wavelength graph, the algorithm constructs the multicast tree.
提出的算法基于一种类似于波长图的逻辑拓扑来构造组播树。
Greedy algorithm achieves low cost multicast tree whose delay performance is worse than other trees.
贪婪算法是一种动态组播路由算法，该算法获得的通信树时延较大。
The multicast tree switching method and the device realize optimum forwarding path for multicast tree switching.
应用本发明提供的方法和装置使组播树切换时转发路径最优。
A new heuristic algorithm is presented for constructing low-cost multicast tree with end-to-end delay constraints.
提出了一种满足端到端时延限制的低代价多播路由算法。
Multicast algorithm is to build a multicast tree from the source node to destination nodes, and to assign wavelength.
组播算法就是要建立一棵从源节点到目的节点的组播树，并给这棵组播树分配波长。
The application level multicast tree is composed of the end hosts which can not ensure the stability of the multicast tree.
应用层组播树是由终端用户构造而成，其稳定性不能得到保证。
To improve the performance of multicast tree, a rearrangement dynamical multicast routing based on Clone Selection is proposed.
为了改善组播树的性能，本章提出了基于免疫克隆选择的重构动态组播路由算法。
An algorithm of multicast tree based on dividing cluster was put forward according to the characteristic of mobile networks in this paper.
针对移动网络的特点，提出了一种基于簇划分的多播树生成算法。
The approach allows a multicast user submit the quality of service requirements on demand and join or leave the multicast tree dynamically.
该方案允许组播成员提出服务质量要求并可以动态加入或离开组播树。
The result is that the delay-Jitter-SPF algorithm and the flow graph of the building of the multicast tree with QoS constraints are proposed.
结果是提出了基于延迟和延迟抖动约束的SPF算法，并给出了完整的建立组播树的流程图。
The advanced redundant tree algorithm reduces the number of nodes in multicast tree and the run time compared with the redundant tree algorithm.
改进的冗余树算法同冗余树算法相比不但有效的降低了组播树中节点数目，而且其计算时间也相对较少。
The formation, maintenance and optimization of DCRTP's multicast tree and the formation, recovery of DCRTP's control ring are designed in detail.
详细设计了DCRTP组播树的形成、维护和优化，设计了DCRTP控制环的形成和恢复。
The paper proposes a distributed algorithm for part message delay-constrained multicast routing directed at ensuring quality of service of multicast tree.
为保证受限多播树的服务质量，提出了一种利用局部信息的时延受限多播路由算法。
The protocol can search multiple feasible tree branches, and select the optimal or near optimal branch for connecting the new receiver to the multicast tree if it exists.
该协议可搜索多条可行树枝，并能选择一条最优(或近优)树枝将新成员连接到多播树。
With multicast tree aggregation, fewer trees are maintained which amounts to reduce both the number of forwarding states in routers and the overhead induced by control messages.
组播组的聚合使得网络中组播树的数量减少，路由器需要维持的组播转发状态和传递控制信息带来的控制开销都大大降低。
The simulation results show that the algorithm gains a greater improvement than other corresponding algorithms on reducing non-DHT links and the weighted radius of multicast tree.
实验结果表明该算法在减少非-DHT连接数量和降低树的加权半径方面相对于其它相关算法有了较大的改进。
This algorithm was based on MPH algorithm. It added the destination node to the tree step by step based on satisfying the delay constraint and increasing the multicast tree cost least.
该算法基于MPH算法的基本思想进行扩展，在满足时延限制条件和多播树代价增加最小的基础上，逐步将目的节点添加到多播树上。
This scheme lessens efficiently multicast traffic in network, and reduces multicast tree maintenance costs, but does not cause multicast data delivery to incur too large delivery delay.
该方案有效地减少了网络中的多播通信量并降低了多播树的维护代价，却没有给多播数据传输带来太大的延迟。
In the future, multicast technologies can be promoted through lowering the threshold for multicast applications, that is, decreasing the granularity for an optical network multicast tree.
未来，可以通过降低光网络组播树的粒度来降低光组播的使用门槛，这将有利于促进组播技术的更广泛使用。
This paper proposed a new self-healing mechanism based on pre-designed survivable ATM (Code division multiple access) multicast tree, which considers any single link and node failure case.
本文提出了一种采用预设计的方法生成可恢复ATM多播树的自愈机制，该机制考虑了多播树的任何单链路和单节点失效两种情况。
The algorithm makes use of the characteristic of Lagrange relaxation method, and finds multicast tree satisfying constraint by constructing closure graph and making relaxation to this graph.
该算法充分利用拉格朗日松弛方法的特点，通过构建封闭图，对封闭图进行拉格朗日松弛求得满足条件的多播树。
The second one is multicast routing algorithm based on Clone Selection algorithm, Clone Selection algorithm is a global optimization algorithm and can improve the performance of multicast tree.
第二种是基于免疫克隆选择算法的组播路由算法，该算法利用了免疫克隆选择算法全局搜索能力，提高组播树的性能。
The features of DSALM mainly includes: (1) Easy to implement, it doesn't have to construct and maintain a complex multicast tree, and also doesn't have to deploy multicast communication protocol.
DSALM的优点主要包括：1易于实现：不需要构建和维护复杂的结构化覆盖网络，也不需要部署特殊的组播通讯协议。
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.
通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。
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 problem.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
应用推荐