1.

M/M/1 : The Classical Queueing System

The steady state probability of finding k customers in the system:
Average number of customers in the system
Littles Law states that
T states that the average number of customers in a queuing system is equal to the
average arrival rate of customers to that system, times the average time spent in that system.
ence, !, the average time spent in the system in case of "#"#$ is
!aiting line in queue W
q
and waiting time in the system ! are distributed with negative
e%ponential distribution.
Another interesting result is the probability of finding at least k customers in the system:
&rove that this equals
k
.
2. M/G/1 queue and Pollaczek!hintchine "P!# $o%mula:
k
k
P ' $ (
$ ) to of range the in is it and where

' $ (

L
' $ (
*

q
L
W L

' $ (
$
' $ (
#

L W
t
e t W P
' (
' (

>
' $ ( ' ) ( + ) ' (
' (


> >

q
t
q
W P t if e t W P
&,- .ormula gives the e%pected number in the queue in the terms of mean and variance of
the service time distribution. Let /(T' be the e%pected service time and 0ar(T' be the variance
of the service time, then the &,- formula for the e%pected number in the queue is
1r if we define the squared coefficient of variation of service time as
2ote that L
q
and hence L, ! and W
q
are increasing in
*
. This means that congestion
increases as the variance of service time increases. ence the measures of performance for a
system can be improved by decreasing the variance of service time, even when the mean
service time does not change.
&. M/M/S : The classical Queueing System 'ith S se%(e%s " 'ithout )%io%ity system#
The steady state probability of finding no customers in the system:
Average number of customers in the queue
Average number of customers in the system is L and L=L
q
+S
!, the average time spent in the queue in case of "#"#3 and W
q
can be determined from
Littles Law.
*. M/M/S "'ith non)%eem)ti(e )%io%ity#
'' ( $ ( *
' ' ( ( ' ( (
* *
T E
T E T Var
L
q

get we T Var letting and T E and T E that know We , ' ( ' (

$
' (
*

' $ ( *
* * *

q
L
' $ ( *
' $ (
' # $ (
* *
*
*
*

+

s
q
s
C
L get we then C
$
$
)
$
)
4
' $ ( ' (
4
' (

'

+

S
n
S n
S
S
n
S
P

$ ) to of range the in is it and
S
where

) *
$
' $ ( 4
P
S
S
L
S S
q

+
!
k
, the steady state e%pected waiting time (including service' for a member of priority
class k, is
!here
and
s 5 number of servers,
5 mean service rate per busy server,

i
5 mean arrival rate for priority class i, for 5 $,*,6.,N,
+. M/M/1 "'ith )%eem)ti(e )%io%ity#
7f the other assumptions of the above model are retained, it has been found that when s5$,
, ,......., * , $ ,
$ $
$
N k for
B B
W
k k
k
+

,
4
4
$
)

s
!
s
s
s
!
!
s
+

,
_

, $
)
B
N k for
s
B
i
k
i
,......, * , $ , $
$

,
$

N
i
i

, ,......., * , $ ,
# $
$
N k for
B B
W
k k
k