k Queueing Model

4.2 M/M/1/k Queueing Model Characteristics 1. Interarrival time is exponential with rate λ ▪ Arrival process is Poisson Process with rate λ 2. Inter...
Author: Bryce Whitehead
3 downloads 3 Views 259KB Size
4.2 M/M/1/k Queueing Model Characteristics 1. Interarrival time is exponential with rate λ ▪

Arrival process is Poisson Process with rate λ

2. Interarrival time is exponential with rate µ ▪

Number of services is Poisson Process with rate µ

3. Single Server 4. System size is finite = k

Notation M / M / 1 / k / FCFS

5. Queue Discipline : FCFS OR372-Dr.Khalid Al-Nowibet

1

4.2 M/M/1/k Queueing Model Steady-State Distribution State of the system system is in state n if there are n customers in the system (waiting or serviced) Let Pn be probability that there are n customers in the system in the steady-state. n = 0 , 1 , 2 , 3 , …, k

OR372-Dr.Khalid Al-Nowibet

2

4.2 M/M/1/k Queueing Model Steady-State Distribution Rate Diagram: 1. 2.

If system changes state, where to go? How fast the system changes state? λ

λ 1

0

µ OR372-Dr.Khalid Al-Nowibet

. . .

2

µ

λ

λ

λ

µ

k

k-1

µ

µ 3

4.2 M/M/1/k Queueing Model Steady-State Distribution Balance Equations: For each state n: Average Rate out of State n

Average Rate in to State n

=

Average Rate out of state n = ∑ (rates n → k) ⋅ Pr{system in state n} ∀k

Average Rate in to state n =

OR372-Dr.Khalid Al-Nowibet

∑ (rates k → n) ⋅ Pr{system in state k} ∀k

4

4.2 M/M/1/k Queueing Model Average Rate out of State n

Steady-State Distribution Balance Equations: λ

0

λ

1

2

. . .

µ µ µ n = 0 ⇒ λP0 = µP1 n = 1 ⇒ λP1 + µP1 = λP0 + µP2 n = 2 ⇒ λP2 + µP2 = λP1 + µP3 n = 3 ⇒ λP3 + µP3 = λP2 + µP4 ........... n = k ⇒ µPk = λPk-1 OR372-Dr.Khalid Al-Nowibet

= λ

λ

λ

Average Rate in to State n

k

k-1

µ

µ

⇔ (λ+µ)P1 = λP0 + µP1 ⇔ (λ+µ)P2 = λP0 + µP3 ⇔ (λ+µ)P3 = λP2 + µP4 ⇔ µPk = λPk-1 5

4.2 M/M/1/k Queueing Model Steady-State Distribution Solution of Balance Equations: λP0 = µP1 (λ+µ)P1 = λP0 + µP2 (λ+µ)P2 = λP1 + µP3 ........... µPk = λPk-1 Eq-1 ⇔ Eq-2 ⇔ Eq-3 ⇔

λ P0 = µP1 (λ+µ)P1 − λ(µ/λ)P1 = µP2 (λ+µ)P2 − λ(µ/λ)P2 = µP3 ..... Eq-k ⇔ λPk-1 = µPk OR372-Dr.Khalid Al-Nowibet

⇔ λP1 = µP2 ⇔ λP2 = µP3 ......

6

4.2 M/M/1/k Queueing Model Steady-State Distribution Solution of Balance Equations: Make all equations functions of P0 only: Eq-1 ⇔ Eq-2 ⇔ Eq-3 ⇔

λP0 = µP1 λP1 = µP2 λP2 = µP3 ..... Eq-k ⇔ λPk-1 = µPk

OR372-Dr.Khalid Al-Nowibet

⇔ P1 = (λ/µ)P0 ⇔ from Eq-1 ⇔ P2 = (λ/µ)2 P0 ⇔ from Eq-2 ⇔ P3 = (λ/µ)3 P0 ...... ⇔ from Eq-(k-1) ⇔ Pk = (λ/µ)k P0

7

4.2 M/M/1/k Queueing Model Steady-State Distribution Solution of Balance Equations: Computing P0 :

∑P ∀n

n

=1

