Abstract
The use of Markov models in queueing theory is very common because they are appropriate for basic systems and lend themselves for easy applications. But often the real-world systems are so complex and so general that simple Markov and renewal process models do not represent them well. The presentation of matrix-analytic models of Chapter 8 is an introductory attempt to go beyond the basic models discussed earlier. The computer and communication systems which have had a major role in advancing technology in the past three decades require queueing models that go well beyond those we have seen so far in the last eight chapters. Their full discussion is beyond the scope of this text. Here we provide an introduction to the analysis of the waiting time process in the general queue and a few approximation techniques that have proved useful in handling emerging complex applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bhat, U. (2015). The General Queue G/G/1 and Approximations. In: An Introduction to Queueing Theory. Statistics for Industry and Technology. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8421-1_9
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8421-1_9
Published:
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-8420-4
Online ISBN: 978-0-8176-8421-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)