(em em one cue) n. The simplest statistical queueing model. The first M is for memoryless arrival time. The second M is for memoryless service time. The 1 refers to the fact that there is justone queue and one servicer of messages. In plain English then, this model describes queues that see messages arrive at times independent of each other and receive messages that have processing times independent of those previously processed. Such queues are the easiest to analyze.
Home M/M/1 queue