A shared service algorithm for a trunked mobile system

Abstract

A model has been developed and solved which captures the essence of the concept of mobile dispatch service. There are two types of users, dispatch and interconnect (calls routed from the public switched telephone network, of much longer holding times). Also, only some of the available repeaters can be used for interconnect traffic, and blocked interconnect calls are cleared. Dispatch calls, however, can access all repeaters, and then are queued if all repeaters are busy. One design decision involves a trade between blocking of interconnect calls and queueing of dispatch calls. A formula has been derived for both interconnect blocking probability and the mean dispatch queueing time to permit this trade. The results indicate that a good operating point is to have (N - a_d)(rounded down) interconnected repeaters, where there are N total repeaters and a_d Erlangs of dispatch traffic.