M/G/k queue: Difference between revisions

Revision as of 18:39, 12 June 2013

Revision as of 19:16, 12 June 2013

Line 1:

In [[queueing theory]], an '''M/G/k queue''' is a queue model where arrivals are '''M'''arkovian (modulated by a [[Poisson process]]), service times have a '''G'''eneral [[probability distribution|distribution]] and there are ''k'' servers. The model name is written in [[Kendall's notation]], and is an extension of the [[M/M/c queue]], where service times must be [[exponential distribution|exponentially distributed]] and of the [[M/G/1 queue]] with a single server. Most performance metrics for this queueing system are not known and remain an [[open problem]].<ref>{{cite doi|10.1007/s11134-009-9147-4}}</ref>

==Model definition==