Scribd
Upload
16 views15 pages

MM1 Queuing

This document discusses the M/M/1 queuing model. It describes the assumptions of Poisson arrivals and exponential service times. It provides derivations and properties of the model including expressions for the probability distribution, average number of customers, waiting times, and server utilization.

Uploaded by

The Amuse Pro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views15 pages

MM1 Queuing

This document discusses the M/M/1 queuing model. It describes the assumptions of Poisson arrivals and exponential service times. It provides derivations and properties of the model including expressions for the probability distribution, average number of customers, waiting times, and server utilization.

Uploaded by

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

M/M/1 Queuing model

Abdur Rahman (Aakash)


Lecturer
Statistics Discipline
Khulna University.
Poisson Arrival Process
• The arrival rate is expressed in the average
number of arrivals during a unit of time.

• A commonly used model for random, mutually


independent arrivals is the Poisson arrival process.
• The Poisson distribution can be obtained by
evaluating the following assumptions for arrivals
during an infinitesimal short period of time (𝛿𝑡)

AR, Lecturer, Statistics Discipline, KU 2


Poisson Arrival Process
• The probability that one arrival occurs between t and 𝑡 + 𝛿𝑡 is 𝜆t ;
𝜆 called arrival rate which is a constant, independent of time t,
and independent of arrivals in earlier intervals.
• 𝛿𝑡, 𝛿𝑡
• The number of arrivals in non-overlapping intervals are
statistically independent
• The probability of two or more arrivals happening during 𝛿t is
negligible compared to the probability of zero or one arrival, i.e. it
is of the order 0 (t).
• Combining the first and third assumption, the probability of no
arrivals during the interval t, 𝑡 + 𝛿𝑡 is found to be 1 − 𝜆𝑡

AR, Lecturer, Statistics Discipline, KU 3


Service time
• Service time represents the amount of time spent on an
average to complete a task.

• For example: if an engineer can complete three service calls a


day, the average time the engineer spends in completing a
single service call is 8 hours.

• Exponential service time: The concept of exponential service


time comes handy when the average time gets an exponential
change.

• Exponential growth in the distributions is quite likely and


brings a positive result, while an exponential decline is quite
unlikely to happen.
AR, Lecturer, Statistics Discipline, KU 4
Practical application of the concept:
The exponential service time concept is used in queuing theories,
and queuing theories are used for addressing the following issues:

1. The concept is used for addressing the issues, such as


identification of waiting time in banks and super markets, etc.

2. The concept is used for estimating the waiting time involved in


communication between computers.

3. The concept can be used for estimating the failure time before
failures.

4. The concept can be used for estimating the waiting time


involved in passengers waiting for a bus or a train.

AR, Lecturer, Statistics Discipline, KU 5


Advantages of the concept
• The concept of exponential service time is used in solving
situations where queuing time is required.
• It is used to address the queuing characteristics in the
situations, and the arrival process of elements into the
queue.
• For example, the concept can be used to study the average
length of the queue and the average waiting period involved
in the queue.
• Thus, the exponential service time represents the continuous
and frequent occurring of events at independent intervals of
time.

AR, Lecturer, Statistics Discipline, KU 6


M/M/1 Queuing Model:
• An M/M/1 single server queuing model is a
servicing facility with Poisson input and
exponential service lines with FIFO queuing
discipline.
• Here the two M refer the arrival and service
distribution are memory less or Markovian
and refers to that there is one server in the
system.

AR, Lecturer, Statistics Discipline, KU 7


Explanation:
• Suppose that customers arrive at a single server service
station according to Poisson process having rate 𝜆.

• Each customer upon arrival goes directly into service if


the server is free otherwise the customer joints the
queue.

• When the server becomes empty then the customer


enters the server.

• The successive service time are assumed to be


independent exponential random variable having rate 𝜇.

AR, Lecturer, Statistics Discipline, KU 8


M/M/ 1 queuing model
Then the queuing model is given by:

𝜆
𝑃𝑛 = 𝑃 𝑁 𝑡 = 𝑛 = 𝜌𝑛 1 − 𝜌 ;𝜌 = < 1
𝜇

This is known as M/M/1 queuing model.

AR, Lecturer, Statistics Discipline, KU 9


Derivation of M/M/1 queuing model

AR, Lecturer, Statistics Discipline, KU 10


Derivation of M/M/1 queuing model
• Summing each equation to its preceding one we obtain

AR, Lecturer, Statistics Discipline, KU 11


Derivation of M/M/1 queuing model

AR, Lecturer, Statistics Discipline, KU 12


Derivation of M/M/1 queuing model

This is the functional form of M/M/1 queuing model

AR, Lecturer, Statistics Discipline, KU 13


Properties of an M/M/1 model
• The number of customer follow geometric distribution.
𝜆
i.e. 𝑃𝑛 = 𝜌𝑛 1 − 𝜌 ; 𝑛 ≥ 0 where, 𝜌 = <1
𝜇

𝜌
• Average number of customer in the system is 𝐿 =
1−𝜌

• Average number of customers waiting in the queue is


𝜆2
𝐿𝑄 = 𝜆𝑊𝑄 =
𝜇(𝜇−𝜆)

• Average amount of time that a customer spend in the


𝐿 1
system is 𝑊 = =
𝜆 1−𝜆

AR, Lecturer, Statistics Discipline, KU 14


Properties of an M/M/1 model
• Amount of time that a customer spend for the waiting
1 1 1
in the queue is 𝑊𝑄 = 𝑊 − 𝐸 𝑠 = 𝑊 − = −
𝜇 𝜇−𝜆 𝜇

𝜆
Thus 𝑊𝑄 =
𝜇(𝜇−𝜆)

• The proportion of time in the server is idle is 𝑃0 = 1 −


𝜆
=1−𝜌
𝜇

• The proportion of time the server is busy is 1 − 𝑃0 =


𝜆
1− 1−𝜌 =𝜌=
𝜇

AR, Lecturer, Statistics Discipline, KU 15

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy