ABSTRACT: We consider a variant of M/M/1 where customers arrive singly or in pairs. Each single and one member of each pair is called primary; the other member of each pair is called secondary. Each ...

Lecture Notes for the course EE621: Markov Chains and Queueing Systems. Please contact me if you happen to come across any typos or errors in the notes!

Add a description, image, and links to the queueing-theory topic page so that developers can more easily learn about it.