ECE-547

Introduction to Computer
Communication Networks

Instructor: Xiaojun Lin

Lecture 11

Purdue University
 Reminder: Queueing Notation
 Notation:

Single server

… Multiserver queue

 Infinite Buffer: A/B/C  old notation A/B/C/∞

Inter-arrival time number of servers

Service time

Purdue University
 Reminder: Queueing Notation
 Finite Buffer: A/B/C/D

 Example:
(a) M/M/1 (Arrival Poisson, service exponential, 1-server)

Memoryless

(b) M/G/1

General

Purdue University
 Reminder: Queueing Notation
(c) M/M/m

# of servers = m

(d) M/M/m/N Buffer size = N

# of servers = m

(e) G/M/1 , etc…

Purdue University
 M/M/1 Queue
Poisson
 

 Possion arrivals and exponential service time.

 If n is the service time of the nth packet (customer), then
P{n ≤ s} = 1 - e-s, s ≥ 0

 Given that a packet has been in service for t seconds, what

is the probability that it will wait in service for an
additional s seconds. In other words find
P {n > s+t | n > t}.

Purdue University
 M/M/1 system

P { n  s  t , n  t}
P { n  s  t |  n  t} 
P{ n  t}
P{ n  s  t}

P{ n  t}
e   ( s t )
  t
e
 s
e
 P{ n  s} For all s, t ≥ 0.
Purdue University
 M/M/1 system
 Additional time a customer waits in service is
independent of how long it has waited so far.
 Quantities of interest:

1) Queue length distribution: Pn

2) Avg. Queue length = Σn Pn
3) Avg. time delay E(T)
4) Throughput γ

 Pn is defined to be the steady state probability of having

n customers in the system

Purdue University
 M/M/1 system
 Pn = lim t∞ Pn(t).

Probability of n packets in system at time t

 Pn(t+t) = f(Pj(t))

 Question: If at time t+t the queue is in state n, then what

are the possible states the queue can be in at time t?

Purdue University
 M/M/1 system
 Let n ≥ 1
a) At time t, Queue is in state ≥ n+2 or ≤ n-2 with probability
o(T)
b) Queue is in state n at time t
a) No arrivals or departure in (t, t+ T]
b) 1 arrival and 1 departure in (t, t+ T]
c) Any other scenario is o(T)
c) Queue is in state n-1 at time t
a) One arrival and no departure
b) o(T)
d) Queue is in state n+1 at time t
a) No arrival and 1 departure
b) Other scenario is o(T)

Purdue University
 M/M/1 system
 Pn(t + t) =
o(T) + Pn(t)[t t + (1- t)(1- t) +o(t)]
+ Pn-1(t)[(1-t) t + o(t)]
+ Pn+1(t)[(t)(1-t) + o(t)]

 Simplifying the above and incorporating all (t)2 term in

o(t), we have:
Pn(t+t) = [1- (+)t] Pn(t) + t Pn-1(t) + t Pn+1(t) +
o(t) Eq. (1)
 Expanding Pn(t+t) into a Taylor series about t, we have
Pn(t+t) = Pn(t) + (dPn(t)/dt) t + o(t) Eq.(2)

Purdue University
 M/M/1 system
 Dividing (1) and (2) by t, and setting t 0, we have:

dPn(t)/dt = -(+)Pn(t) + Pn-1(t) + Pn+1(t)

(The differential-deference equation)
As t∞, Pn(t)  Pn (a constant value called the
stationary probability or steady
state distribution)

 dPn(t)/dt  0.
Thus, (+)Pn = Pn-1 + Pn+1, n ≥ 1 Eq. (3)

Purdue University
 M/M/1 system
 Similar derivation for n=0 (Homework)
P0 = P1 

 Rearranging terms in Eq. (3):

Pn= Pn+1+ [Pn-1 – Pn], n ≥ 1
Hence:

P0= P1 0
P1= P2+[P0 - P1]
0
P2= P3+[P1 - P2]
0
Pn= Pn+1+[Pn-1 - Pn]

Purdue University
 M/M/1 system
 Pn+1= (/)Pn, for n=1,2,…
 Pn= (/)Pn-1
= (/)2Pn-2
Pn= (/)nP0
= nP0,
where  = / = utilization or load in system
 Now we have related Pn to P0, but how do we find these
probabilities in terms of the queue parameters (e.g.,  and
)? 

 Answer: Normalize the probabilities, i.e.,  Pn  1

n 0

Purdue University