A STUDY OF SOME SPECIFICATIONS OF QUEUEING SYSTEMS

Abstract

Queueing theory was initiated by the Danish engineer Erlang who studied it in relation with telecommunication problems. Later, it was found that the same concepts had important applications in operations research in the context of service systems. From the beginning of the sixties, interest in queueing theory was further simulated by computer applications especially in computer net­ works. During all this time the mathematical theory was gradually elucidated, simplified, unified and tied up with the more general theory of stochastic processes, so that queueing theory now represents one of the most important fields of applications of stochastic processes.

A queueing problem arises every time we have customers demanding some services which may not always be immediately available, and customers are forced to queue for the required services. We always assume that randomness intervenes as an ingredient of queueing problems, so that we assume the necessity of probabilistic concepts to model them