Professional Documents
Culture Documents
UNIVERSITY ISLAMABAD
EEE-354: Telecommunication
Systems Engineering
Queueing Systems
Queuing Systems in Telecommunications
In telecommunication networks, queuing theory is used
every time a network resource is shared by competing
“service requests”.
– OSI Layer 3: There are layer 3 buffers for IP-level QoS support (e.g.,
DiffServ).
Why Analyze Queue?
• How long does a customer expect to wait in the queue before they are
served, and how long will they have to wait before the service is
complete?
• What is the probability of a customer having to wait longer than a
given time interval before they are served?
• What is the average length of the queue?
• What is the probability that the queue will exceed a certain length?
• What is the expected utilization of the server and the expected time
period during which he will be fully occupied (remember servers cost
us money so we need to keep them busy).
In fact if we can assign costs to factors such as customer waiting time and
server idle time then we can investigate how to design a system at
minimum total cost.
Queueing Systems: Basics
• Queueing systems are of interest to
– The users of the systems (customers)
• Minimize their delays, loss (or blocking) probabilities, etc.
– The service providers.
• The cost of providing the service to customers while ensuring that the
customers are “reasonably” satisfied.
– For example, the service providers do not want to assign too many or they do not
want to provide an extremely large buffer size etc
– Service/transmission/etc.
– Server/transmitter/etc.
– Queue/buffer/memory/etc.
Basics: Key elements of queueing systems
Customer: refers to anything that arrives at a facility and requires
service, e.g., people, machines, trucks, emails, calls ,packets.
Server: refers to any resource that provides the requested service,
e.g., repairpersons, retrieval machines, trunks,.
Queues are where the units of work wait if the server is busy and
can’t do the work as it arrives.
Some more basics …
Calling population:
• Finite population model: If arrival rate depends on the number of
customers being served and waiting.
• Infinite population model: If arrival rate is not affected by the
number of customers being served and waiting.
System Capacity:
• A limit on the number of customers that may be in the waiting line or
system.
– Limited capacity: e.g., an automatic car wash only has room for 10 cars
to wait in line to enter the mechanism.
– Unlimited capacity: e.g., concert ticket sales with no limit on the
number of people allowed to wait to purchase tickets.
Some more basics…
• Queue discipline: the logical ordering of
customers in a queue that determines which
customer is chosen for service when a server
becomes free, for example:
– First-in-first-out (FIFO)
– Last-in-first-out (LIFO)
– Service in random order (SIRO)
– Shortest processing time first (SPT)
– Service according to priority (PR).
Important Metrics
Example:
• If the average waiting time is 2 hours and customers arrive at a rate
of 3 per hour then, on average, there are 6 customers in the system.
M/M/1 Queues
• M/M/1 means that we have
• Poisson arrival process.
• Exponential distributed service times
• 1 server
• 1 queue
• Infinite waiting process. The steady-state parameters
M/M/1 Queue Analysis
P! (t+∆) = (P!"# (t) ∗ 𝑃𝑟𝑜𝑏𝑎𝑏𝑖𝑙𝑖𝑡𝑦 𝑜𝑓 0 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑎𝑛𝑑 1 𝑑𝑒𝑝𝑎𝑟𝑡𝑢𝑟𝑒) +
(P! (t) ∗ 𝑃𝑟𝑜𝑏𝑎𝑏𝑖𝑙𝑖𝑡𝑦 𝑜𝑓 0 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑎𝑛𝑑 0 𝑑𝑒𝑝𝑎𝑟𝑡𝑢𝑟𝑒) +
(P!$# (t) ∗ 𝑃𝑟𝑜𝑏𝑎𝑏𝑖𝑙𝑖𝑡𝑦 𝑜𝑓 1 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑎𝑛𝑑 0 𝑑𝑒𝑝𝑎𝑟𝑡𝑢𝑟𝑒)
P! 𝜇 + 𝜆 = P!"# 𝜇 + P!$# 𝜆
M/M/1 Queue Analysis
P= 𝜇 = P> 𝜆
M/M/1 Queue Analysis
P9 𝜇 + 𝜆 = P9<= 𝜇 + P9>= 𝜆
P? 𝜆 = P= 𝜇
For n=1
P= 𝜇 + 𝜆 = P@ 𝜇 + P? 𝜆
P= 𝜆 = P@ 𝜇
M/M/1 Queue Analysis
𝜆
P= = P?
𝜇
A
P@ = P=
B
P9 = P? 𝜌9
M/M/1 Queue Analysis
• How to find P?
P9 = P? 𝜌9
M/M/1 Queue Analysis
¥ ¥
L = E[n] = å nPn = å nr n (1 - r )
n =0 n =0
¥ ¥
= (1 - r )å r (nr n -1
) = (1 - r )å r ( r n )'
n =0 n =0
¥
= r (1 - r )å ( r n )'
n =0
1 r
= r (1 - r )( )' =
1- r 1- r
l
ÞL=
µ -l
M/M/1 Queue Analysis
For L𝒒
Average people in line= Average people in system-those being served
L% = 𝐿 − 𝜌
&
= -𝜌
#$&
&#
=
#$&
For W
$
W=%
& #
=( )*( )
#$& '
=
M/M/1 Queue Analysis
For W𝒒
=
WF =W- B
=
-
B