1·A novel algorithm based on Tabu Search for Delay-Constrained Least-Cost Routing (TSBDRA) is proposed to solve delay-constrained least-cost unicast routing problem.
针对具有时延约束最小代价路径问题，提出一种基于禁忌搜索方法的时延约束的最小代价单播路由算法（TSBDRA）。
2·Based on the conception of LIP and RSC, this paper proposed an efficient unicast fault-tolerant routing algorithm for hypercube networks.
基于LIP和RSC的概念，提出了一个有效的超立方体网络单播容错路由算法。
3·Limits the number of unicast players that can be simultaneously connected to the server. The default value is unlimited.
限制可以同时连接到服务器的单播播放机的数量。默认值是无限制。
4·And then based on IPV6 Aggregatable Global Unicast Address, routing algorithm for IPV6 was represented.
并针对IPV 6可聚类的全局单播地址，提出面向IPV6的路由查找算法。
5·Specifies the number of unicast players that can be simultaneously connected to this publishing point.
指定可同时连接到该发布点的单播播放机的数量。