P0 + P1 + P2 + P3 + … +Pk= 1 P0 + (λ/µ)P0 + (λ/µ)2P0 + (λ/µ)3P0 + …+ (λ/µ)kP0 = 1 P0 [ 1 + (λ/µ)+ (λ/µ)2 + (λ/µ)3 + … + (λ/µ)k ] = 1 P0 = [1 + (λ/µ)+ (λ/µ)2 + (λ/µ)3 + … + (λ/µ)k ]−1 OR372-Dr.Khalid Al-Nowibet

8

4.2 M/M/1/k Queueing Model Steady-State Distribution Solution of Balance Equations: Computing P0 :

P0 =

1

∑( ) k

n =0

λ n µ

All Pn are functions of P0 . Then Pn > 0 if and only if P0 > 0 Then P0 > 0 for any value of λ and µ since ∑ ( ∞

n =0

OR372-Dr.Khalid Al-Nowibet

)

λ n µ

is finite sum

9

4.2 M/M/1/k Queueing Model Steady-State Distribution Solution of Balance Equations: ⎛ ⎞ ⎝µ⎠

Pn = ⎜⎜ λ ⎟⎟

n

P0 n

⎛λ⎞ ⎜⎜ ⎟⎟ µ⎠ ⎝ Pn = n k ⎛λ⎞ ⎜⎜ ⎟⎟ ∑ n =0 ⎝ µ ⎠

n = 1,2,3, …,k

For any value of λ and µ OR372-Dr.Khalid Al-Nowibet

10

4.2 M/M/1/k Queueing Model Steady-State Distribution Solution of Balance Equations: ⎛ ⎞ ⎝µ⎠

Pn = ⎜⎜ λ ⎟⎟

ρ=

n

P0

1− ρ P0 = 1 − ρ k +1

λ µ

1− ρ Pn = ρ 1 − ρ k +1 n

n = 1,2,3, …,k

for any value of ρ (ρ can be > 1) OR372-Dr.Khalid Al-Nowibet

11

4.2 M/M/1/k Queueing Model Steady-State Distribution Solution of Balance Equations:

why (λ/µ) can be >1 ?? If system is full arrival rate λ= 0 Number of customers in system does not go to ∞

OR372-Dr.Khalid Al-Nowibet

12

