Abstract

We consider a `non-greedy' queueing system on a circle. In Chapter 2 of this thesis we present a new and very simple proof of the stability of this system (under the appropriate condition)
based on the average travel times between customers. Then we consider a polling network with finitely many service
... read more