The System GI/G/1; Imbedded Markov Chains

  • N. U. Prabhu
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 7)


In this chapter we first consider the system GI/G/1. Let W n denote the nth customer’s waiting time; then the sequence of random variables {W n ,n ≥ 0} forms a Markov chain. In Sections 8.2–8.3 we investigate the limit behaviour of W n and the associated idle times.


Markov Chain Service Time Queue Length Busy Period Transition Probability Matrix 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • N. U. Prabhu
    • 1
  1. 1.Cornell UniversityIthacaUSA

Personalised recommendations