Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Exact performance estimates for multiprocessor memory and bus interference
IEEE Transactions on Computers
Effective Memory Bandwidth and Processor Blocking Probability in Multiple-Bus Systems
IEEE Transactions on Computers
Performance analysis of finite buffered multistage interconnection networks
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Switching and Traffic Theory for Integrated Broadband Networks
Switching and Traffic Theory for Integrated Broadband Networks
A Comprehensive Performance Evaluation of Crossbar Networks
IEEE Transactions on Parallel and Distributed Systems
An Analytical Model on the Blocking Probability of a Fault-Tolerant Network
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
Call packing has been recognized as a routing scheme that significantly reduces the blocking probability of connection requests in a circuit-switched Clos multistage interconnection network. In this paper, for the first time, we develop general analytical models for the point-to-point blocking probability of the call-packing scheme applied to Clos networks. By introducing a new parameter called the degree of call packing, the models can correctly estimate the blocking probability of both call-packing and random routing schemes. The models are verified by computer simulation for various size networks and traffic conditions.