Talk:Kendall's notation

M for memoryless

The letter M in Kendall's notation stands for Memoryless, not Markov. The memoryless property of exponential and geometric distributions leads to a Markov process for the number of clients in the system. Markov arrivals are called MAP -Markov Arrival Process-.Marcanho (talk) 14:20, 1 February 2014 (UTC)

Kendall's original paper doesn't explain what the M stands for, he just writes that M is for ("random" or Poissonian) processes. These sources agree with M being for memoryless

• Harchol-Balter, M. (2012). "M/M/1 and PASTA". Performance Modeling and Design of Computer Systems. p. 236. doi:10.1017/CBO9781139226424.018. ISBN 9781139226424.
• Bolch, G.; Greiner, S.; de Meer, H.; Trivedi, K. S. (1998). "Single Station Queueing Systems". Queueing Networks and Markov Chains. pp. 209–262. doi:10.1002/0471200581.ch6. ISBN 0471193666.

while these describe M as being for Markov or memoryless

• Haviv, M. (2013). "Queues". International Series in Operations Research & Management Science. 191. doi:10.1007/978-1-4614-6765-6. ISBN 978-1-4614-6764-9. {{cite journal}}: Cite journal requires |journal= (help)
• Zonderland, M. E.; Boucherie, R. J. (2012). "Queuing Networks in Health Care Systems". Handbook of Healthcare System Scheduling. International Series in Operations Research & Management Science. Vol. 168. p. 201. doi:10.1007/978-1-4614-1734-7_9. ISBN 978-1-4614-1733-0.

so I think the article should list both and will edit it accordingly. Gareth Jones (talk) 11:53, 2 February 2014 (UTC)

What's K in A/S/c/K/N/D?

The introduction states that 'K is the capacity of the queue', but this contradicts Kendall's notation#K: The number of places in the system in the main body (except coincidentally for infinite queues, which is the default). I suspect the introduction is inaccurate, but I don't have any consistent references to back that up. Or do different authors use different conventions? NeilOnWiki (talk) 10:43, 6 February 2018 (UTC)