Skip to main content
Log in

Traffic processes in a class of finite Markovian queues

Queueing Systems Aims and scope Submit manuscript

Abstract

This paper exposes the stochastic structure of traffic processes in a class of finite state queueing systems which are modeled in continuous time as Markov processes. The theory is presented for theM/E k /φ/L class under a wide range of queue disciplines. Particular traffic processes of interest include the arrival, input, output, departure and overflow processes. Several examples are given which demonstrate that the theory unifies many earlier works, as well as providing some new results. Several extensions to the model are discussed.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Çinlar and R.L. Disney, Streams of overflows from a finite queue. Oper. Res. 15 (1967) 131–134.

    Article  Google Scholar 

  2. R.L. Disney and P.C. Kiessler,Traffic Processes in Queueing Networks: A Markov Renewal Approach (Johns Hopkins Univ. Press, Baltimore, 1987).

    Google Scholar 

  3. F.P. Kelly,Reversibility and Stochastic Networks (J. Wiley, Chichester, 1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barnes, J.A., Disney, R.L. Traffic processes in a class of finite Markovian queues. Queueing Syst 6, 311–326 (1990). https://doi.org/10.1007/BF02411480

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02411480

Keywords

Navigation