## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

INTRODUCTION Queueing theory deals with the study of queues (waiting lines). Queues abound in practical situations. The earliest use of queueing theory was in the design of a telephone system. Applications of queueing theory are found in fields as seemingly diverse as traffic control, hospital management, and time-shared computer system design. In this chapter, we present an elementary queueing theory. QUEUEING SYSTEMS

A. Description: A simple queueing system is shown in Fig. 16-1. Customers arrive randomly at an average rate of λ a . Upon arrival, they are served without delay if there are available servers; otherwise, they are made to wait in the queue until it is their turn to be served. Once served, they are assumed to leave the system. We will be interested in determining such quantities as the average number of customers in the system, the average time a customer spends in the system, the average time spent waiting in the queue, etc. Arrivals

Queue

Service

Departures

Fig.16-1 A simple queuing system The description of any queueing system requires the specification of three parts:

1. The arrival process 2. The service mechanism, such as the number of servers and service-time distribution 3. The queue discipline (for example, first-come, first-served)

B. Classification : The notation A/B/s/K is used to classify a queueing system, where A specifies the type of arrival process, B denotes the service-time distribution, s specifies the number of servers, and K denotes the capacity of the system, that is, the maximum number of customers that can be accommodated. If K is not specified, it is assumed that the capacity of the system is unlimited. Examples: M/M/2 queueing system (M stands for Markov) is one with Poisson arrivals, exponential service-time distribution, and 2 servers. An M/G/l queueing system has Poisson arrivals, general service-time distribution, and a single server. A special case is the M/D/1 queueing system, where D stands for constant (deterministic:) service time. Examples of queueing systems with limited capacity are telephone systems with limited trunks, hospital emergency rooms with limited beds, and airline terminals with limited space in which to park aircraft for loading and unloading. In each case, customers who arrive when the system is saturated are denied entrance and are lost.

1

C. Useful Formulas

Some basic quantities of queueing systems are L: the average number of customers in the system Lq: the average number of customers waiting in the queue Ls: the average number of customers in service W: the average amount of time that a customer spends in the system Wq: the average amount of time that a customer spends waiting in the queue Ws: the average amount of time that a customer spends in service

Many useful relationships between the above and other quantities of interest can be obtained by using the following basic cost identity: Assume that entering customers are required to pay an entrance fee (according to some rule) to the system. Then we have: Average rate at which the system earns = λ a x average amount an entering customer pays (16.1) where

**λ a , is the average arrival rate of entering customers
**

λ a = lim

X (t ) t →∞ t

and X(t) denotes the number of customer arrivals by time t. If we assume that each customer pays $1 per unit time while in the system , then Eq. 16.1 yeilds: (16.2) L =λa x W Equation (16.2) is sometimes known as Little's formula. Similarly, if we assume that each customer pays $1 per unit time while in the queue,then Eq. 16.1 yields Lq = Ls =

λ a x wq λ a x ws

(16.3) (16.4)

If we assume that each customer pays $1 per unit time while in service, Eq. (16.1) yields Note that Eqs. (16.2) to (16.4) are valid for almost all queueing systems, regardless of the arrival process, the number of servers, or queueing discipline. BIRTH-DEATH PROCESS We say that the queueing system is in state Sn , if there are n customers in the system, including those being served. Let N(t) be the Markov process that takes on the value n when the queueing system is in state Sn, with the following assumptions:

1. If the system is in state Sn, it can make transitions only to Sn-1, or Sn+1 , n ≥ 1 ; that is, either a customer completes service and leaves the system or, while the present customer is still being serviced, another customer arrives at the system ; from So , the next state can only be S1 .

,

2. If the system is in state Sn, at time t, the probability of a transition to Sn+1, in the time interval (t, t +

Δ t) is an Δ t. We refer to an as the arrival parameter (or the birth parameter).

3. If the system is in state Sn , at time t, the probability of a transition to Sn-1, in the time interval (t, t + Δ t) is dn Δ t. We refer to dn as the departure parameter (or the death parameter). The process N(t) is sometimes referred to as the birth-death process.

2

Let pn(t) be the probability that the queueing system is in state Sn, at time t; that is, pn(t) = P{N(t) = n} The state transition diagram for the birth-death process is shown in Fig. 16-2: a1 a2 an-1 an a0

0

d1 Where

1

d2

2

