蔓延路由和概率路由能提供较高的报文投递率，较小的投递延迟，但是开销很大。
Epidemic routing and Probabilistic routing can provide higher delivery probability and reducing delays, they cost too much network traffics.
图15.通过较大近缓存或者关联路由，逐渐增加近缓存命中的概率，可以减少平均数据访问时间。
Figure 15. Increasing the probability of a near-cache hit, either through larger near caches or affinity routing, reduces the average data access time.
计算数据表明，采用递减转发概率将使得重路由路径长度的期望值显著降低，因而能保证良好的通信延时。
The calculation result demonstrates that descending forward probability makes the expected value of rerouting path decrease distinctly, therefore limits the communication delay.
在光突发交换网络的核心路由器中，多等级业务会由于选择路由的不同而采用不同的概率选择输出端口进行输出。
In the core router for optical burst switching network, multi-classes traffic wilt use differential probability to choose output port for transmission due to the choosing of different routing.
在此基础上，利用模糊塔，求出两网络节点之间既满足用户服务质量需求又试图最大化网络提供方概率收益的路由。
Based on that model, the specific route between two network nodes was found, satisfying the user QoS requirement and attempting to maximize network provider probability profit by using fuzzy tower.
分析了IGP路由恢复时间对IBGP会话的影响，提出一种新的基于IGP路由恢复时间概率分布的IBGP会话故障概率计算方法。
A new approach is proposed to calculate the failure probability of IBGP sessions based on the probability distribution of IGP routing recovery time.
该路由利用链路能耗模型和节点发送数据概率，计算一个数据收集周期内节点总能耗。
This paper used the link energy consumption model and node transmission data probability to calculate the node total energy consumption in a data gathering cycle.
本文针对前缀路由查询，根据前缀被访问的概率依据字母表树构建了一种基于概率的最优路由查询数据结构。
This paper constructs a data structure to implement optimal looking up by alphabet tree based on probabilities of the prefix to be accessed.
本文针对前缀路由查询，根据前缀被访问的概率依据字母表树构建了一种基于概率的最优路由查询数据结构。
This paper constructs a data structure to implement optimal looking up by alphabet tree based on probabilities of the prefix to be accessed.
应用推荐