Blocking Probabilities for a Class of Spiderweb Channel Graphs
暂无分享,去创建一个
The blocking probabilities for spiderweb channel graphs are well known to be difficult to compute. Recently, Takagi studied a class of spiderweb channel graphs and gave recursive equations for computing their blocking probabilities. In this paper we use a recent result in combinatorics to give a dosed form solution for the recursive equations. Consequently, the blocking probability for any graph in this class can be expressed in a form involving at most two nested summations.
[1] C. Y. Lee. Analysis of switching networks , 1955 .
[2] F. K. Hwang,et al. A generalization of takagl's theorem on optimal channel graphs , 1978, The Bell System Technical Journal.
[3] F. K. Hwang,et al. On blocking probabilities for switching networks , 1977, The Bell System Technical Journal.