| 1. | This problem refers to constructing minimum - cost spanning trees constrained by delay , which is known to be np - complete
该问题的目标是创建一棵覆盖源节点和目的节点的代价最小树,且满足端到端时延要求。 |
| 2. | 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约束条件且覆盖所有目的节点的最优组播树。 |
| 3. | 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
组播路由算法的目标是寻找一棵连接源节点和多个目的节点的组播树,同时满足各种服务质量需求。 |
| 4. | Optimization of the network cost can reduce network resources consumed by communication , while optimization of the delay can reduce the delay from source to receivers
优化网络代价将减少通信过程消耗的网络资源，而优化网络时延将减少从源点到目的节点的时间。 |
| 5. | Multicast routing is a network - layer function that constructs paths along which data packets from a source are distributed to reach many , but not all , destinations in a communication network
组播实现了同一信息从源节点传送到网络中多个目的节点(并不一定是所有节点) 。 |
| 6. | Combined with the qos based initial route setup algorithms and destination node leaving algorithms , the qos guarantees for distributed multimedia dynamic group applications could be supported
该算法同初始路由建立算法及目的节点退出算法相结合，可以提供对分布式多媒体动态组应用服务质量保证的支持。 |
| 7. | Multicast routing is a network - layer function that constructs paths along which data packets from a source are distributed to reach many , but not all , destinations in a communication network
多播实现同一信息从源节点传送到网络中多个目的节点(不一定是网络中所有节点) ，是实现多媒体应用的重要传输方式。 |
| 8. | A security enhancement scheme is proposed to encounter the black hole attacks in aodv protocol . this scheme may solve the black hole problem and prevent personating the destination node to some degree . 3
针对移动adhoc网络aodv协议中所存在的黑洞攻击，提出了一种增强安全性的解决方案，该方案能在一定程度上解决黑洞问题并可防止假冒目的节点攻击。 |
| 9. | Abstract : in this paper , with the support of the qos - based initial route setup algorithms , a destination node initiated and qos - based algorithm , which can support the member to join in the group dynamically , is presented
文摘:文中在基于服务质量的动态组多媒体通信初始路由建立算法基础之上，提出了一种由目的节点启动的基于服务质量的支持成员加入动态组的算法。 |
| 10. | Lastly , we select bounded paths satisfying delay variation from them to develop a delay and delay variation constrained multicast tree . we compare the proposed algorithm with some exists algorithm in system running time and success rate
然后,从得到的若干路径中选取满足时延差别约束的源节点到各目的节点的路径,从而得到一棵满足时延和时延差别约束的组播树。 |
