Performance evaluation of channel allocation algorithms with the new reshuffle technique

This paper deals with the new reshuffle strategy for channel allocation algorithms. The need for a reshuffle strategy arises when the normal channel allocation algorithm wants to block a new call arrival or handover. It removes the congestion, frees channels and allocates them, so in some cases the blocking probability decreases by over 50%. The allocation algorithms are simulated in a cellular mobile network. The results obtained are compared with those achieved by channel allocation algorithms without the reshuffle technique and a new theoretical performance limit of blocking probability is derived.