Computing the Blocking Probabilities for Spiderweb Channel Graphs
F. K. Hwang · IRE Transactions on Communications Systems · 1982
The problem of computing the blocking probabilities for spiderweb channel graphs is known to be difficult even under the simplifying Lee model. There have been only a few successful cases reported in the literature, all restricted to special types of four-stage channel graphs. In this paper we give an efficient method which computes the exact blocking probabilities (under the Lee model) for a large class of spiderweb channel graphs which are not restricted to four stages.