Poco común · Saberes
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.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
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.
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Tsaitgaist (CC BY-SA 3.0) ·
Cartas cercanas
-
★
Message queue
Means of interprocess communication in software engineering
-
★
Kendall's notation
System for describing queueing models
-
★★★
Modelo matemático
Tipo de modelo conceptual que emplea algún tipo de formulismo matemático
-
C★★
Coeficiente de correlación de rango de Kendall
-
C★
Continuous mapping theorem
Probability theorem
-
★
Cola doblemente terminada
Estructura de datos en la cual se pueden agregar o quitar elementos tanto por el principio como el final