Everything About ___
Live briefing

Everything about M/M/1 queue

Type of queue model in queueing theory

In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution. The model name is written in Kendall's notation. The model is the most elementary of queueing models and an attractive object of study as closed-form expressions can be obtained for many metrics of interest in this model. An extension of this model with more than one server is the M/M/c queue. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: M/M/1 queueA 5-minute orientation
  2. Skim a recent paper: Queue length estimation for signal controlling in a connected environmentInfluential work since 2022
  3. Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
  4. Read the landmark paper: The Regulation of Queue Size by Levying TollsCited 1,088 times
  5. Go sideways: M/M/c queueA closely related topic
  6. Go sideways: M/D/1 queueA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics