1) MRAI
路由更新最小间隔
1.
In this paper, several primary algorithms that improve BGP convergence time are discussedon their advantages and disadvantages, coming to a conclusion that it is necessary to usedifferent MRAI (minimal route advertisement interval) during diffe.
本文首先介绍了目前主要的提高BGP收敛速度的算法，指出现有算法的缺点，并提出使用每对等体每目的网络一个MRAI(Minimal Route Advertisement Interval)路由更新最小间隔的必要性。
2) routing update
路由更新
1.
The whole routing process is separated in two phases: routing setup and routing update.
文中在介绍WSN的特点后,将着重讨论其路由过程并把整个过程分为路由建立和路由更新两个阶段,通过对当前应用较多的路由协议分析,对每个阶段进行阐述;文章最后对WSN路由协议未来的研究策略与发展趋势提出了一些具体研究意见。
2.
Recent routing algorithms based on clustering mechanism in Ad hoc networks mostly adopt the hybrid routing strategy,whose routing update process only performs in local network(or in cluster).
提出了一种改进的路由更新算法—基于分簇机制的动态自适应路由更新算法。
3.
The paper also discusses the problem of routing update of TCAM.
对TCAM的路由更新问题进行了讨论,提出一个最坏情况下O(W 2)的更新算法(W为前缀长度集合的数目),有效地提高了TCAM的更新性能。
3) rekeying interval
更新间隔
4) IP route update
IP路由更新
6) Minimal routing
最小路由
1.
Based on the existence of Manhattan routes in presence of rectilinear-monotone polygonal fault blocks in 2-D mesh,minimal routing and heuristic routing schemes are proposed.
本文就基于线性单调多边形模型的二维mesh中是否存在曼哈顿路径,分别给出了最小路由和启发式路由两种解决方案,最终的实验结果表明,对于给定的错误率的不同规模的二维mesh网络,在随机产生错误结点时,两者的平均路径长度与曼哈顿路径长度偏离很小。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条