In [[queueing theory]], a discipline within the mathematical [[probability theory|theory of probability]], an '''M/G/k queue''' is a queue model where arrivals are '''M'''arkovian[[Markov property|Markovian]] (modulated by a [[Poisson process]]), service times have a '''G'''eneralGeneral [[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 journal | last1 = Kingman | first1 = J. F. C. | author-link1 = John Kingman | title = The first Erlang century—and the next | journal = [[Queueing Systems]] | volume = 63 | pages = 3–4 | year = 2009 | issue = 1–4 | doi = 10.1007/s11134-009-9147-4| s2cid = 38588726 }}</ref>
