On the parallel simulation of fixed channel allocation algorithms

Abstract

We present, in this paper, several channel allocation algorithms for use in cellular communications networks or mobile networks. The channel allocation algorithms make use of fixed allocation of channels and channel reorganization. The channel reorganization algorithms are used to free channels within a neighborhood of the cell in which the requesting call originates. The performance of these algorithms was evaluated via distributed simulation, making use of the Chandy–Misra–Bryant NULL message algorithm, on a BBN Butterfly multiprocessor. In addition to evaluating the performance of the channel allocation algorithms, we examine the efficiency of the NULL message algorithm as a tool for our simulations. The reason for making use of parallel simulation was to avoid the long simulation times and large memory consumption characteristic of sequential luniprocessorr simulations. Our results indicate that our channel allocation algorithms performed efficiently. Upwards of 20% of the calls which were not initially connected by the borrowing schemes were connected after channel reorganization. The NULL message approach proved to be efficient when the message traffic was not extremely low.