Scribd
Upload
56 views

Lectures 8 & 9 M/G/1 Queues: Eytan Modiano MIT

The document discusses M/G/1 queues and provides examples of M/M/1, M/D/1, and queues with vacations. The key points are: 1) The Pollaczek-Khinchin formula provides the expected waiting time W for an M/G/1 queue in terms of the arrival rate λ, service rate μ, and second moment of the service time distribution. 2) Examples show the formula simplifies for M/M/1 and M/D/1 queues. 3) Queues with vacations have longer wait times that depend on the vacation time distribution parameters. 4) Time division multiple access (TDMA),

Uploaded by

Mohit Kumar Boriwal
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
56 views

Lectures 8 & 9 M/G/1 Queues: Eytan Modiano MIT

The document discusses M/G/1 queues and provides examples of M/M/1, M/D/1, and queues with vacations. The key points are: 1) The Pollaczek-Khinchin formula provides the expected waiting time W for an M/G/1 queue in terms of the arrival rate λ, service rate μ, and second moment of the service time distribution. 2) Examples show the formula simplifies for M/M/1 and M/D/1 queues. 3) Queues with vacations have longer wait times that depend on the vacation time distribution parameters. 4) Time division multiple access (TDMA),

Uploaded by

Mohit Kumar Boriwal
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Lectures 8 & 9

M/G/1 Queues

Eytan Modiano MIT

Eytan Modiano Slide 1

M/G/1 QUEUE

Poisson General independent Service times

M/G/1

Poisson arrivals at rate Service time has arbitrary distribution with given E[X] and E[X2]
Service times are independent and identically distributed (IID) Independent of arrival times E[service time] = 1/ Single Server queue

Eytan Modiano Slide 2

Pollaczek-Khinchin (P-K) Formula

E[X 2 ] W= 2(1 )
where = / = E[X] = line utilization

From Littles formula, NQ = W T = E[X] + W N = T= NQ +

Eytan Modiano Slide 3

M/G/1 EXAMPLES

Example 1: M/M/1 E[X] = 1/ ; E[X2] = 2/2

W=

2(1- )

(1- )

Example 2: M/D/1 (Constant service time 1/) E[X] = 1/ ; E[X2] = 1/2

W= = 22(1-) 2(1-)
Eytan Modiano Slide 4

Proof of Pollaczek-Khinchin

Let
Wi = waiting time in queue of ith arrival Ri = Residual service time seen by I (I.e., amount of time for current customer receiving service to be done) Ni = Number of customers found in queue by i

i arrives Ri Xi-3

Wi Xi-2 X i-1 Ni = 3 Xi Time ->

W = Ri + i

Eytan Modiano Slide 5

j=i- N i

i-1

X j

E[Wi] = E[Ri] + E[X]E[Ni] = R + NQ/

Here we have used PASTA property plus independent service time property

W = R + W/ => W = R/(1-)
Using littles formula

What is R?
(Time Average Residual Service Time)

Residual Service Time R(t)

X1 X1

X4 X2 X2 X3 X3 X4 time ->

Let M(t) = Number of customers served by time t E[R(t)] = 1/t (sum of area in triangles)
t M(t) 1 t i=1

1 t

R( )d = 0

M(t) 2 2 X i = 1 M(t) i 2 t M(t) i=1

As t -> Infinity

M(t) t

= average departure rate = average arrival rate

M(t) M(t)
Eytan Modiano Slide 6

i=1

2 i M(t) X

= E[X2]

=> R = E[X2]/2

M/G/1 Queue with Vacations


Useful for polling and reservation systems (e.g., token rings) When the queue is empty, the server takes a vacation Vacation times are IID and independent of service times and arrival times
If system is empty after a vacation, the server takes another vacation The only impact on the analysis is that a packet arriving to an empty system must wait for the end of the vacation

i arrives
Vj Ri Xi-3

Wi Xi-2 X i-1 Ni = 3 Xi Time ->

W = Ri + i

j=i- N i

i-1

X j

Eytan Modiano Slide 7

E[Wi] = E[Ri] + E[X]E[Ni] = R + NQ/ = R/(1-)

Average Residual Service Time


(with vacations)

Residual Service Time R(t)

X1 X1

V1 X2 X2 V1

X4 X3 X3 X4 time ->

t R = [R(t)]= 1 t 0
E[M(t)] t

M(t) R( )d = 1 t

(
i=1
+

X2 i + 2

L(t)

j=1

V2 j 2

R =

lim t

2 E[X ] 2

2 L(t) E[V ] t 2


Eytan Modiano Slide 8

Where L(t) is the number of vacations taken up to time t M(t) is the number of customers served by time t

Average Residual Service Time


(with vacations)

As t->,

M(t)/t -> and L(t)/t -> v = vacation rate

Now, let I = 1 if system is on vacation and I = 0 if system is busy By Littles Theorem we have,
E[I] =E[#vacations] = P(system idle) = 1- = v E[V] => v = (1-)/E[V]

Hence,

remember W = R/(1-)
+ (1- )E[V 2] 2 E[V]

R =

E[X 2] 2

W =

E[X 2 ] 2(1- )

E[V 2 ] 2 E[V]

Eytan Modiano Slide 9

Example: Slotted M/D/1 system


1/
Each slot = one packet transmission time = 1/

Transmission can begin only at start of a slot If system is empty at the start of a slot, server not available for the
duration of the slot (vacation)

E[X] = E[v] = 1/ E[X2] = E[v2] = 1/2

1/ 2 1/ / 2 / W= + = + 2(1 / ) 2 / 2( ) 2 = WM / D /1 + E[ X]/ 2

Eytan Modiano Slide 10

Notice that an average of 1/2 slot is spent waiting for the start of a slot

FDM EXAMPLE

Assume m Poisson streams of fixed length packets of arrival rate /m each


multiplexed by FDM on m subchannels. Total traffic = Suppose it takes m time units to transmit a packet, so =1/m. The total system load: =

FDM Frames

User 1 User 2

IDLE

SLOT for User 1 SLOT for User 2 IDLE

User m

SLOT for User m

SLOT for User m

We have an M/D/1 system { W=E[x2]/2(1-) }

W
Eytan Modiano Slide 11

FDM

2 ( /m) m 2 (1- )

m 2 (1- )

Slotted FDM

Suppose now that system is slotted and transmissions start only on m


time unit boundaries.

SLOTTED FDM Frames


User 1 User 2 SLOT for User 2 SLOT for User 1 SLOT for User 2

User m

Vacation for User m

SLOT for User m

This is M/D/1 with vacations


Server goes on vacation for m time units when there is nothing to transmit E[V] = m; E[V2] = m2.

WSFDM = WFDM + E[V2]/2E[V] = WFDM + m/2


Eytan Modiano Slide 12

TDM
TDM Frame
slot m slot 1 slot 2

EXAMPLE

...

slot m

TDM with one packet slots is the same (a session has to wait for its own slot boundary), so W = R/(1-)

(1- =E[V 2] ) E[X 2] R = = + 2 2 E[V] E[X 2 ] 2(1- = ) E[V 2 ] 2 E[V]

W = =
Eytan Modiano Slide 13

TDM

EXAMPLE

Therefore,

WTDM = WFDM + m/2

Adding the packet transmission time, TDM comes out best because transmission time = 1 instead of m. TFDM TSFDM TTDM = [WFDM ] + m = [WFDM + m/2]+m = [WFDM + m/2]+1 = TFDM - [m/2-1]

Eytan Modiano Slide 14

You might also like