| 1. | A least redundant packets multicast tree sharing algorithm based on obs networks
网络的一种最少冗余包的组播树共享算法 |
| 2. | Multicast routing algorithms are used to compute a multicast trees of good performance
多播路由算法主要就是用来建立一棵性能较好的多播树。 |
| 3. | In this algorithm , we represent the chromosomes of the multicast tree by tree structure coding
本算法利用树型结构的编码来表示组播树的染色体。 |
| 4. | Thus multicasting is mostly researched and utilized at present . multicast routing algorithms are used to compute multicast trees that satisfy quality of service requirement
组播路由算法主要用来建立一棵性能良好的组播树，并使它能够满足各种业务的服务质量需求。 |
| 5. | Through analyzing the original topology of video multicast tree , we propose a novel self - organized agent protocol ( sl - soap ) which based on the shared loss model
本文在研究和分析了视频组播原始拓扑结构特点的基础上,利用共享丢失模型,提出了一个代理动态自组织协议sl - soap 。 |
| 6. | A region of multicast tree degraded to a certain extent , rearrangement must be initiated . the simulations show that the performance of improved multicast tree is steady relatively and is not worsen
实验表明该算法所求得的组播树的性能相对稳定，不会随加入或离开操作增加而性能迅速下降。 |
| 7. | In the design of crossover , we first merge two parent trees to a graph , and then create a multicast tree from the graph . based on the method , the algorithm have a good performance of crossover
在杂交算子的设计上，通过对两个父代个体结合，然后再生成组播树的方法，使算法具有较好的杂交性能。 |
| 8. | If the reasonable multicast tree can be constructed , we can consume least network resources and achieve our task . this paper stepwisily gives a comprehensive study to multicast tree problem on the base of graph theory
本篇论文在现代图论研究的基础上，由简单到复杂，逐步深入，对多播生成树问题尽可能的作出一个整体的，全面的探索和研究。 |
