Statistically-optimum dynamic server assignment in systems with interfering servers

In a mobile radio system which uses many base stations to provide radio service over a large geographical area, and which has a stored-program processor to assign radio channels to base stations in real time, the queueing characteristics of the overall system are strongly dependent on the processor algorithms which are used. Three algorithms, which are in a certain minimax sense statistically optimum, are described below. The procedures are quite general, and may be usefully applied to any system which employs many servers, the use of some combinations of which is not allowed.