routing path的例句大全

efe presented a shortest path routing algorithm in the crossed cube, which has a time complexity of o ( n2).

Efe提出了时间复杂度为O（n2）的交叉立方体最短路径路由算法。

chang et al ′ s algorithm that extends efe uses more candidate links at each routing step for the shortest path routing from source node to destination node.

Chang等人扩展了Efe的算法，时间复杂度为O（n），它在路由的每一步有更多条边作为最短路径可供寻路选择。

in this dissertation, a multiple next hop routing algorithm is first proposed, which improves single path routing algorithm.

首先，本文提出一种多选跳路由算法（MNH），这是一个改进的单径路由算法。

New integer linear program ( ILP) formulations are proposed for routing and wavelength assignment of wavelength path ( WP) and virtual wavelength path ( VWP) Routing scheme, the objective function is to minimize the required number of wavelengths.

提出了一种新的整数线性规划（ILP）公式，用于解决波长通道（WP）和虚波长通道（VWP）的路由选择和波长分配问题，它的优化目标是最小化网络需求。

current ip routing algorithms, such as distance vector ( dv) and link state ( ls), are based on the thought of local optimization: every router tries its best to transfer the packets in the shortest path.

目前使用的两种IP路由算法&距离矢量和链路状态，都基于局域最优思想：每个路由器为其转发的包选择某种距离测度下的最短路径尽力发送。

other protocols based on exchanging of shortest-path trees, e.g., topology dissemination based on reverse path forwarding ( tbrpf), source tree adaptive routing ( star), can also be classified into this category.

基于逆向路径转发的拓扑传播（TBRPF）协议、源树自适应路由（STAR）协议等基于最短路径树交换的路由协议本质上也可归于这一类。

a variable length coding genetic algorithm to ship pipe path routing optimization in 3d space

船舶管路三维布局优化的变长度编码遗传算法

based on genetic algorithm, a variable length coding technique and genetic operators suitable for ship pipe path routing planning is presented.

基于遗传算法提出一种适合船舶管路布局特点的变长度编码技术和相应的遗传算子。

this retrieval mode is fleet and exact about routing selection, and register the path from user to the knowledge source at the time of communication, then back the knowledge to user by original route.

这种检索方式，路由的选择快速准确，并在通信过程中记录了用户到知识源的路径，在知识返回时根据这条路径原路反馈给用户。

Visual Ant using location information of nodes providing by GPS to calculate the deflection angle of next path, then use deflection angle get the path deflection value, then use deterministic routing formula and path deflection value to find a viable path.

可视蚂蚁利用GPS提供的临近节点的位置信息，计算下一步路径的偏向角，进而得到路径趋向值，使用确定性选路公式，在路径趋向度值的引导作用下，迅速找到可行路径。

The border gateway protocol ( BGP ) is a policy-based, event-driven path vector routing protocol.

边界网关协议 ( BGP ) 是一种基于策略的 、 事件驱动的路径向量协议.

For a given graph G of order n, a routing R is a set of n ( n-1) elementary paths such that every ordered pair of vertices in G are connected by a path in the set.

对于给定的n阶连通图G，一个路由选择R是指G中的n（n-1）条路集，其中每个有序点对都有路集中的一条路连接。

Another important routing protocol type is path-vector routing protocol, such as the Border Gateway Protocol ( BGP ).

网络中另一大类路由协议是路径向量路由协议, 如边界网关协议 ( BGP ).

Usually, it encounters dynamic group membership in practical multicast applications. Adopting the idea of Greedy algorithm, this thesis presents a delay constraint dynamic multicast routing algorithm DDMP, based on k-shortest paths, finds a path for the node which apply for join in the tree.

最后，由于在实际组播应用中，通常面临着组播成员的动态变化的问题，论文借鉴了贪婪算法的思想，提出一个基于K条最短路径算法的时延约束动态组播路由算法DDMP。

Multi-constrained path ( MCP ) selection is one of the great challenges that QoS routing ( QoSR ) faces .

多约束路径 ( multi -constrained path,简称MCP ) 选择问题是QoS路由问题面临的重要挑战之一.

Through modified routing rules, the path of the ants is as limited as possible in the quality edge, in an attempt to reduce the solution space of the algorithm.

使用修改的选路规则，将蚂蚁的路径尽可能限制在优质边中，以试图降低算法的解空间。

So the QoS routing problem can be attributed to the construction of path or tree which satisfies the end-to-end QoS constraints at the same time optimizes some special cost function.

因此QoS路由问题可以归结为寻找路径或树在满足约束条件的同时，优化某种特定的代价函数。

Dependable data transmission in ad hoc networks using multi-path routing

基于多路径路由的移动自组网可靠数据传输

Shortest Path Algorithm with Real Time Traffic Information in Dynamic Vehicle Routing Problem

动态车辆路径问题中的实时最短路径算法研究