Through OPNET simulation, show that the dynamic routing algorithm has a smaller interstellar delay, to meet the LEO satellite mobile communication systems.
通过在OPNET中仿真验证，该动态星际路由算法具有较小的用户通话时延，能够满足低轨移动通信系统的需求。
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.
通过分析几种典型的星际路由算法，考虑系统的动态因素，为系统设计了一种基于最小用户延时的动态星际路由算法。
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.
OSPF协议是一种动态路由协议，它利用内部的链路状态数据库来维护和计算路由，它的路由算法是本协议的关键部分。
A new dynamic routing and wavelength assignment algorithm is proposed and the time complexity of the algorithm is analyzed.
提出了一种新的动态路由和波长分配算法，对算法的时间复杂度进行了分析。
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.
为了解决WDM网络中多优先级动态业务的路由选择与波长分配问题，提出了一种基于分层图模型的动态RAW算法。
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.
探讨了如何在长途电话交换网中应用单纯形算法解决动态路由问题，并介绍了算法运行情况和运行结果。
As dynamic changes of topology, position-based routing algorithm and security routing are focuses and key points in this field.
由于拓扑结构的动态变化，位置路由算法和安全路由是其研究的热点和重点。
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.
仿真表明，该算法可以动态调整网络路由路径，使所选路径的平均分组时延与分组能量消耗乘积达到最小。
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.
仿真表明，该算法可以动态调整网络路由路径，从而使所选路径的能量消耗达到最小。
Through analysis and comparison, a new adaptive dynamic minimum hop routing algorithm (ADMH) is proposed.
通过对已有算法的分析和比较，提出了一种自适应最小跳数路由算法(admh)。
In IRP algorithm, routing is based on component from Server, which is simple and practical, but cannot adapt dynamic change in distributed system environment.
IRP算法仅根据服务器提供的路径构件进行寻径，简单实用，但难以适应分布系统环境的动态变化。
According to multicasting dynamic routing assignment problem in WDM optical network, provided a routing assignment algorithm based on multiple constraints.
针对WD M光网络多播动态路由分配问题，提出了一种多约束条件下的路由分配算法。
According to multicasting dynamic routing assignment problem in WDM optical network, provided a routing assignment algorithm based on multiple constraints.
针对WD M光网络多播动态路由分配问题，提出了一种多约束条件下的路由分配算法。
应用推荐