dynamic adj. 1.动力的,动力学的;力学(上)的;动(态)的;起动的。 2.有力的,有生气的;能动的;(工作)效率高的。 3.【音乐】力度;强弱法的。 4.【医学】机能(上)的。 5.【哲学】动力论的,力本论的。 a dynamic personality 活跃的性格。 a dynamic atmosphere 生气勃勃的景象。 a dynamic population 动态人口。 n. 〔限指 dynamic〕 (原)动力;动态。 adv. -ally
Bgp routers do not send regularly scheduled routing update . being a complicated dynamic routing protocol , bgp ' s performance is the critical problem under the situation of keeping many peer relations and big routing table 作为一个复杂的分布式动态路由协议,如何使实现的bgp系统在保持多连接并维持大量路由信息的情况下高效运转是本文的研究重点。
Third , if possible , it is a key technology how to build such an experimental platform to provide an environment in which the access management of mobile users and the dynamic routing are archieved . this is the task of this paper 而如何构建一个这样的实验网平台,为实现移动用户的接入管理,以及动态路由提供一个模拟的工作环境,是该课题的一个关键技术。
At the same time because the super - speed radio station may hold in moving state when it ' s working , the radio station should dynamically select the path for the data transmitting , it indicates that the radio station should have dynamic routing function 同时由于在作战时电台处于移动状态,所以数据传输时还应该可以动态的选择传送路径,即要求组成网络的高速电台都具有动态路由的功能。
Routing and wavelength assignment ( rwa ) algorithm is the key problem of mplms control layer . a dynamic routing and wavelength assignment ( rwa ) algorithm with the design pr otection is proposed , with load balance and capacity constraint of physical links taken into account 路由和波长分配( rwa )是mplms控制层面的一个重要问题,本文基于考虑链路负载均衡和容量限制提出了一种具有保护设计的动态路由和波长分配算法。
The ospf protocol was developed by the ospf working group of the internet engineering task force . it is a dynamic routing protocol based on link - state . ospf is classified as an interior gateway protocol ( igp ) , it only processes the routing information in an autonomous system Ospf是ietf ( internetengineeringtaskforce )于1988年提出的一种基于链路状态算法的动态路由协议,它是用于自治系统内部的内部网关路由协议。
Generally speaking , the difference between control and management can be measured . the difference between cross - connection and switching is measured by circuit granularity . likely , the difference between protection conversion of the bottom layer and dynamic routing of the ip layer can be measured 通常控制和管理的区别是有度的,例如交叉连接与交换的区别是用电路颗粒和反应时间来区别的,同样底层的保护倒换和ip层的动态选路之间的差别也有度。
The extended max - rwa problem is formulated as two integer linear programming ( ilp ) from the different viewpoint , and then solved using genetic algorithm and tabu - search algorithm respectively . a dynamic routing and wavelength assignment algorithm ( lcwa ) for limited - range wavelength conversions is proposed 从不同角度出发,给出了max - rwa问题的两个整数线性规划模型,随后分别使用遗传算法和禁忌搜索算法求解了波长转换范围受限条件下的静态max - rwa问题。
The development of the dynamic route guidance systems is introduced in the world firstly , then based on the prevailing condition in chongqing , the architecture of drgs is designed and the functions of each module are explained , the function includes ( 1 ) the positioning method . ( 2 ) how to obtain the real - time traffic information . ( 3 ) the data communication method 本文首先介绍了国内外动态路径诱导系统的发展情况,在对重庆市现有交通状况进行调研的情况下设计了相适应的动态路径诱导系统,并根据重庆市的实际情况,确定了系统的基本结构信息,包括车辆定位方法、实时交通信息的获取方式、数据通信方式、采取何种诱导系统、在哪进行交通信息预测等。
In this thesis , firstly , the basic conceptions and existing algorithms for rwa problem are introduced ; secondly , a research is made on a dynamic routing and wavelength assignment algorithm in wron considering wavelength relation in order to reduce the resources in networks , the blocking probability and the cost of wavelength assignment 本论文首先介绍了rwa问题的相关概念及常见算法;接着对动态业务条件下具有波长变换能力节点的波长分配算法进行深入研究。基于节约网络资源和降低网络的阻塞率和波长分配代价的思想,在wron网络的动态路由波长分配算法中考虑波长相关性。
To analyze the factors of impacting load balancing of links , which is including the number of routes between source node and destination node , the number of routes through every link , the maximum flow between source node and destination node , the maximum flow through every link , the free bandwidth of every link and so on , we present the fast dynamic routing algorithm ( fdra ) and the critical link routing algorithm ( clra ) . simulation results show presented algorithms in the paper are better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure , especially in computing time cost 通过分析影响网络的链路负载均衡的因素,比如源-目的节点间的最大流,通过每条链路的最大流,源-目的节点间的路径数目,通过每条链路的路径数目,以及链路的剩余容量等,提出了快捷动态路由算法fdra和关键性链路路由算法clra ,通过仿真,与最小跳算法( mha ) 、最宽最短路径( wsp )算法、最小干扰路由算法( mira )相比较,提出的两种算法在业务阻塞率、资源利用率以及重路由性能方面都有很好的效果。