Skip to main content
SpringerLink
Log in

On The Number of Customers Lost in a Finite State-Dependent Queue

  • Short Note
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

This paper concerns the transient behaviour of a finite state-dependent queue. Explicit expressions for several important distribution functions as obtained by using a simple but efficient method. They are distribution of the number of customers blocked (lost), the distribution of the number of times in which the system is blocked during an arbitrary time interval (0, t), and the distribution for the number of customers served during a busy period.

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

Access this article

Log in via an institution

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. ABATE, J. KIJIMA, M. AND WHITT, W., Decomposition of the M / M / 1 transition funciton. Queueing System 9, 323–336 (1991).

    Article  Google Scholar 

  2. CHAUDHRY M. AND ZHAO, Y., first-passage-time and busy-period distributins of discretetime Markovian queues: Geom(n)/Geom(n)/1/N. QUESTA 18, 5–26 (1994).

    Google Scholar 

  3. KEILSON, J., Markov Chain Models - Rarity and Exponentiality. Spinger, Berlin (1979).

    Book  Google Scholar 

  4. KIJIMA, M., The transient solution to a class of Markovian queues. Comput. Math. Appi. 24, 17–24 (1992).

    Google Scholar 

  5. MOHANTY S.W., Montazer-Haghighi, A. and Trueblood, R., On the transient behavior of a finite birth-death process with an appliation. Computers Ops. Res., 20, 239–248 (1993).

    Article  Google Scholar 

  6. B. PARLEET, The Symmetric Eigenvalue Problems. Prentice-Hall, New York (1980).

    Google Scholar 

  7. ROSS, S.M., Approximating transition probabilities and mean occupation tiems in continuous-time Markov chains, Prob. Eng. Inf. Sci. 1, 251–264 (1987).

    Article  Google Scholar 

  8. SHARMA, O., Markovian Queues, Ellis Harwood, New York, (1990).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Alabama, Tuscaloosa, Alabama, 35487, USA

    P. Patrick Wang & William Gray

  2. Department of Mathematics, Western Illinois University, Macomb, Illinois, 61455, USA

    Meckinley Scott

Authors
  1. P. Patrick Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. William Gray
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meckinley Scott
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Patrick Wang, P., Gray, W. & Scott, M. On The Number of Customers Lost in a Finite State-Dependent Queue. OPSEARCH 34, 259–276 (1997). https://doi.org/10.1007/BF03398530

Download citation

  • Published:

  • Issue Date:

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

Search

Navigation