They are characterized by the global maintenance, precise routing, shortest path routing.
它们的特点是全局维护，精确路由指向，最短路径路由。
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)时各种不同的负载平衡情形。
In this paper, all the relay routers are taken as a virtual node by assigning them an anycast address which is accessed along the shortest path by anycast routing.
为所有中继路由器分配一个泛播地址，将它们当作一个逻辑节点，借助泛播路由以最短路径到达该逻辑节点。
Other IP Multicast protocols rely on certain routing protocols, such as routing Information protocol or Open Shortest Path First.
其他的ip多播协议都依靠某些路由协议，如路由信息协议或开放式最短路径先行协议等。
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)协议。
OSPF (open shortest path first) is a widely used dynamic routing protocol in IP networks.
开放式最短路径优先(OSPF)协议是一个广泛使用的动态路由协议。
It takes advantage of the routing protocol based on minimum hop, in which every node does only local routing maintenance, and data is transmitted along the shortest path.
系统实现了对监控目标的烟雾浓度，温度的实时监测，采用了基于最小跳数的路由协议，每个节点只需记忆自己的转发节点集，网络中的数据都是沿着最短路径进行传输。
Like TRILL, shortest path bridging is designed to address this problem by applying the Layer 3 routing protocol to Layer 2 devices.
像颤音，最短路径连接的目的是解决这个问题通过应用第三层路由协议第2层设备。
As many routing protocols for wireless sensor network can't handle dynamic topological variation efficiently, a new hierarchical routing protocol (TVHRP) based on the shortest path is proposed.
针对多数无线传感器网络路由协议不能高效应对网络拓扑结构动态变化的问题，本文提出了一种基于最短路径的层次路由协议TVHRP。
First, I begin with the problem the shortest path problem which is one classic problem in the routing part.
首先提出最短路径方法及应用，主要分两方面进行展开：点到点最短一条路径和点到点最短多条路径。
The prototype of the routing guidance is the shortest path in graph theory problems.
路径诱导的原型是图论中的最短路径问题。
A genetic algorithmic approach to the shortest path (SP) routing problem in large network was presented in order to improve the efficiency of computation.
为提高求解大型网络最短路问题(SP)的效率，采用遗传算法求解。
The results indicate that "the longest covered-time" routing algorithm can improve the system performance compared with "the shortest path" one.
结果表明：“最长覆盖时间”算法与“最短路径”算法相比，能更有效地改善系统的性能。
Biologists had studied the Phenomenon carefully and found that ants cooperate to find the shortest routing path by means of indirect communications using a kind of substance call "pheromone".
生物学家经过仔细研究发现蚂蚁之间通过一种称之为“外激素”的物质进行间接通讯、相互协作来发现最短路径。
Biologists had studied the Phenomenon carefully and found that ants cooperate to find the shortest routing path by means of indirect communications using a kind of substance call "pheromone".
生物学家经过仔细研究发现蚂蚁之间通过一种称之为“外激素”的物质进行间接通讯、相互协作来发现最短路径。
应用推荐