本文就路由选择算法中的默认路由(含静态路由)和两种简单的动态路由算法作一简单分析。
In this article, the author analyses on the static state algorithm (including default route algorithm) and the basic dynamic route algorithm in the network layer.
证明了关于查询等价和有限步数引理，讨论了不同条件下信息检索算法的复杂度，并在试验中验证了信息动态路由算法的可行性和高效率。
The lemma of query equivalent and lemma of limited steps was proved and the complexity of information query algorithm in different conditions was discussed.
论文讨论了基于备份路由实现主动网动态资源预留的再协商及其相关算法。
This paper discusses the re-consultation of dynamics resources reservation based on backup router table in active network, and describes the algorithm.
仿真结果表明，ACS算法可兼顾路由长度和网络负载两方面因素，其选路效果优于传统动态分布式算法。
The simulation results show that the length of routes and links' load can be taken into account by ACS and the algorithm is superior to some traditional algorithms.
通过在OPNET中仿真验证，该动态星际路由算法具有较小的用户通话时延，能够满足低轨移动通信系统的需求。
Through OPNET simulation, show that the dynamic routing algorithm has a smaller interstellar delay, to meet the LEO satellite mobile communication systems.
提出一种改进的波长分配算法，用于波长路由光网络中快速动态分布式光链路的建立。
In this paper, a novel revised fast distributed dynamic wavelength assignment algorithm for optical path setup has been presented.
为了改善组播树的性能，本章提出了基于免疫克隆选择的重构动态组播路由算法。
To improve the performance of multicast tree, a rearrangement dynamical multicast routing based on Clone Selection is proposed.
本文介绍及分析了两种基本的动态路由选择算法。
This article introduces and analyses on the two basic dynamic routing algorithms.
提出了一种新的动态路由和波长分配算法，对算法的时间复杂度进行了分析。
A new dynamic routing and wavelength assignment algorithm is proposed and the time complexity of the algorithm is analyzed.
探讨了如何在长途电话交换网中应用单纯形算法解决动态路由问题，并介绍了算法运行情况和运行结果。
This paper discusses how to solve dynamic routing problem with simplex algorithm in a long-distance telecommunication switch network. The computed results are shown in the paper.
OSPF协议是一种动态路由协议，它利用内部的链路状态数据库来维护和计算路由，它的路由算法是本协议的关键部分。
The OSPF protocol is a dynamic routing protocol, which uses of the link state database to maintain and calculate routings. Its routing algorithm is the most important part.
仿真表明，该算法可以动态调整网络路由路径，使所选路径的平均分组时延与分组能量消耗乘积达到最小。
Simulation demonstrated that the algorithm could dynamic adjust the route which can make the product of packet delay and energy consumption of routing path to be minimization in AD hoc networks.
为了解决WDM网络中多优先级动态业务的路由选择与波长分配问题，提出了一种基于分层图模型的动态RAW算法。
In order to solve the problem of routing and wavelength assignment for priority-based dynamic operation in WDM networks, a dynamic RAW algorithm based on layered graph was proposed.
由于拓扑结构的动态变化，位置路由算法和安全路由是其研究的热点和重点。
As dynamic changes of topology, position-based routing algorithm and security routing are focuses and key points in this field.
算法采用按需路由发现过程，动态更新路由信息和建立多播转发组。
The algorithm applies on-demand procedures to dynamically refresh routes and build multicast forwarding group.
针对WD M光网络多播动态路由分配问题，提出了一种多约束条件下的路由分配算法。
According to multicasting dynamic routing assignment problem in WDM optical network, provided a routing assignment algorithm based on multiple constraints.
仿真表明，该算法可以动态调整网络路由路径，从而使所选路径的能量消耗达到最小。
Simulation demonstrated that the algorithm could dynamic adjust the route that can achieve the aim of the minimization of energy consumed of routing path in AD hoc networks.
针对波长路由网络中动态光链路建立问题，提出了一种快速动态波长路由算法(RWA)。
A novel dynamic router and wavelength assignment (RWA) algorithm for the dynamic wavelength router optical network (WRON) was presented here.
提出了一种改进的路由更新算法—基于分簇机制的动态自适应路由更新算法。
This paper proposed an improved routing update algorithm - a dynamically self-adaptive routing update algorithm based on clustering mechanism.
在为移动自组织网络设计的众多路由协议中，动态源路由协议(dsr)以其优异的性能成为目前最流行的自组织网络路由算法之一。
In a great deal of routing protocols designed for Ad hoc, DSR is one of the popular arithmetic, because of it's excellent capability.
贪婪算法是一种动态组播路由算法，该算法获得的通信树时延较大。
Greedy algorithm achieves low cost multicast tree whose delay performance is worse than other trees.
该算法能够使路由器中的队列长度快速零误差地跟踪上参考队列长度，并且在长时延网络环境和动态流量网络环境中均具有快速的响应性能。
It can make the queue length in the router track the reference queue length with non-error, and also has fast response performance both in large delay networks and dynamic traffic networks.
通过分析几种典型的星际路由算法，考虑系统的动态因素，为系统设计了一种基于最小用户延时的动态星际路由算法。
By analyzing several typical interstellar routing algorithms, consider the dynamic factors of the LEO satellite mobile communication system, design a minimum user delay dynamic routing algorithm.
提出并实现了信息检索算法，动态信息路由交换算法DI RA和边界域IRH的路由交换算法；
Three algorithms: Information Query Algorithm, DIRA( Dynamic Information Route Algorithm), IRH Route Exchange Algorithm of the Boundary Area were proposed.
OSPF协议是一种动态路由协议 ，它利用内部的链路状态数据库来维护和计算路由 ，它的路由算法是本协议的关键部分 。
The OSPF protocol is a dynamic routing protocol, which uses of the link state database to maintain and calculate routings.
OSPF协议是一种动态路由协议 ，它利用内部的链路状态数据库来维护和计算路由 ，它的路由算法是本协议的关键部分 。
The OSPF protocol is a dynamic routing protocol, which uses of the link state database to maintain and calculate routings.
应用推荐