Existing routing protocol implementations are monolithic, bundling together a database with an optimal path calculation algorithm and a network state distribution mechanism.
现有路由协议的实现是单一的，并且将数据库、最优路径计算和网络状态分发机制捆绑在一起。
At the same time, neighborhood search methods and the Calculation of Path difference designed to speed up algorithm speed.
同时设计了邻域搜索办法和路径差的计算办法，加快了算法的运行速度。
The data transfer path from the calculation of this algorithm is the shortest deadlock-free transfer path.
根据该算法得出的数据传输路径是无死锁的最短传输路径。
应用推荐