Server sharing with a limited number of service positions and symmetric queues

A class of MI/G/1 time-sharing queues with a finite number of service positions and unlimited waiting space is described. The equilibrium distribution of symmetric queues belonging to this class is invariant under arbitrary service-independent reordering of the customers at instants of arrivals and departures. The delay time distribution, in the special case of one service position where preempted customers join the end of the line, is provided in terms of Laplace transforms and generating functions. It is shown that placing preempted customers at the end of the line rather than at the beginning of the line results in a reduction of the delay time variance. Comparisons with the delay time variance of the case of unlimited number of service positions (processor sharing system) are presented.