因此研究构造多播树的多播路由算法就非常重要。
Therefore, it is very important to research efficient multicast routing algorithms.
在许多多播应用中，降低多播树网络费用非常重要。
It is very important to reduce the cost of multicast trees in a lot of multicast applications.
针对移动网络的特点，提出了一种基于簇划分的多播树生成算法。
An algorithm of multicast tree based on dividing cluster was put forward according to the characteristic of mobile networks in this paper.
MSTA以一种动态的，分散的，递增的方式构建一个覆盖多播树。
MSTA constructed an overlay multicast tree in a dynamic, decentralized and incremental way.
为保证受限多播树的服务质量，提出了一种利用局部信息的时延受限多播路由算法。
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.
大多数路由算法使用的是基于单个服务质量指标的多播树优化方案，得到的是一棵树路由。
Most route algorithms take use of multi-tree optimizing project, which is based on a single targeting for service quality, and achieve the one-tree route.
该方案有效地减少了网络中的多播通信量并降低了多播树的维护代价，却没有给多播数据传输带来太大的延迟。
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.
该算法充分利用拉格朗日松弛方法的特点，通过构建封闭图，对封闭图进行拉格朗日松弛求得满足条件的多播树。
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.
本文提出了一种采用预设计的方法生成可恢复ATM多播树的自愈机制，该机制考虑了多播树的任何单链路和单节点失效两种情况。
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.
该算法基于MPH算法的基本思想进行扩展，在满足时延限制条件和多播树代价增加最小的基础上，逐步将目的节点添加到多播树上。
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.
仿真实验结果表明，随着分配带宽的减少，LCT算法能够有效地降低多播树的高度和网络资源使用量，并保持较低的多播树延时半径增幅。
The simulation results show that LCT could reduce both hops and network resource usage of the tree effectively, and keep a little increase in delay radius while the allocated bandwidth decreases.
本文将无线多播数据传输从功能的角度分成两部分：保证组播树的路由部分和保证数据传输部分。
This will be more wireless data transmissions from broadcast functional perspective is divided into two parts part guarantee Zubo tree routing and guarantee data transmission.
提出选择不同的树路由作为多播通信方案，以获得较低的综合代价保证网络负载均衡。
When multiple tree routes were selected as multicast communication solution, lower overall cost could be obtained to ensure network load balance.
该文提出了几种基于源转发树路由结构的多播路由表查找方案，并给出实验结果比较。
This paper gives several solutions of multicast route table lookup based on source-based route structure. And it gives experiment results and performance comparisons.
研究有度和延时约束的覆盖多播路由问题，提出了一个新的覆盖多播路由协议-延时受限的树协议（DBTP）。
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.
对于问题（2），本文提出了一个多应用级组播树MALMT构造算法，并且通过模拟实验，证明了它的可行性和优越性。
To problem (2), MALMT scheme propsed for Multi-Application-Level-Mutlicast, and with the simulation, we have proved its feasibility and advantage.
仿真实验表明，用该算法产生的多播路由树的费用比已存在的主要算法更好，并且适应于多播成员数的变化。
The simulation results show that the network cost of the routing trees generated by our approach is better than the other major existing algorithms, and flexible in multicast membership changes.
目前增强应用层组播鲁棒性的方案主要包括：降低失效节点发生频率、失效检测和树重构技术、多树环结构和使用洪泛机制。
At present, the scheme of enhancing robustness of the ALM include: reducing the frequency of failure nodes, failure detection and tree reconstruction technique, flood mechanism, multi-trees and rings.
目前增强应用层组播鲁棒性的方案主要包括：降低失效节点发生频率、失效检测和树重构技术、多树环结构和使用洪泛机制。
At present, the scheme of enhancing robustness of the ALM include: reducing the frequency of failure nodes, failure detection and tree reconstruction technique, flood mechanism, multi-trees and rings.
应用推荐