OSPF (open shortest path first) is a widely used dynamic routing protocol in IP networks.
开放式最短路径优先(OSPF)协议是一个广泛使用的动态路由协议。
The OSPF (open shortest path first) refresh mechanism can cause periodic bursts of traffic on networks.
协议的报文刷新机制会产生大量的报文，给网络带来很大的突发流量。
Other IP Multicast protocols rely on certain routing protocols, such as routing Information protocol or Open Shortest Path First.
其他的ip多播协议都依靠某些路由协议，如路由信息协议或开放式最短路径先行协议等。
Working with a small test network, we wanted to demonstrate various load-balancing scenarios with Routing Information Protocol (RIP) and Open Shortest Path First (OSPF).
在一个小型的测试环境下，我们想演示在使用路由信息协议(rip)和开放式最短路径优先协议(OSPF)时各种不同的负载平衡情形。
Generalized Multi-Protocol Label Switching (GMPLS) is used as the control protocol for ASON, of which the routing part is mainly governed by the Open Shortest Path First (OSPF) protocol.
自动交换光网络(ason)控制协议采用通用多协议标签交换(GMPLS)控制协议族，其路由部分主要为开放式最短路径优先(OSPF)协议。
The first particle she queries will most likely have traveled the shortest possible path through the maze.
她询问的第一个粒子走过的路径最有可能是穿过迷宫的所有可能路径中最短的一条。
To measure how far the wombat is from the leaf, let's first find the shortest path (least squares) that the wombat has to move to reach the leaf.
为了测量袋熊离树叶有多远，让我们首先找到袋熊移动够到树叶的最短路线(最少的方格数)。
First, I begin with the problem the shortest path problem which is one classic problem in the routing part.
首先提出最短路径方法及应用，主要分两方面进行展开：点到点最短一条路径和点到点最短多条路径。
The shortest path problem in complex networks and graphs can be easily solved by labeling the distance between current point and start point during depth- first- search.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
The first one is community model based on shortest path, the second one is based on least cost by introducing a turn penalty, the last one is community model based on probability and turn penalty.
第一种是社区最短路径模型，第二种是社区最小代价模型，第三种是引入概率的最小代价模型。
The method first calculates the link weights based on a given criterion. Then a modified Open-Shortest-Path-First (OSPF) algorithm is proposed to calculate the paths.
该方法首先根据特定准则计算各连接的权值，然后根据一种改进的最短路径选择策略确定路径。
The method first calculates the link weights based on a given criterion. Then a modified Open-Shortest-Path-First (OSPF) algorithm is proposed to calculate the paths.
该方法首先根据特定准则计算各连接的权值，然后根据一种改进的最短路径选择策略确定路径。
应用推荐