On the algebra of queues

Publisher Website
Google Scholar
Abstract
The more one studies the vast and ever-growing literature of the theory of queues, the more one is bewildered by the wide variety of mathematical techniques which different authors have used to analyse the same or similar problems. And yet it seems that, beneath the superficial diversity, there is a deeper unity obscured by the special devices and notations characteristic of the different approaches. It is the thesis of this paper that there is indeed such a unity, and that it is best appreciated by observing that the central results of queueing theory, despite the analytical and combinatorial accretions which, by historical accident, they have acquired, are essentially algebraic in character.

This publication has 18 references indexed in Scilit: