Features of some discrete-time cyclic queueing networks (Q1339086)

A finite number of service stations are cyclically connected and provide service to a population of customers of a fixed finite total size. Time is slotted. At the end of a time slot, each customer in service independently moves to the station right ahead in the cycle with a probability depending only on the number of that station, or else stays in service where he is. For the two cases in which each station is a single server and hence can serve no more than one customer at a given time, or else each station is an infinite server, the authors derive product-form invariant distributions for the network state process, the state specifying the number of customers present at each node.