d3

n-1

dn

n

dn+1

n+1

**a0 p0 d1 aa p 2 = 0 1 p0 d1d 2 a a .....an −1 pn = 0 1 p0 d1d 2 .......d n p1 =
**

THE M/M/1 QUEUEING SYSTEM In the M/M/1 queueing system, the arrival process is the Poisson process with rate (the mean arrival rate) and the service time is exponentially distributed with parameter (the mean service rate).

μ

λ

Then the process N(t) describing the state of the M/M/1 queueing system at time t is a birth-death process with the Following state independent parameters: an = Then

λ

, n≥ 0

, dn =

μ

,n ≥ 1

p0 = 1 −

λ =1− ρ μ

n

where

ρ=

**λ < 1, which implies that the server, on the average, must process the customers faster μ ρ= λ μ
**

is sometimes referred to as the traffic intensity of the system.

λ ⎞⎛ λ ⎞ ⎛ p n = ⎜ 1 − ⎟ ⎜ ⎟ = (1 − ρ ) ρ n μ ⎠⎝ μ ⎠ ⎝

than their average arrival rate; otherwise the queue length (the number of customers waiting in the queue) tends to infinity. The ratio

**The average number of customers in the system is given by
**

L =

ρ

1 − ρ

=

λ μ − λ

3

W

=

1

μ − λ

=

1

μ (1 − ρ )

W

q

=

λ ρ = μ (μ − λ ) μ (1 − ρ )

Lq =

Examples:

λ2 ρ 2 = μ (μ − λ ) 1 − ρ

1. Customers arrive at a watch repair shop according to a Poisson process at a rate of one per every 10 minutes, and the service time is an exponential r.v. with mean 8 minutes. (a) Find the average number of customers L, the average time a customer spends in the shop W, and the average time a customer spends in waiting for service Wq . (b) Suppose that the arrival rate of the customers increases 10 percent. Find the corresponding changes in L, W, and Wq.

(a) The watch repair shop service can be modeled as an M/M/1 queueing system with Thus, we have

λ = 1/10 & μ = 1/8 .

L =

λ 1 / 10 = = 4 μ − λ 1 / 8 − 1 / 10

W =

1 1 = = 40 Minutes μ − λ 1 / 8 − 1 / 10

Wq= W – Ws = 40 - 8 = 32 minutes

(b) Now

L =

λ = 1/9 & μ

=

1/8

λ 1/9 = = 8 μ − λ 1/8 − 1/9

W =

1 1 = = 72 μ − λ 1/8 −1/ 9

Wq= W – Ws = 72 - 8 = 64 minutes

It can be seen that an increase of 10 percent in the customer arrival rate doubles the average number of customers in the system. The average time a customer spends in queue is also doubled.

2. A drive-in banking service is modeled as an M/M/1 queueing system with customer arrival rate of 2 per minute. It is desired to have fewer than 5 customers line up 99 percent of the time. How fast should the service rate be?

P(5 or more customers in the system} =

n=5

∑ p n = ∑ (1 − ρ ) ρ

n=5

∞

∞

n

= ρ

5

ρ =

λ μ

In order to have fewer than 5 customers line up 99 percent of the time, we require that this probability be less than 0.01. Thus,

ρ

5

⎛ λ ⎞ = ⎜ ⎟ ⎝ μ ⎠

5

≤ 0 . 01

4

from which we obtain

μ

5

≥

λ5

0 . 01

=

25 = 32000 0 . 01

or μ ≥ 5 . 024 Thus, to meet the requirements, the average service rate must be at least 5.024 customers per minute.

3. People arrive at a telephone booth according to a Poisson process at an average rate of 12 per hour, and the average time for each call is an exponential r.v. with mean 2 minutes. (a) What is the probability that an arriving customer will find the telephone booth occupied? (b) It is the policy of the telephone company to install additional booths if customers wait an average of 3 or more minutes for the phone. Find the average arrival rate needed to justify a second booth.

(a) The telephone service can be modeled as an M/M/1 queueing system with

λ = 1/5 & μ

=

1/2

ρ =

λ = 2/5. μ

The probability that an arriving customer will find the telephone occupied is P(L > 0), where L is the average number of customers in the system. Thus, P(L > 0) = 1 – p0 =1 – (1 - ρ ) = ρ =2/5 = 0.4

(b)

