1) polling cycle
探询周期
2) polling cycle time
轮询周期
1.
By the imbedded Markov chain theory and the probability generating function method,The authors derive the generating function of intervisit time , polling cycle time , service time of each station and queue length in the each station .
本文对具有Bernoulli反馈服务门限非对称的轮询系统 ,通过Markov链理论和概率母函数的方法进行研究 ,推导出了各站轮询时刻访问间隔时间、轮询周期、每站的服务时间、每站的队长、第i站 (i=1,2 ,…N)顾客C每次反馈的逗留时间系列及每次顾客C服务完成时系统的队长的概率母函
2.
The authors consider two stations of asymmetric polling system with one-message buffer,give the state probability of each station at polling instants,and the distributions and mathematical expections of polling cycle time,intervisit time and wating time.
讨论了两个站非对称轮询系统 ,给出了服务器轮询到某站时各站状态的分布列 ,也给出了轮询周期、访问间隔时间、电文等待时间的分布和数学期望以及各站的损失率。
3.
For gated service discipline,the generating functions of waiting time of customer and polling cycle time are derived,and,by using Markov chain theory, mean of queue length is obtained.
本文对批到达离散时间轮询系统进行研究 ,在门限服务原则下 ,推出了顾客等待时间和轮询周期的概率母函数。
3) cyclic polling
周期轮询
1.
Improved cyclic polling dynamic bandwidth allocation algorithms in EPON;
EPON系统中周期轮询动态带宽分配算法的改进
5) polling cycle
查询周期
6) exploration cycle
勘探周期
补充资料：探询
1.探问。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条