Advertisement

Birth-Death Queues

  • Hong Chen
  • David D. Yao
Part of the Stochastic Modelling and Applied Probability book series (SMAP, volume 46)

Abstract

This chapter introduces three preliminary topics that will serve as the basis for much of the first part of this book (the first four chapters), which focuses on continuous-time Markov chain models. The three topics are (a) the birth—death process and related queueing models in Section 1.1, (b) the notion of time reversibility of a Markov chain in Section 1.2, and (c) likelihood ratio ordering and stochastic ordering in Section 1.3.

Keywords

Markov Chain Service Rate Sojourn Time Rate Matrix Stochastic Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ross, S.M. 1996. Stochastic Processes ( 2nd ed. ). Wiley, New York.MATHGoogle Scholar
  2. [2]
    Shanthikumar, J.G. and Yao, D.D. 1986. The Preservation of Likelihood Ratio Ordering under Convolution. Stochastic Processes and Their Applications, 23, 259–267.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    Shanthikumar, J.G. and Yao, D.D. 1986. The Effect of Increasing Service Rates in Closed Queueing Networks. Journal of Applied Probability, 23, 474–483.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    Stoyan, D. 1983. Comparison Methods for Queues and Other Stochastic Models. Wiley, New York.MATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Hong Chen
    • 1
  • David D. Yao
    • 2
  1. 1.Faculty of Commerce and Business AdministrationUniversity of British ColumbiaVancouverCanada
  2. 2.Department of Operations Research and Industrial EngineeringColumbia UniversityNew YorkUSA

Personalised recommendations