Extended Markov and Renewal Models

Abstract

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.