M/G/1 queue

In queueing theory, a discipline within the mathematical theory of probability, an M/G/1 queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times have a General distribution and there is a single server.[1] The model name is written in Kendall's notation, and is an extension of the M/M/1 queue, where service times must be exponentially distributed. The classic application of the M/G/1 queue is to model performance of a fixed head hard disk.[2]

  1. ^ Gittins, John C. (1989). Multi-armed Bandit Allocation Indices. John Wiley & Sons. p. 77. ISBN 0471920592.
  2. ^ Cite error: The named reference harrison was invoked but never defined (see the help page).