Everything About ___
Live briefing

Everything about M/M/c queue

Multi-server queueing model

In queueing theory, a discipline within the mathematical theory of probability, the M/M/c queue is a multi-server queueing model. In Kendall's notation it describes a system where arrivals form a single queue and are governed by a Poisson process, there are c servers, and job service times are exponentially distributed. It is a generalisation of the M/M/1 queue which considers only a single server. The model with infinitely many servers is the M/M/∞ queue. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: M/M/c 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/D/1 queueA closely related topic
  6. Go sideways: Pollaczek–Khinchine formulaA 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