An Analysis of the E_l/E_k/1 Queueing System by Restricted Minimal Lattice Paths

Abstract

The usual procedure for obtaining the equilibrium probability distribution of the queue length in a queueing system is by constructing and solving the difference-differential equations. In this paper, a new approach for deriving the equilibrium probability distributions of the queue length in the M/M/1, M/E_k/1 and E_l/E_k/1 queueing systems is presented, based on the generating function of the number of the minimal lattice paths. The proposed procedure obtains the equilibrium probability distribution more easily than the usual procedure, which solves difference-differential equations.

Keywords:

• combinatorial theory
• equilibrium probability distribution
• minimal lattice paths
• queueing systems