您要查找的是不是：
- A Novel Shortest Path Routing Algorithm in the Crossed Cube 一种新的交叉立方体最短路径路由算法
- shortest path routing 最短路由选择
- The list of predecessors eventually defines the shortest path from each routing group to the destination routing group. 前置路由组列表最终定义了从每个路由组到目标路由组的最短路径。
- Routing tables are continuously built and rebuilt by intelligent discovery protocols, such as Routing Information Protocol or Open Shortest Path First. 路由表由智能发现协议，如路由信息协议或者开放最短路径优先协议，不断地被建立和再建立。
- Shortest Path Transit Network Settings. 最短路径公交网络对话框。
- Other IP Multicast protocols rely on certain routing protocols,such as Routing Information Protocol or Open Shortest Path First. 其他的IP多播协议都依靠某些路由协议，如路由信息协议或开放式最短路径先行协议等。
- Routing tables are continuously built and rebuilt by intelligent discovery protocols,such as Routing Information Protocol or Open Shortest Path First. 路由表由智能发现协议，如路由信息协议或者开放最短路径优先协议，不断地被建立和再建立。
- The first set includes all groups for which the shortest path from the source routing group has already been determined. 第一个集合包含到源路由组的最短路径已被确定的所有组。
- As explained earlier, the routing engine caches the message type information that refers to the shortest path a message can take to its destination. 前面已指出,路由引擎缓存邮件类型信息,该信息指示邮件可用来到达目标的最短路径。
- Other IP Multicast protocols rely on certain routing protocols, such as Routing Information Protocol or Open Shortest Path First. 其他的ip多播协议都依靠某些路由协议，如路由信息协议或开放式最短路径先行协议等。
- Use a short path name if you can. 如果可以,请使用短路径名称。
- For example, when using a routing protocol like Open Shortest Path First(OSPF), an upgrade or topology change on the internetwork causes a shortest path first(SPF) calculation. 例如，使用一个像开放最短路径优先（OSPF）这样的路由协议时，网络中的一个升级或拓扑改变会引起最短路径路径优先（SPF）计算。
- However,shortcut is the shortest path but not will be the fastest. 然而，快捷方式虽然是最短的路，却未必是最快的。
- The next page will discuss the shortest path algorithm. 下一页将讨论最短路径演算法。
- In this dissertation, a Multiple Next Hop routing algorithm is first proposed, which improves single path routing algorithm. 首先，本文提出一种多选跳路由算法(MNH)，这是一个改进的单径路由算法。
- We give the ants routing formula which based on dynamic load balancing and short path on the assuption that some conditions hold. 利用蚁群选路的天然特性，在作了适当的假设后，我们推导出了基于动态负载平衡的蚂蚁选路概率表达式，一方面使所选路由尽量短，另一方面尽量保持负载分布的平衡性。
- Make sure that the path name is in a short path (DOS 8.3) format. 确保路径名称为短路径(DOS 8.;3)格式。
- This name may not initially appear to be a short path name. 此名称初看起来不像是短路径名称。
- The tools can be stochastic choose through shortest path from bidirectional. 双向随机最短路径选刀。
- The paper introduces Ad hoc network. The single path routing algorithm and the mult ipath algorithm are analyzed and compared. According to the on demand idea, inde pendent multipath algorithm based on DSR is proposed for Ad hoc networks. 目前Ad hoc网络正成为网络发展的热点，该文介绍Ad hoc网络，分析比较了单 路径和多路径算法，就多路径算法加以分析，同时借鉴按需路由的思想，在DSR协议的基础 上提出了Ad hoc网络的一种按需的独立多路径算法。
