Extended Markov and Renewal Models

  • U. Narayan Bhat
Part of the Statistics for Industry and Technology book series (SIT)


The queueing systems discussed in the last two chapters were devoid of any features such as group arrivals, group service, priority service, etc., that would make modeling difficult. In this chapter we introduce them in a limited sense, so that Markov process modeling is still possible by extending the models as well as procedures for analyzing them. However, the readers should be warned that the extension of the procedure comes at the cost of employing a higher level of mathematics in the use of probability generating functions (PGFs). Also we introduce briefly the concept of a renewal process and how is can be used to model queueing systems.


Service Time Busy Period Transition Probability Matrix Service Time Distribution Erlang Distribution 
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.

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • U. Narayan Bhat
    • 1
  1. 1.Department of Statistical ScienceSouthern Methodist UniversityDallasUSA

Personalised recommendations