Evaluating blocking probability in distributors

A model for evaluating blocking probability in distribution networks is presented, and equations for computing blocking probability for the class of series-parallel networks are derived. The quotations are exact for pure series networks and approximate for parallel networks. The accuracy of the approximation is investigated by comparing the blocking probability computed using the equations to measured simulation data. The results indicate that for higher loads and larger switches the approximation is generally within 10% of the simulation results.<<ETX>>

[1]  David G. Cantor,et al.  On non-blocking switching networks , 1971, Networks.

[2]  M. D. MacLaren.  The Art of Computer Programming—Volume 1: Fundamental Algorithms (Donald E. Knuth) , 1969 .

[3]  Janak H. Patel.  Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.

[4]  G. Jack Lipovski,et al.  The architecture of a large associative processor , 1970, AFIPS '70 (Spring).

[5]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[6]  Einir Valdimarsson.  Blocking in multirate networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[7]  C. Y. Lee.  Analysis of switching networks , 1955 .

[8]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[9]  Nicholas Pippenger,et al.  On Crossbar Switching Networks , 1975, IEEE Trans. Commun..

[10]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.