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




 * while these describe M as being for Markov or memoryless




 * 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 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)