- 更多网络例句与最短路由相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Open Shortest Path First is a routing protocol developed for Internet Protocol networks by the Interior Gateway Protocol working group of the Internet Engineering Task Force. The working group was formed in 1988 to design an IGP based on the Shortest Path First algorithm for use in the Internet.
最短路径优先是Internet 任务工程组的一个工作组为IP网络开发的一个内部网关路由选择协议，该工作小组成立于1988年并致力于为INTERNET应用设计一个基于最短路径优先算法的内部网关路由协议。
-
In the beginning of the 90s, it was realized in a nonscientific way, which was based on the router configure——assigning the traffic streaming simply onto the shortest path by IGP.
这种映射的实现只是基于产品的路由配置——业务流简单地被分配到内部网关协议IGP计算出的最短路径上。
-
SSPP firstly computes a minimum hop primary path for each connection request, and it follows to compute two SRLG disjoint and minimum cost backup paths for each sub-path on the primary path.
共享子通路保护为每条业务请求计算一条最短的工作路由，并为工作路由上每段子通路各计算两条共享风险链路组分离且代价最小的保护路由。
-
With functions of automatic route recalculation and detours, you can choose fastest or shortest route, bicycle or walking route, or limited speed routing to avoid freeways.
随着自动重新计算路线和迂回曲折的功能，你可以选择最快或最短的路线，自行车或步行的路线，或有限的高速路由，以避免高速公路。
-
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 OSPF
路由表由智能发现协议，如路由信息协议或者开放最短路径优先协议，不断地被建立和再建立。
-
First, based on its topology and the routing algorithm on square mesh,proposed a minimum-path unicast routing algorithm by two virtual networks.And proved to be deadlock-free.
基于蜂窝网络的砖形画法，利用二维网络维序路由的基本思想和两个虚拟网络实现了无死锁的最短单播路由算法，并证明了算法的无死锁性。
-
In ad-hoc mobile networks some links may be unidirectional due to the hidden terminal problem. Traditional protocols are not well suited for the mobile environment due to the considerable overhead produced by periodic route update messages and their slow convergence to topological changes. In this p...
文中提出了一种支持单向 ad- hoc移动网络的路由协议 U AOR，它采用按需方式查找路由，并根据主机之间的邻接关系和距离矢量来选择相对最稳定且最短的路由，具有路由更新开销小，快速适应网络拓扑结构改变等特点。
-
Route can't select path when there is overfull flux on the net, so it is important to settle the question that route selects path based on flux.
0 引言传统的路由选择算法是建立在已知整个网络拓扑和各链路长度的基础上，通过求给定网络中两个节点之间的最短通路得出所选择的最佳路由[1]。
-
A host obtains other hosts location information that piggybacked by received route request packets.
针对路由路径中可能存在非最短路由，利用位置信息对获得的路由进行路径优化。
- 更多网络解释与最短路由相关的网络解释 [注：此内容来源于网络，仅供参考]
-
ascend：上升
内部节点代表交换机. 胖树中的路由交换是相对简单的,因为两个处理节点间只会有一个最短路径. 路径包括上升(ascend)和下降(descend)阶段. 上升阶段直到找到最低的公共祖先. 下降阶段找到目的节点.
-
descend：下降
叶节点代表处理器,内部节点代表交换机. 胖树中的路由交换是相对简单的,因为两个处理节点间只会有一个最短路径. 路径包括上升(ascend)和下降(descend)阶段. 上升阶段直到找到最低的公共祖先. 下降阶段找到目的节点.
-
shortest path algorithm：最短路径算法
因为节点无需重复执行 路由算法 提供链路费用的最新信息 298 数据通信与网络教程 下载 7.2.3 Dijkstra算法 D i j k s t r a算法 ,有时也称为 最短路径算法 (Shortest Path Algorithm )或 正向搜索算法 (Forward Search Algorithm) ,
-
shortest route：最短路径
路由选择:Selection of Route | 最短路径:Shortest route | 路由跟踪:Route Trace