Analysis of call packing and rearrangement in a multi stage switch

Abstract

A new relationship is derived between blocking probability and the rearrangement probability density for a three stage switch. A novel analytical model for call packing is developed. The model confirms previous results from simulation and shows that packing/repacking reduces blocking and hence the required rearrangements, compared to the random routing method. The probability density of rearrangements is also derived.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>