4.2 M/M/1/k Queueing Model Performance Measures In steady state λe , µ , P 0 LB = E[busy servers] = E[#Cust. in service] Ls = Lq + LB Ws = Wq + (1/µ) System is Ls = λWs in Steady Stead Lq = λWq LB = λWB Know 4 measures ⇒ all measures are known OR372-Dr.Khalid Al-Nowibet

13

4.2 M/M/1/k Queueing Model Performance Measures 1. Effective Arrival Rate λe: Rate of Entering the system

λ Total Arrivals Rate of Not Entering the system

OR372-Dr.Khalid Al-Nowibet

λe

λb

µ 1

Finite size = k

λ = λ e + λb 14

4.2 M/M/1/k Queueing Model Performance Measures 1. Effective Arrival Rate λe: λe = λ . Pr{an arrival enters the system} = λ . Pr{system is not full} = λ . [P0 + P1 + P2 + … + Pk−1 ] = λ . [1 − Pk ] = Through-put Rate λb = λ . Pr{an arrival can’t enter the system} = λ . Pr{system is full} = λ . Pk OR372-Dr.Khalid Al-Nowibet

15

4.2 M/M/1/k Queueing Model Performance Measures 2. Average Customers in System Ls: k

L s = ∑ n ⋅ Pn

Finite sum

n =0

3. Average Busy servers LB: LB = E[busy servers] = E[#Cust. in service] LB = 0 . P0 + 1 (P1 + P2 + P3 + …) = 1 − P0

1− ρ = 1− 1 − ρ k +1

OR372-Dr.Khalid Al-Nowibet

ρ= 16

λ µ

4.2 M/M/1/k Queueing Model Performance Measures 4. Utilization of the System U: U = Pr{ n > 0 } = P1 + P2 + P3 + … + Pk = 1 − P0 5. Average Customers in Queue Lq:

ρ=

λ µ

Lq = Ls − LB or Lq = 0.(P0+P1) + 1.P2 + 2.P3 + … + (k−1)Pk OR372-Dr.Khalid Al-Nowibet

17

4.2 M/M/1/k Queueing Model Performance Measures 6. Average Waiting time in System Ws: Ls = λe .Ws



Ws =

Ls λe

7. Average Time Spent in Queue Wq: Lq = λe .Wq OR372-Dr.Khalid Al-Nowibet



Wq =

Lq λe 18

4.2 M/M/1/k Queueing Model Example

Consider the car-wash station in Example-2. Assume now that the it is not allowed for care to wait on the side of the road. So, station has made some modifications so that 6 cars can wait inside the station (See diagram). Also, a driver is hired to move cars from parking to the machine. The driver takes an average of 2 minutes to move the car to the machine.

No Parking

Car-Wash Station

OR372-Dr.Khalid Al-Nowibet

CarWash Machine

19

4.2 M/M/1/k Queueing Model Example

Assuming that the arrival rate is 9 cars per hour and the washing time is 6 minutes. Also, assume Poisson arrivals and exponential service. Answer the following questions in steady-state: 1. What is the average number of cares waiting in station? 2. If the car wash costs 15 SR and the station works from 8:00am to 8:00 pm how much money the collects per day on average? How much the station losses? 3. On average How much it takes for a customer until he leaves with his car washed? 4. The management decided to buy another machine if the old machine works more than 85% of the time. Will the management buy a new machine? OR372-Dr.Khalid Al-Nowibet

20

4.2 M/M/1/k Queueing Model Example

λ = 9 cars/hour E[S]= E[driving]+E[washing] = 2 min + 6 min = 8 min µ = 1/8 cars/hr = 7.5 cars/hr single machine ρ = 9/7.5 = 1.2 k =(max. # waiting) + (max. # in service) = 6+1= 7 (max. system size)

M/M/1/k queueing system Pn =

ρn k

∑ρ

n

n = 0,1,2, … ,7

ρ=

λ µ

n =0

OR372-Dr.Khalid Al-Nowibet

21

4.2 M/M/1/k Queueing Model Example

λ = 9 cars/hour

µ = 7.5 cars/hr

M/M/1/k=7 system

1. Average number of cares waiting in station = Lq = Ls − (1−P0) n

0

1

2

3

4

5

6

7

Σ

ρn

1

1.2

1.44

1.73

2.07

2.49

2.99

3.58

16.50

Pn

0.061

0.073

0.087

0.105

0.126

0.151

0.181

0.217

1.00

nPn

0.000

0.073

0.175

0.314

0.503

0.754

1.086

1.520

4.424

Lq = Ls − (1−P0) = 4.424 − (1−0.061) = 3.485 cars

OR372-Dr.Khalid Al-Nowibet

22

4.2 M/M/1/k Queueing Model Example

λ = 9 cars/hour

µ = 7.5 cars/hr

M/M/1/k=7 system

2. car wash costs = 15 SR works hours = 12 hours E[money collected per day] =(15SR) E[cars washed per day] (12hr) E[cars washed per day] = λe = λ (1 − P7) = 9 (1−0.217) = 7.047 car ⇒ E[money collected per day] =(15SR)(7.047)(12hr) = 1268.46 SR E[money lost per day] =(15SR) E[cars not washed per day] (12hr) E[cars not washed per day] = λb = λ . P7 = 9 (0.217) = 1.953 car ⇒ E[money lost per day] =(15SR)(1.953)(12hr) = 351.54 SR

OR372-Dr.Khalid Al-Nowibet

23

4.2 M/M/1/k Queueing Model Example

λ = 9 cars/hour

µ = 7.5 cars/hr

M/M/1/k=7 system

3. E[time until customer leaves with his car washed] = Ws Ws = Ls /λe = 4.424/7.047 = 0.6278 hrs

4. The management decided to buy another machine if the old machine works more than 85% of the time. Will the management buy a new machine? Percentage of working time for the old machine = Pr{ n > 0 } = U U = 1 − P0 = 1 − 0.061 = 0.939 > 0.85 ⇒ Buy a new machine OR372-Dr.Khalid Al-Nowibet

24