PERFORMANCE OF A TIME-SLOT SEARCHING MECHANISM IN MULTIRATE CIRCUIT SWITCHING SYSTEMS

Abstract

The blocking probabilities of n x 64 Kb/s multi-slot calls are generally much higher than that of single slot calls. In order to improve these blocking probabilities of multi-slot calls, we propose a scheme to limit the number of time slots to be searched for lower rate calls. We analyze the performance of our scheme in a double-buffered time-space-time switching network which accommodates multi-slot calls as well as single-slot calls. The proposed method yields the reduced blocking probabilities of multi-slot calls, the increased traffic handling capacity and the reduced CPU processing load, compared with those of the conventional methods.