This paper proposed a novel group multicast routing algorithms, it is more concise and more optimal than the old method.
本文提出一种新的成组广播路由算法，它比传统的成组广播路由算法在性能上有了一定的提高，同时更为简洁。
Based on the above work, our research on overlay multicast is performed in the following aspects, which include centralized routing algorithms, distributed routing protocols and system prototype.
在此基础上，我们分别从覆盖多播的集中式路由算法、分布式路由协议和原型系统等几方面开展了研究工作。
The proposed algorithms use path-based multicast routing models, other than by finding Hamiltonian or Eulerian path in the network.
所提出的算法用基于路径的组播路由模型，而不是在网络中找出哈密尔顿路径或欧拉路径。
Propose four delay-constrained multicast source routing algorithms to solve delay-constrained least-cost multicast routing problem.
针对时延约束的最小代价组播路由问题，提出四种时延约束组播源路由算法。
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.
仿真实验表明，用该算法产生的多播路由树的费用比已存在的主要算法更好，并且适应于多播成员数的变化。
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.
仿真实验表明，用该算法产生的多播路由树的费用比已存在的主要算法更好，并且适应于多播成员数的变化。
应用推荐