Download - Queuing Theory & Models 1
![Page 1: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/1.jpg)
![Page 2: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/2.jpg)
![Page 3: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/3.jpg)
![Page 4: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/4.jpg)
![Page 5: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/5.jpg)
![Page 6: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/6.jpg)
![Page 7: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/7.jpg)
![Page 8: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/8.jpg)
Demand for a service facility >
Capacity of the facility.OR
Number of service facilities >
Number of customers requiring service.
![Page 9: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/9.jpg)
Collection of mathematical models of various queuing systems.
Used to analyze production and service processes exhibiting random variability in market demand (arrival times) and service times.
![Page 10: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/10.jpg)
Calling Population Jobs
Service Mechanism
Queue
Input Source Service System
Served Jobs
Leave the system
1.Arrival Process 2.Queue
Configuration
3. Queue Discipline
4.Service process
![Page 11: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/11.jpg)
An input source is characterized by Size of the calling population :
Source – Finite OR Infinite Time – Known Schedule OR randomly Number- Individuals OR Groups
Behavior of arrivals: Patient OR impatient
![Page 12: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/12.jpg)
2 aspects of a service system: configuration of the service system
speed of the service• Service time : amount of time needed to
service a customer. • Service Rate : number of customers
serviced during a particular time period.
Single Server Multiple Server
Finite Queue LengthInfinite Queue Length
![Page 13: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/13.jpg)
A. Single Server – Single Queue
Example: Students arriving at a library counter
Service System
ArrivalsQueue Customer
Leaves
![Page 14: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/14.jpg)
B. Single Server – Several Queues
Example: Service Calls at police stations
Service System
Arrivals Queue Customer Leaves
![Page 15: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/15.jpg)
C. Several Server – Single Queue
Example: Mc Donalds
Service System
Arrivals Queue Customer LeavesService System
Service System
![Page 16: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/16.jpg)
D. Several Server – Several Queues
Example: Immigration Counters at the Airports,
Cash Counters at Shopping Malls
Service System
Arrivals QueueCustomer Leaves
Service System
Service System
![Page 17: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/17.jpg)
Number of Queues layout of a service system Length of Queues physical space, legal restrictions, and attitude of the customers
![Page 18: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/18.jpg)
Static Queue Disciplines FCFS - prepaid taxi queues at airport LCFS - people who join an elevator
Dynamic Queue Disciplines SIRO – equal probability of being
served Priority - on basis of attributes or
urgency
![Page 19: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/19.jpg)
A Queuing Model is used to: approximate a real queuing situation or system.
Represented using Kendall’s notation
A / B / S / C/ N /P› A : distribution of inter arrival time › B : distribution of service time› S : number of parallel servers› C: System Capacity› N : Population Size› P : Queuing Discipline
![Page 20: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/20.jpg)
M / M / 1 / ∞ / ∞ single server queue with Poisson arrivals and exponential service times, a.k.a. M/M/1
M / M / S / ∞ / ∞ S server queue with Poisson arrivals and exponential service times, a.k.a. M/M/S
M / M / 1 / C / ∞ same as M/M/1 with finite system capacity C
M / M / 1 / C / K single server queue with Poisson arrivals from a population of K potential customers;and exponential service times
![Page 21: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/21.jpg)
5 people enter a store per hour and the store serves 4 people per hour. The stores is unable to serve its customers. Suggest the minimum number of people the store must serve to handle the rush
![Page 22: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/22.jpg)
Arrival rate (λ) = 5/ hr Service rate (µ) = 4/ hr
Infinite queue length = λ/µ = 5/4 > 1
But the ratio should be less than 1 to serve adequately.
To make λ/µ < 1, µ can be increased. So the optimum service rate
should be 6 instead of 4. (µ = 6)
![Page 23: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/23.jpg)
Used to model single processor systems or individual devices in a computer system.
The first part represents the input process, the second the service distribution, and the third the number of servers.
The M/M/1 Waiting line system has a Single channel Single phase Poisson arrival rate , λ Exponential service time, µ Unlimited population First-in First-out queue discipline
![Page 24: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/24.jpg)
M/M/1 Operating Characteristics
λ , µ
Utilization(fraction of time server is busy)
ρ = λ / µ
Average waiting times W = 1/(µ - λ) Wq = ρ/(µ - λ) = ρ W
Average number waiting L = λ /(µ - λ) Lq = ρ λ /(µ - λ) = ρ L
![Page 25: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/25.jpg)
On a network gateway, measurements show that the packets arrive at a mean rate of 125 packets per seconds(pps) and the gateway takes about 2 milliseconds to forward them.
Using an M/M/1 model, analyze the gateway.
What is the probability of buffer overflow if the gateway had only 13 buffers? How many buffers do we need to keep packet loss below one packet per million?
![Page 26: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/26.jpg)
Arrival rate = 125pps
Service rate = 1/.002 = 500 pps
Gateway utilization ρ = / = 0.25
Probability of n packets in the gateway › (1- ρ) ρ n = 0.75(0.25)n
Mean time spent in the gateway› (1/ )/(1- ρ) = (1/500)/(1-0.25) = 2.66 milliseconds
Probability of buffer overflow› P(more than 13 packets in gateway) = ρ13 = 0.2313 =1.49 X 10-8 ≈ 15 packets
per billion packets
To limit the probability of loss to less than 1 packet per billion ( 10-6 )› ρ n < 10-6
› n > log(10-6)/log(0.25) = 9.96› Need about 10 buffers
![Page 27: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/27.jpg)
Used for calculating waiting line characteristics when more than one server is involved
Two types› M/M/s finite queue› M/M/s finite (calling) population
![Page 28: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/28.jpg)
It follows Kendal’s system, indicating:
Arrivals are a Poisson process Service time is exponentially distributed. There are ‘s’ number of servers The length of the arrival queue is infinite The population of users to be served by the
system is infinite
![Page 29: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/29.jpg)
http://businessmanagementcourses.org/Lesson21QueuingTheory.pdf
http://www.stanford.edu/class/msande121/Handouts/qt.pdf
http://www.eventhelix.com/realtimemantra/congestioncontrol/queueing_theory.htm
http://staff.um.edu.mt/jskl1/simweb/mm1.htm
![Page 30: Queuing Theory & Models 1](https://reader035.vdocuments.us/reader035/viewer/2022081420/55211a10497959976c8b4605/html5/thumbnails/30.jpg)