routing algorithm的例句大全

Based on the original routing and forwarding algorithm of the SIENA, this paper designs a classification-based routing and forwarding algorithm.

在SIENA原始路由转发算法基础上设计了一种基于分类的路由转发（Classification-Based Routing and Forwarding，CBRF）算法。

a heuristic genetic algorithm for minimum diameter application layer multicast routing with degree constraints

带度约束的最小直径应用层多播路由问题的启发式遗传算法

A new algorithm ( MDA) for the irrecoverable blockage routing problem is proposed, that is a modification to the weight computation of Dijkstra algorithm. The complexity of the algorithm is O ( n~ 2).

本文设计了一种算法（MDA），对经典的Dijkstra算法中的权值计算进行了修正，证明了算法的复杂性为O（n2），并用该算法对模型进行了求解。

2, Hybrid Multipath Routing ( HMR) algorithm is applicable for backbone of WMNs.

适用于WMNs骨干网络的多路径混合路由算法。

Secondly, aiming at solving the Vehicle Routing Problem with Time Window, the paper formulates a mathematical model with a time penalty function, which is solved by the Genetic Algorithm.

其次，在配送车辆优化调度研究中，本文针对有时间窗的车辆调度问题，建立了含有时间惩罚函数的数学模型，并采用遗传算法进行求解；

Realize Automatic Routing in MD Model by Intelligent Discern Points Algorithm

智能识点法实现MD模型上的自动布线

The route finding function adopts Trie-based Routing Table offered by Intel ￡? and realizes Longest prefix Length match algorithm of 32-bit IP address.

路由查找功能采用Intel提供的TRIE表结构，实现32位IP地址最长前缀匹配算法。

Savings Based Algorithm for Full Truckload Vehicle Routing Problem with Time Window

用节约法解决带有时间窗的满载车辆调度问题

Then this paper proposes a saving algorithm based on C-K which is about single-warehouse multi-commodity multi-retailer vehicle routing model used by refrigerated trucks.

然后提出了一种基于C-K节约算法的单货栈多商品多零售商冷藏车车辆调度模型并进行实例验证。

Inspired by intelligent grid structure of MAGA ( Multi-Agent genetic algorithm), the present author proposes a Multi-Agent Neighborhood Immune Clone Selection Algorithm basing on Multicast Routing ( MNICSA) in this dissertation.

借鉴多智能体遗传算法（MAGA）中智能网格结构，提出了基于邻域免疫克隆选择的多智能体组播路由算法（MNICSA）。

Through formula extrapolation this algorithm gives the optimum grid size to save energy. GEER uses a cost function of both distance and residual energy as a routing metric to elect the best route.

该算法首先通过公式推导给出了能效较优的网格边长大小的设定公式，引入了一个有关距离和剩余能量的代价函数，以该函数值作为路由选择参数来进行最优路径的选择。

optimal multicast routing model and its algorithm based on the quantum genetic annealing strategy

基于量子遗传退火策略的多播路由优化模型及其算法

A Dynamic IP Routing Lookup Algorithm Based on Limited Prefix Expansion and Multiple Hash Function Techniques

基于有限前缀扩展和多Hash函数的动态IP路由查找算法

AN ALGORITHM OF LOSS AND PROFIT ANALYSIS OF TRACKS FOR CHANNEL ROUTING Preliminary Discussion on Treatment and Cure of Hidden Danger about Fire Control Passage of Tank Area

通道区布线的通道损益分析法浅谈罐区消防通道的隐患治理

restorable routing strategy and algorithm in ip over wdm networks

网络中可恢复的路由选择策略与算法

application of minimum-cost flow algorithm for routing and timeslot selection in sdh network

最小费用流算法在SDH路由时隙配置中的应用

sdh network end to end connection routing and timeslot selection algorithm

SDH网络端到端连接路由和时隙选择算法

And make performance simulation comparison between improved ZBR algorithm and the original ZBR algorithm, simulation results show that improved ZBR algorithm effectively reduce the 25% of the network routing control overhead to achieve the desired design requirements.

并对改进后的ZBR算法和原始的ZBR算法进行了性能仿真对比，仿真的结果表明了这种改进后的ZBR算法有效的降低了网络中大约25%的路由控制开销，达到了期望的设计要求。

an improved minimum interference routing ( mir) algorithm was proposed.

在最小干扰路由（MIR）算法基础上，提出一种改进的MIR算法。

the algorithm consists of three parts, which are link failure prediction, local routing repair and traffic statistical algorithm.

该算法由链路失效预测、局部路由修复和流量统计算法三部分组成。