The OSPF protocol is a dynamic routing protocol, which uses of the link state database to maintain and calculate routings. Its routing algorithm is the most important part.
OSPF协议是一种动态路由协议，它利用内部的链路状态数据库来维护和计算路由，它的路由算法是本协议的关键部分。
Consider the too much redundant data and the non-balanced energy consumption of the routing protocol based on the minimum cost, proposed a new algorithm — MHEP routing algorithm.
针对基于最小代价的路由算法冗余信息过多和能耗不均衡问题，提出了一种新的路由算法——MHEP算法。
The premise and key of the research of layered routing protocol is an excellent clustering algorithm.
一个良好的分簇算法是进行分层路由协议研究的关键和前提。
Inside the routing style algorithm, we combined the algorithm of logic topology and direct topology. It reduces some complexity to deal with routing protocol.
在路由式拓扑发现算法中，将路由器间逻辑连接算法与直接连接算法结合，避免了以往通过复杂的路由选择协议来计算拓扑的繁琐处理。
Existing routing protocol implementations are monolithic, bundling together a database with an optimal path calculation algorithm and a network state distribution mechanism.
现有路由协议的实现是单一的，并且将数据库、最优路径计算和网络状态分发机制捆绑在一起。
This new protocol rebuilt the AODV routing acquisition and maintenance based on the ant foraging algorithm, and using ant task allocation algorithm to decrease the maintenance overhead.
我们以基本的蚂蚁觅食算法为基础，改造了AODV寻路方法和维护策略，应用蚂蚁分工的算法减少维护的费用。
This new protocol rebuilt the AODV routing acquisition and maintenance based on the ant foraging algorithm, and using ant task allocation algorithm to decrease the maintenance overhead.
我们以基本的蚂蚁觅食算法为基础，改造了AODV寻路方法和维护策略，应用蚂蚁分工的算法减少维护的费用。
应用推荐