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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ross, S.M. 1996. Stochastic Processes ( 2nd ed. ). Wiley, New York.
Shanthikumar, J.G. and Yao, D.D. 1986. The Preservation of Likelihood Ratio Ordering under Convolution. Stochastic Processes and Their Applications, 23, 259–267.
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.
Stoyan, D. 1983. Comparison Methods for Queues and Other Stochastic Models. Wiley, New York.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Chen, H., Yao, D.D. (2001). Birth-Death Queues. In: Fundamentals of Queueing Networks. Stochastic Modelling and Applied Probability, vol 46. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-5301-1_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5301-1_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2896-2
Online ISBN: 978-1-4757-5301-1
eBook Packages: Springer Book Archive