摘要
本文推出了采用循环选择的二级网络的一组阻塞率计算公式。通过递推方法,这些公式可应用于多级网络,并证明了循环选择的阻塞率低于随机选择。
A group of formulae for calculating the blocking probability of the two-stage network using cyclic selection is derived in this paper Through recursive procedure these formulae can be applied to multi-stage networks as well. It is shown that the blocking probability of the cyclic selection is lower than that of the random selection.
出处
《通信学报》
EI
CSCD
北大核心
1990年第2期17-24,共8页
Journal on Communications