基于簇的渐近式路由选择算法

路由选择逄法是用于决定计算机网络每个结点输入的信息包应当从哪一个输出线路发送出去以便使得某种指定的费用最小。提出了一种新的有效路由算法，以使路径总延迟最小，该算法采用了分簇及渐近式路由方案，从而获得近似最优解。采用簇划分的方法可以减少网络路由算法由算法的运算规模，实现逐步求解，与其他已知类似算法相比较，该算法具有较小的时间复杂性。

Cluster-based gradual routing algorithm

The routing algorithms are employed in determining the proper routes along which the information packets input at a node of a computer network are transmitted so that the specified costs are minimum. A new routing algorithm is presented, by which the routes with the minimum total delays can be found out. In order to get an efficient and optimal solution, the clustering method and gradual routing scheme are used. The clustering process decreases the routing sizes of the networks, with which a solution with the minimal total delay can obtained gradually. Simulation results and analysis show that the presented algorithm requires less time complexity or better performance than those available.