Uncommon · Knowledge
M/M/1 queue
Queue with Markov (Poisson) arrival process, exponential service time distribution and one server
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.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. · Image: Tsaitgaist (CC BY-SA 3.0) ·
Related cards
-
★
Message queue
Means of interprocess communication in software engineering
-
★
Kendall's notation
System for describing queueing models
-
★★★
Mathematical model
Description of a system using mathematical concepts and language
-
K★★
Kendall rank correlation coefficient
Type of statistic
-
C★
Continuous mapping theorem
Probability theorem
-
★
Double-ended queue
Abstract data type for which elements can be added to or removed from either the front or back