Skip to main content
Log in

An Analysis of the E l /E k /1 Queueing System by Restricted Minimal Lattice Paths

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arizono, I., Ohta, H., Deutsch, S. et al. An Analysis of the E l /E k /1 Queueing System by Restricted Minimal Lattice Paths. J Oper Res Soc 46, 245–253 (1995). https://doi.org/10.1057/jors.1995.29

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1995.29

Keywords

Navigation