W

q

=

λ λ = ≥ 3 μ (μ − λ ) 0 .5 ( 0 .5 − λ )

from which we obtain booth is 18 per hour.

λ ≥ 0.3 per minute. Thus, the required average arrival rate to justify the second

5

- AT3 ETR Queuing Analysis
- Instruction Plans
- unit6_wks1_key.pdf
- Noter
- 03 Probability Distributions.ppt
- Topic 3_2 the Theory of Probability_Lecture32_HO (2)
- Markov chain implementation in C++ using Eigen
- Queueing Theory
- Probability theory
- quiz1-6
- Curing the Queue - Dissertation Maartje E. Zonderland
- bfm%3A978-0-387-74995-2%2F1.pdf
- Queueing Theory
- STA08
- CPT June 2011 Syllabus
- Testing Material
- Probability
- 05_fall_exam1_soln
- Senior Reliability Engineer
- V2No01Mar13P034
- 6Steady State Characteristics
- StuRC8eCh02
- Lecture 25
- STAT 400 Midterm 1 Cheat Sheet
- Binomial Table
- 01LINGKUP_MANAJEMEN_PROYEK
- Role of Information Technology in Learning Organization
- Week 5 -1
- Boltzmann Machines
- chapter 2.3 Block diagram and application.pdf

Skip carousel

- AUSMAT Student Guide 2011
- New Torrance Unified Report Card
- Simulation and Modeling MCQ'S
- MCAT Day 1 2016 exam
- Interest formulas-days
- The Dyslexic Reader 2011 - Issue 58
- MCAT Day 2 2016 exam
- Pacific Research Study
- Answers to the Number Analogy Questions in Part II Civil Service Professional Exam Reviewer
- Jp Morgan Sample Aptitude Placement Paper Level1
- ETFO internal memo on new curriculum
- ThoughtWorks Sample Aptitude Placement Paper Level1
- The Dyslexic Reader 2009 - Issue 52
- Simulation and Modeling MCQ'S
- Sunway University College Monash University Foundation Year (MUFY) 2010
- UT Dallas Syllabus for ee3300.001 06f taught by William Pervin (pervin)
- UT Dallas Syllabus for cs2305.001 06f taught by Nancy Van Ness (nancyvn)
- UT Dallas Syllabus for math2312.002.09s taught by (mxf091000)
- UT Dallas Syllabus for math1314.003 05f taught by Grigory Kramer (gkramer)
- 2014 MCA Results
- UT Dallas Syllabus for engr3300.001.11f taught by Jung Lee (jls032000)
- Changes for the 2016 Grades 3-8 ELA and Math Tests
- UT Dallas Syllabus for math5320.501 06f taught by Thomas Butts (tbutts)
- Tenth-Grade WASL in Spring 2006
- UT Dallas Syllabus for phys2303.001.10f taught by John Hoffman (jhoffman)
- Essar_Sample_Aptitude_Placement_Paper_Level1
- UT Dallas Syllabus for math3307.501.09s taught by Thomas Butts (tbutts)
- bls_2001-1_1979.pdf
- The Hidden Value of Curriculum Reform
- 2015-10-13 Smarter Balance Assessment Communication Update

Skip carousel

- Rescoldos Del Tiempo
- Math and the Bible
- Edexcel M2 QP Jan 2011
- Godrej
- CBSE Sample Paper Solutions for Class 11 Mathematics - Set A
- Pre Calculus Textbook
- Edexcel C3 QP Jan 2011
- Survival Models Solution Chapter 2
- Introducing Numbers
- Hashing
- 34185221 the Foundations of Math[1]
- msg00012
- GOVERNOR
- 8 Math Square and Square Roots
- Question Maths for class 8
- HOW TO PLAY SCI
- Some Tips for the Revised CSIR UGC NET for Physical Sciences
- Hp Lab Report Trifilar[2]
- Whitepaper on Ground Loops and Induced Interference in CCTV
- eBook - THE TWELVE LAYERS OF DNA
- Linear Equations 8th Grade Lesson Plan
- Grade A TOK essay
- Good Books
- COSMOS
- Permutation and Combination
- Metrology Chapter 1
- Lesson 1 -Introduction to Physics
- Resultant Forces - Practice Qs
- Additional Mathematics Project Work 2013 WPKL
- BS ABT Curriculum

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading