| 1. | A delay - constrained multicast routing algorithm based on shared tree
一种时延受限共享组播树算法 |
| 2. | A least redundant packets multicast tree sharing algorithm based on obs networks
网络的一种最少冗余包的组播树共享算法 |
| 3. | In this algorithm , we represent the chromosomes of the multicast tree by tree structure coding
本算法利用树型结构的编码来表示组播树的染色体。 |
| 4. | 3 . to improve the performance of multicast tree , a rearrangement dynamical multicast routing based on clone selection is proposed
3 、为了改善组播树的性能，本章提出了基于免疫克隆选择的重构动态组播路由算法。 |
| 5. | The simulated experiment indicates that stbmr ’ s tree ’ cost is up to 4 % more than kpp , while average running time is 54 % less than it
实验表明, stbmr算法构造的组播树费用比kpp算法构造的约大4 % ,算法执行时间比kpp算法约少54 % 。 |
| 6. | A fundamental issue in multicast communication is how to construct low - cost trees that will satisfy the quality of service ( qos ) requirements and spanning all destinations
组播问题关键是在于建立一棵满足qos约束条件且覆盖所有目的节点的最优组播树。 |
| 7. | The main purpose of multicast routing is to construct a tree rooted at the source and spanning all destinations , while the quality of services ( qos ) be satisfied
组播路由算法的目标是寻找一棵连接源节点和多个目的节点的组播树,同时满足各种服务质量需求。 |
| 8. | Thus multicasting is mostly researched and utilized at present . multicast routing algorithms are used to compute multicast trees that satisfy quality of service requirement
组播路由算法主要用来建立一棵性能良好的组播树，并使它能够满足各种业务的服务质量需求。 |
| 9. | 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
实验表明该算法所求得的组播树的性能相对稳定，不会随加入或离开操作增加而性能迅速下降。 |
| 10. | 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
在杂交算子的设计上，通过对两个父代个体结合，然后再生成组播树的方法，使算法具有较好的杂交性能。 |
