In the research of fault tolerant parallel computer systems, adaptive routing algorithm is a very important subject.
在研究并行计算机系统的容错时，自适应路由算法是一个极为重要的研究课题。
To meet global storage system's requirement for high performance, high reliability routing, the adaptive routing algorithm are discussed in the thesis.
针对广域存储系统对于高效、高可靠路由的要求，论文对大规模对等网环境下带宽自适应路由机制进行了研究。
An adaptive routing algorithm called Local Address Information (LAI), which is suitable for the distributed optimal double loop local networks, is presented.
本文提出了一种适用于分布式最佳双环局部网络的路由算法，文中称之为局部地址信息（LAI）算法。该算法具有分布适应式特点；
Through analysis and comparison, a new adaptive dynamic minimum hop routing algorithm (ADMH) is proposed.
通过对已有算法的分析和比较，提出了一种自适应最小跳数路由算法(admh)。
This paper proposed an improved routing update algorithm - a dynamically self-adaptive routing update algorithm based on clustering mechanism.
提出了一种改进的路由更新算法—基于分簇机制的动态自适应路由更新算法。
Based on the study of LEACH, in this paper, we propose a new clustering routing algorithm-Radius Adaptive clustering Multi-hop routing algorithm (RACMH).
基于对LEACH协议的研究，本文提出了一种新的成簇路由算法——半径自适应成簇多跳路由算法(RACMH)。
On the basis of the above research, a self-adaptive clustering routing algorithm sensitive to position is proposed.
在上述研究的基础上，提出了一种对位置敏感的自适应分簇路由算法。
On the basis of the above research, a self-adaptive clustering routing algorithm sensitive to position is proposed.
在上述研究的基础上，提出了一种对位置敏感的自适应分簇路由算法。
应用推荐