Scribd
Upload
54 views3 pages

M/M/1 Model Arrival Service 1 Server

The document describes the M/M/1 queueing model, which involves arrivals that follow a Poisson process, services that take an exponentially distributed time, and 1 server. It provides 7 key metrics of the model: (1) the probability of an empty system, (2) the average queue length, (3) the average number in the system, (4) the average time in the queue, (5) the average time in the system, (6) the probability an arrival has to wait, and (7) the probability of n units in the system.

Uploaded by

Kirthi Rk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
54 views3 pages

M/M/1 Model Arrival Service 1 Server

The document describes the M/M/1 queueing model, which involves arrivals that follow a Poisson process, services that take an exponentially distributed time, and 1 server. It provides 7 key metrics of the model: (1) the probability of an empty system, (2) the average queue length, (3) the average number in the system, (4) the average time in the queue, (5) the average time in the system, (6) the probability an arrival has to wait, and (7) the probability of n units in the system.

Uploaded by

Kirthi Rk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 3

M/M/1 Model

Arrival
Service
1 server

1. The probability that no units are in the system


P o=1- ( / ) where is the mean number of
arrivals per time period (the arrival rate) and
is the mean number of services per time period
(the service rate)
2. The average number of units in the waiting line
L q= 2 / (- )
3. The average number of units in the system
L =L q+ /
4. The average time a unit spends in the waiting
line W q=L q/

5. The average time a unit spends in


the system W=Wq+1/
6. The probability that an arriving unit
has to wait for a service Pw= /
7. The probability of n units in the
system
Pn= (/) n P o

You might also like