Discrete Time Queue

Int. J. Mathematics in Operational Research, Vol. 2, No.
2, 2010 233
Copyright 2010 Inderscience Enterprises Ltd.

Discrete-time batch service GI/Geo/1/N queue with
accessible and non-accessible batches
Veena Goswami*
School of Computer Application,
KIIT University,
Bhubaneswar 751024, India
E-mail: veena_goswami@yahoo.com
*Corresponding author
K. Sikdar
Department of Mathematics,
BMS Institute of Technology,
PO Box 6443,
Doddaballapura Main Road,
Yelahanka, Bangalore 560064, India
E-mail: karabisonai@yahoo.com
Abstract: Discrete-time queues are extensively used in modelling the
asynchronous transfer mode environment at cell level. In this paper, we
consider a discrete-time single-server finite-buffer queue with general inter-
arrival and geometric service times where the services are performed in
accessible or non-accessible batches of maximum size b with a minimum
threshold value a. We provide a recursive method, using the supplementary
variable technique and treating the remaining inter-arrival time as the
supplementary variable, to develop the steady-state queue/system length
distributions at pre-arrival and arbitrary epochs under the early arrival system.
The method is depicted analytically for geometrical and deterministic inter-
arrival time distributions, respectively. Various performance measures and
outside observers observation epochs are also discussed. Finally, some
computational results have been presented.
Keywords: AB; accessible batch; discrete-time queue; finite buffer; NAB;
non-accessible batch; supplementary variable.
Reference to this paper should be made as follows: Goswami, V. and
Sikdar, K. (2010) Discrete-time batch service GI/Geo/1/N queue with
accessible and non-accessible batches, Int. J. Mathematics in Operational
Research, Vol. 2, No. 2, pp.233257.
Biographical notes: Veena Goswami is currently a Professor in the School of
Computer Application, KIIT University, Bhubaneswar, India. She received her
PhD from Sambalpur University, India, in the year 1994 and then worked as a
Research Associate at Indian Institute of Technology, Kharagpur for two years.
Her research interests include continuous- and discrete-time queues. She has
published research articles in INFORMS Journal on Computing, Computers
and Operations Research, RAIRO Operations Research, Computers and
Mathematics with Applications, Computers and Industrial Engineering,
Applied Mathematical Modelling, Applied Mathematics and Computation, etc.

234 V. Goswami and K. Sikdar

K. Sikdar is currently a Lecturer in the Department of Mathematics at BMS
Institute of Technology, Bangalore. She received her PhD from Indian Institute
of Technology, Kharagpur in the year 2004. From August 2005 to July 2008,
she worked at Indian Institute of Science, Bangalore as a Post Doctoral Fellow.
Her main research interests include continuous-time queueing theory and its
applications. She has published research papers in various journals such as
Performance Evaluation, Computers and Operations Research, Applied
Mathematics and Computation, and Journal of Applied Mathematics and
Stochastic Analysis.
1 Introduction
Discrete-time queueing systems have been receiving a notable interest in the last few
decades due to their applications to a variety of slotted digital communication systems
and other related areas. Their importance has grown due to the advent of the broadband
integrated services digital network (B-ISDN), which can support transfer of video, voice
and data communication with varying characterisations and different quality of service
(QoS) requirements through high-speed local area networks (LANs), on-demand video
distribution and video telephony communications. The asynchronous transfer mode
(ATM) is conceived as the basic transfer mode for implementing B-ISDN. In these
systems, the time axis is slotted and fixed length packets, called cells are used to
transfer information. Readers are referred to Bruneel and Kim (1993), Takagi (1993),
Woodward (1994) and references therein. In discrete-time queueing systems, the arrivals
and departures can occur simultaneously at a boundary epoch of a slot. In the case of
simultaneity, their order may be taken care of by either arrival-first (AF) or departure-
first (DF) management policies, which are also known as late arrival system with delayed
access (LAS-DA) and early arrival system (EAS), respectively, and both have potentials
for applications. For more details on this topic, see Hunter (1983) and Gravey and
Hbuterne (1992).
Batch-service queueing models are often encountered in applications. Queueing
systems with batch service are common in transportation processes involving trains,
buses, ships, airplanes, elevators, cable cars and intra-campus shuttles that run on
schedule and have considerable economic implications. In semiconductor manufacturing
processes, in service mechanisms of a web server and computer operating systems, jobs
are frequently processed in batches whose sizes usually vary depending on the total
number of jobs accumulated.
Queues with finite buffer space are more realistic in real-life situations than queues
with infinite-buffer space as the former is used to store arrived customers if the server is
busy. However, if the buffer space is full, the arrived customer is considered to be lost. In
such situations, one of the main concerns of a system designer is the estimation of the
blocking probability (PBL) of the customers which, in general, is kept small to avoid loss
of customers. Also, it is widely recognised that the results of the infinite-buffer queues
can be obtained from those of the corresponding finite-buffer counterparts by taking the
finite-buffer parameter sufficiently large.
In this paper, we focus on a more general discrete-time single-server finite-buffer
batch-service queue with accessible and non-accessible batches (NABs) wherein
inter-arrival time and service time of batches are, respectively, arbitrarily and

Discrete-time batch service 235

geometrically distributed. We provide a recursive method, using the supplementary
variable technique and treating the remaining inter-arrival time as the supplementary
variable, to develop the steady-state probability distributions of the number of customers
in the queue/system. The method is illustrated analytically for geometric and
deterministic inter-arrival time distributions, and the results for geometric distribution
match with Goswami et al. (2006). The distributions of the number of customers in the
queue/system at pre-arrival epochs and at arbitrary epochs, as well as the outside
observers distributions are established.
The rest of this paper is organised as follows. In Section 2, we review the related
work. Section 3 presents the description of the queueing model and provides a recursive
method using the supplementary variables technique, to obtain the steady-state
probability distributions of the number of customers in the queue. We illustrate a
recursive method by presenting simple examples for geometric and deterministic inter-
arrival time distributions. Section 4 presents the outside observers distribution. Section 5
discusses various performance measures and some special cases of our system. Section 6
contains computational results to demonstrate the effectiveness of the model parameters.
Section 7 concludes our paper.
2 Review of related work
Batch-service queues have numerous potential applications in the areas of production
systems, transportation systems, loading and unloading of cargoes at a seaport, traffic
signal systems, computer networks and telecommunication systems where the processor
processes packets in batch. In such batch-service systems, jobs arriving one at a time
must wait in the queue until a sufficient number of jobs get accumulated. There are many
instances where the services are carried out in batches to increase the service rate.
Batch-service queues have been discussed extensively over the last several years.
Note that many papers on batch-service queues have mainly concentrated on the
continuous-time models. The first study on batch-service queues was due to Bailey
(1954) in which the solution to the fixed-size batch-service queue with Poisson arrivals
has been discussed. Neuts (1967) proposed the general bulk service rule in which service
initiates only when a certain number of customers in the queue is available. More
extensive studies on batch-service queues are available in Chaudhry and Templeton
(1983) and Medhi (1984, 1991).
Computational aspects of single-server finite-capacity queue with general bulk
service rule where customers arrive according to a Poisson process and service times of
the batches are arbitrarily distributed have been discussed in Chaudhry and Gupta (1999).
The finite buffer continuous-time queues with general arrivals and batch service have
been studied by Laxmi and Gupta (1999). The queue was analysed using both the
supplementary variable and imbedded Markov chain techniques. Chang and Choi (2006)
have analysed a single-server batch arrival batch-service queue with setup times where
customers arrive according to a Poisson process and service times of the batches are
arbitrarily distributed. Batch service with deterministic service times has been studied by
Chaudhry and Templeton (1983). Chang (2006) obtained an explicit expression for the
mean steady-state waiting time and an estimate of the optimal batch size minimising the
mean steady-state waiting time of M/D
N
/1 queue. Increasing convex ordering of queue
length in batch queues has been discussed in Cai and Zhang (2008).


Further, batch service may be with accessible batches (ABs). If a batch being served
does not utilise its full capacity for service, it may remain accessible for customers
arriving during the service time of the batch until its full capacity is attained. The service
time is not changed by inclusion of such joining customers in course of ongoing service.
This has been considered by Gross and Harris (1998), Kleinrock (1975) and Medhi
(1984, 1991). The infinite-buffer queue with accessible and non-accessible batch-service
rule has been studied by Sivasamy (1990), where the arrivals and service times are
exponentially distributed.
Discrete-time single-server finite and infinite queueing models with generally
distributed service times have been studied in Gravey and Hbuterne (1992). Gupta and
Goswami (2002) discussed analytic and computational aspects of Geo/G
a,b
/1/N queue.
Computational study of a discrete-time batch-service queue with variable capacity and
finite waiting space has been discussed in Chaudhry and Chang (2004) and Yi et al.
(2007). Yi et al. (2007) discussed the model of a single-server having variable capacity
which serves the customers only when the number of customers in a system is at least a
certain threshold value. Some analytic computational results for discrete-time batch-
service queues have been reported in Janssen and Leeuwaarden (2005). Algorithmic
analysis of the discrete-time single-server batch arrival batch-service queue has been
studied by Alfa and He (2008), where the arrivals and service times are generally
distributed. Claeys et al. (2008) computed the probability generating function of the delay
in a discrete-time batch-service queueing model with batch arrivals and single-slot
service time.
The finite and infinite-buffers queues with accessible and non-accessible batch-
service rules in discrete-time systems have been studied by Goswami et al. (2006), where
the arrivals and service times are geometrically distributed. A general uncorrelated arrival
process appears to be more appropriate and reasonable than geometrical distribution, as
the memoryless property of the arrival process does not always meet the need of
applications and also it can include the special cases of geometrical, deterministic, etc.
Therefore, the main purpose of this paper is to do both analytic and computational
analysis of the discrete-time GI/Geo
(a,d,b)
/1/N queue.
Discrete-time queueing systems are better suited than their continuous-time
counterparts to evaluate system performance measures in computer and digital
telecommunication networks, because of the clock-driven operation of those systems.
Furthermore, the modelling of discrete-time queues is more involved and quite different
from the analysis used for the corresponding continuous-time queueing models. The
advantage of analysing a discrete-time queue is that one can obtain the continuous-time
results from it as a limiting case but the converse is not true. However from an applied
and a theoretical point of view, both the discrete-and continuous-time queueing models
have importance.
3 The model description
Let us consider a finite buffer GI/Geo
(a,d,b)
/1/N queue where customers (packets) are
served (transmitted) by a single-server in batches of maximum size b with a minimum
threshold value a. However, if the number of customers in the queue is less than the
minimum threshold value a, the server remains idle until the number of customers in the
queue reaches a. If b or more customers are present in the queue at service initiate epoch


then only b of them are taken into service. It is further assumed to allow the late entries to
join a batch in course of ongoing service as long as the number of customers in that batch
is less than d < b (called maximum accessible limit). At every departure epoch, that is,
before initiating service of the next batch, the server may find the system in any one of
the following three cases:
1 0 n a1
2 a n d1
3 n d.
In Case 1, the server cannot initiate service, it remains idle. In Case 2, the server takes the
entire queue for batch service and admits the subsequent arrivals in the batch while the
service is on, till the accessible limit d is reached, and such a batch is called an accessible
batch. In Case 3, it takes min(n; b) customers for the service and does not allow further
arrivals into the batch being served even if the current batch size is not b, that is, when
the batch size is greater than or equal to d, the batch becomes non-accessible for late
arriving customers. The system has finite buffer (queue) capacity of size N (> b), that is,
maximum number of customers allowed in the system at any time is (N + b). The inter-
arrival times {A
n
, n 1} of customers (packets) are independent and identically
distributed (i.i.d.) random variable (r.vs.) with common probability mass function (p.m.f.)
a
i
= P(A
n
= i), i 1, probability generating function (p.g.f.)
1
( ) ,
i
i
i
A z a z
=
=
_
and mean
inter-arrival time
a
= A
(1)
(1) where A
(1)
(1) is the first derivative of A(z) with respect to z
at z = 1. The service times {S
n
, n 1} are independent and geometrically distributed with
common p.m.f.
1
( ) , 0 1, 1,
i
n
P S i n
= = < < > where 1 = and mean service

time 1/
s
u = . The traffic intensity is given by 1/ ( )
a
b u = . In Section 3.1, we discuss
this queue under EAS.
3.1 The GI/Geo
(a,d,b)
/1/N queue with EAS
Let us assume that the time axis is slotted into intervals of equal length with the length of
a slot being unity. Further, let the time axis be marked by 0, 1, 2, , t and assume that
the potential arrivals and departures occur in the time interval (t, t +) and (t , t),
respectively. For the sake of understanding, various time epochs at which events
(arrival/departure) occur are depicted in Figure 1.
Figure 1 Various time epochs in EAS


The state of the system prior to a potential arrival (at t), that is before the beginning of the
slot, is described by the following random variables, namely,
- N
s
(t) = number of customers present in the system including those in service.
- N
q
(t) = number of customers present in the queue not counting those in service.
- U(t) = remaining inter-arrival time for the next arrival.
-
0, if the server is idle or busy with an accessible batch,
( )
1, if the server is busy with a non-accessible batch.
t
Let us define joint probabilities by

( )
, 0
( , ) ( ) , ( ) , ( ) 0 , 0 1, 0,
n s
Q u t P N t n U t u t n d u = = = = s s >
( )
,1
( , ) ( ) , ( ) , ( ) 1 , 0 , 0.
n q
Q u t P N t n U t u t n N u = = = = s s >
In the steady-state, let us define
, ,
( ) lim ( , ), 0,1.
n j n j
t
Q u Q u t j
= =
To obtain the queue length distribution at arbitrary epochs and performance measures of
the system, we develop the difference equations using the remaining inter-arrival time as
the supplementary variable. Observing the state of the system at two consecutive time
epochs t and (t + 1), using definitions and probabilities defined above, we have in the
steady-state the following difference equations for u 1
1 1
0, 0 0,0 ,0 0,1 ,0
1
( 1) ( ) ( ) ( ) (0),
d d
k u k
k a k a
Q u Q u Q u Q u a Q

= =
= + + +
_ _
(1)
,0 ,0 ,1 1,0 1,1
( 1) ( ) ( ) (0) (0), 1 1,
n n n u n u n
Q u Q u Q u a Q a Q n a

= + + + s s (2)
,0 , 0 ,1 1, 0 1,1
( 1) ( ) ( ) (0) (0), 1,
n n n u n u n
Q u Q u Q u a Q a Q a n d

= + + + s s (3)
1
0,1 0,1 ,1 1,0 ,1
1
( 1) ( ) ( ) (0) (0),
b b
k u d u k
k d k d
Q u Q u Q u a Q a Q
= =
= + + +
_ _
(4)
,1 ,1 ,1 1,1 1,1
( 1) ( ) ( ) (0) (0),
1 1,
n n n b u n u n b
Q u Q u Q u a Q a Q
n N b

+ +
= + + +
s s
(5)
( )
,1 ,1 ,1 1,1
1,1 ,1
( 1) ( ) ( ) (0)
(0) (0) ,
N b N b N u N b u
N N
Q u Q u Q u a Q a
Q Q

= + + +
+
(6)
,1 ,1 1,1
( 1) ( ) (0), 1 1,
n n u n
Q u Q u a Q N b n N
= + + s s (7)
( )
,1 ,1 1,1 ,1
( 1) ( ) (0) (0) .
N N u N N
Q u Q u a Q Q
= + + (8)
Let us define the p.g.f. of Q
n,j
(u) by


*
, ,
0
( ) ( ) , | | 1.
u
n j n j
u
Q z Q u z z
=
= s
_
(9)
Let Q
n,0
denotes the probability of n customers in the system when the server is idle or
busy with an AB and let Q
n,1
denotes the probability of n customers in the queue when the
server is busy with a NAB at an arbitrary epoch. They are given by
* *
,0 ,0 ,0 ,1 ,1 ,1
0 0
( ) (1), 0 1, ( ) (1), 0 .
n n n n n n
u u
Q Q u Q n d Q Q u Q n N

= =
= = s s = = s s
_ _
Multiplying (1) to (8) by z
u
and summing over u from 1 to , and using (9), we obtain
1 1
* * *
0,0 ,0 0,1 , 0 0,0
1
1
,0 0,1
( 1) ( ) ( ) ( ) (0) ( ) (0)
(0) (0),
d d
k k
k a k a
d
k
k a
z Q z Q z Q z Q A z Q
Q Q

= =
=
= + +

_ _
_
(10)
* *
,0 ,1 1, 0 1,1 , 0
,1
( 1) ( ) ( ) (0) ( ) (0) ( ) (0)
(0), 1 1,
n n n n n
n
z Q z Q z Q A z Q A z Q
Q n a

= + +
s s
(11)
( )
* *
,0 ,1 1, 0 1,1 , 0
,1
( ) ( ) ( ) (0) ( ) (0) (0)
(0), 1,
n n n n n
n
Q a n d

= + +
s s
(12)
( )
1
* *
0,1 ,1 1, 0 ,1
1
,1 0,1
( ) ( ) (0) ( ) (0) ( )
(0) (0),
b b
k d k
k d k d
b
k
k d
z Q z Q z Q A z Q A z
Q Q

= =
=
= + +

_ _
_
(13)
( )
* *
,1 ,1 1,1 1,1 ,1
,1
( ) ( ) (0) ( ) (0) ( ) (0)
(0), 1 1,
n n b n n b n b
n
Q n N b

+ + +
= + +
s s
(14)
( ) ( )
* *
,1 ,1 1,1 1,1 ,1
,1 ,1
( ) ( ) (0) ( ) (0) (0) ( )
(0) (0),
N b N N b N N
N b N
z Q z Q z Q A z Q Q A z
Q Q

= + + +

(15)
( )
*
,1 1,1 ,1
( )= (0) ( ) (0), 1 1,
n n n
z Q z Q A z Q N b n N
+ s s (16)
( ) ( )
*
,1 1,1 ,1 ,1
( )= (0) (0) ( ) (0).
N N N N
z Q z Q Q A z Q
+ (17)
One important result which is used frequently can be obtained using (10)(17). This is
given below:
Theorem 3.1: The mean number of entrances into the system per unit time equals the
mean arrival rate that is


1
,0 ,1
0 0
1
(0) (0) (say).
d N
n n
a
n n
Q Q
u
= =
+ = =
_ _
(18)
Proof: Adding (10)(17), we get
1 1
* *
,0 ,1 , 0 ,1
0 0 0 0
( ) 1
( ) ( ) (0) (0) .
1
d N d N
n n n n
n n n n
A z
Q z Q z Q Q
z

= = = =

+ = +
`

)
_ _ _ _
Taking the limit as z 1 and using the normalisation condition:
1
, 0 ,1
0 0
1,
d N
n n
n n
Q Q
= =
+ =
_ _
after simplification we get the desired result.
3.1.1 Steady-state distribution at pre-arrival epochs
Let
, 0 ,1
( )
n n
Q Q

represents the probability that there are n customers present in the system
(queue) prior to an arrival epoch of a customer when the server is idle or busy with an
accessible (a non-accessible) batch. To obtain the steady-state distribution of the number
of customers in the queue/system at pre-arrival epochs, we first connect pre-arrival epoch
probabilities
,0
(0 1)
n
Q n d
s s and
,1
(0 )
n
Q n N
s s with the rates Q

n,0
(0) (0 n d 1)
and Q
n,1
(0) (0 n N). These are given by
,
, ,
1
,0 ,1
0 0
(0)
1
(0), 0,1,
(0) (0)
n j
n j n j
d N
n n
n n
Q
Q Q j
Q Q
= =
= = =
+
_ _
(19)
where is given by (18) and
, 0 ,1
( )
n n
Q Q

represents the probability that there are n
customers present in the system (queue) prior to an arrival epoch of a customer when the
server is idle or busy with an accessible (a non-accessible) batch.
Now, we first evaluate Q
n,0
(0) (0 n d1) and Q
n,1
(0) (0 n N) from (11)(17) in
the following manner. Setting z = 1 in (17) and z = in (17) and (16), we finally obtain
,1 ,1,
(0) ,
n n N
Q Q N b n N | = s s (20)
where
( )
( ) ( )
( ) { }
1
, ,
1
, 1, 2, , 1.
n
N n
A
n N
A
n N N N b
A

|
!
(21)
Setting z = in (12)(15), we get


( )
*
1,1 1 ,1 2 ,1
(0) ,
N b N b N N N
Q Q Q | |

= (22)
( )
( )
1,1
*
,1 2 1,1 1,1 1 ,1
(0)
(0) (0) (0),
2, 3,...,1, 0,
n
n N n b n b N n b
Q
Q Q Q Q
A
n N b N b
| |
+
+ + + + +
(
= +

=
(23)
( )
( )
( )
1
0,1 *
1,0 2 ,1 ,1 1 ,1
1
(0)
(0) (0) (0),
b b
d N k k N k
k d k d
Q
Q Q Q Q
A
| |

= =
= +
_ _
(24)
( )
( )
( )
1, 0
*
, 2 1,1 1,1 1 ,1
(0)
(0) (0) (0),
2, 3,..., 1,
n
n o N n n N n
Q
Q Q Q Q
A
n d d a
| |
+
+ +
= +
=
(25)
where
*
,1
( ), , 1,..., ,
i
Q i N N a = appearing in (22)(25) can be obtained from (14) to
(17) in the following manner.
We obtain
*
,1
( ), , 1,...,
i
Q i N N a = by differentiating (14)(17) with respect to z
and setting z = . Differentiating (17) with respect to z, j (= N 1) times and
simplifying, we have
( )
( ) ( )
( )
*( 1) *( )
,1. ,1 ,1
( )
( ) ( )
1
j
j j
N N N
A z
jQ z z Q z Q
A
+ =
(26)
Differentiating (16) with respect to z, j (= n 1) times, we obtain
( )
( )}
{
( )
*( 1) *( )
,1, ,1 ,1
( )
( ) ( ) 1, 2,..., 1.
j
j j
N n n
N n
A z
jQ z z Q z Q n N N N b
A
+ = = +
(27)
Differentiating (15) with respect to z, j (= N b 1) times, we get
( )
( ) ( )
2
*( 1) *( ) *( ) ( )
1,1 ,1 ,1 ,1 ,1
( ) ( ) ( ) (0) ( ).
1
j j j j
N b N N N b N b
jQ z z Q z Q z Q Q A z
A

+ = + +
`

)
(28)
Differentiating (14) with respect to z, j (= n 1) times, we obtain
( ) { }
*( 1) *( ) *( ) ( )
1,1 1,1 ,1 ,1 ,1
( ) ( ) ( ) (0) (0) ( ),
1, 2,..., 2,1,
j j j j
n n b n n n b
jQ z z Q z Q z Q Q A z
n N b N b

+ +
+ = + +
=
(29)
where
*(0) *
,1 ,1
( ) ( ).
i i
Q z Q z = Now substituting z = in (26)(29), we obtain
*
,1
( ), , 1,....,
i
Q i N N a = and given by
( )
( )
( ) ( )
( )
*( 1)
,1, ,1
1
j
j
N N
A
Q Q
j A

(30)


( )
( )
( )} {
( )
*( 1)
,1, ,1
1, 2, , 1,
j
j
N n
N n
A
Q Q n N N N b
j A

= = + ! (31)
( )
( )
( ) ( )
( )
*( )
( ) 2
,1
*( 1)
1,1 ,1 ,1
(0) ,
1
j
j
N
j
N b N N b
Q
A
Q Q Q
j j A

= + +
`

)
(32)
( )
( )
{ }
( )
*( )
( )
,1
*( 1)
1,1 1,1 ,1
(0) (0) ,
1, 2,..., 2,1.
j
j
n b
j
n n b n
Q
A
Q Q Q
j j
n N b N b

+
= + +
=
(33)
Now, substituting z = 1 in (11), we obtain
,0 1, 0 1,1 ,1 1,1
(0) (0) (0) (0) , 2, 3,...,1, 0.
n n n n n
Q Q Q Q Q n a a
+ + +
( = + =

(34)
Setting z = 1 in (14)(16), respectively, then Q
n+1,1
n = 0, 1, , a2, occurred in (34) are
given by
( )
( ) { }
,1 ,1,
1
1 1,
n N
N n
A
Q Q N b n N
A
= + s s (35)
,1
,1 1,1 ,1
(0) (0) ,
N
N b N b N b
Q
Q Q Q

( = +

(36)
,1 ,1 1,1 ,1 1,1 ,1
(0) (0) (0) (0) ,
1, 2,..., 2,1.
n n b n b n b n n
Q Q Q Q Q Q
n N b N b
+ + +
( = + +

=
(37)
It may be noted that to evaluate
, n j
Q
from (19) we do not require the value of Q

N,1
, since
it cancels out in the numerator and denominator of RHS of (19).
3.1.2 Steady-state distribution at arbitrary epochs
To obtain the queue/system length distribution at arbitrary epochs, we develop relations
between distributions of number of customers in the queue/system at pre-arrival and
arbitrary epochs. This is discussed in the following theorem.
Theorem 3.2: The arbitrary epoch probabilities are given by
,1 1,1
,
N N
Q b Q
= (38)
( ) ,1 1,1 ,1
, 1 1,
n n n
Q b Q Q N b n N

= + s s (39)
( ) ,1 ,1 1,1 ,1 1,1
,
N b N N b N b N
Q Q b Q Q Q

= + + (40)
( ) ( ) ,1 ,1 1,1 ,1 1,1 ,1
,
1, 2,...,1,
n n b n n n b n b
Q Q b Q Q Q Q
n N b N b

+ + +
= + +
=
(41)


( ) ( ) 0,1 ,1 1, 0 0,1 1,1 ,1
,
b
k d d b
k d
Q Q b Q Q Q Q

=
= + +
_
(42)
( ) ( ) , 0 ,1 1, 0 , 0 1,1 ,1
, 1.
n n n n n n
Q Q b Q Q Q Q a n d

= + + s s (43)
Proof: Setting z = 1 in (12)(17), dividing both sides by and using (19), we obtain the
result of the theorem.
One may note here that from this Theorem 3.2, we cannot get
1
, 0 0
{ }
a
n
Q
. However,
these can be obtained using the following theorem.
Theorem 3.3: The arbitrary epoch probabilities
1
, 0 0
{ }
a
n
Q
are given by
1 1
*(1) *(1)
0, 0 ,0 0,1 ,0
1
(1) (1) ,
d d
k k
k a k a
Q Q Q Q

= =
= + +
_ _
(44)
*(1)
, 0 1, 0 1,1 ,1
(1) , 1 1,
n n n n
Q Q Q Q n a

= + + s s (45)
where
*(1)
,0
(1) ( 1)
k
Q a k d s s and
*(1)
,1
(1) (0 1)
n
Q n a s s can be obtained from
( )
*(1)
1,1 ,1 ,1 ,1
1
(1) ,
N N N N
Q Q Q Q
(
= +

(46)
( )
*(1)
1,1 ,1 ,1
1
(1) , 1 1,
n n n
Q Q Q N b n N
= + s s (47)
( ) ( ) ,1
*(1) *(1)
1,1 ,1 1,1 ,1 ,1
1
(1) (1) ,
N
N b N b N N N b
Q Q Q Q Q Q

= + + + (48)
( )
*(1) *(1)
1,1 ,1 1,1 ,1 ,1
1
(1) (1) , 1 1,
n n n b n n b
Q Q Q Q Q n N b

+ +
= + + s s (49)
( )
1
*(1) *(1)
1, 0 0,1 ,1 0,1 ,1
1
1
(1) (1) ,
b b
d k k
k d k d
Q Q Q Q Q
= =
= + +
_ _
(50)
( )
*(1) *(1)
1, 0 , 0 1,1 , 0 ,1
1
(1) (1) , 1.
n n n n n
Q Q Q Q Q a n d

= + + s s (51)
Proof: Differentiating (10)(17) with respect to z and setting z = 1, we get the desired
results.
3.2 Algorithm for computing state probabilities
To demonstrate the working schemes of the recursive method, we describe the solution
algorithm for calculating the steady-state probabilities. Given the values of , a, d, b, N
and the p.g.f. expression of the inter-arrival time distribution, namely, A(z), the steps of
the solution algorithm are stated as follows:


Step 1 Set Q
N,1
= 1.
Step 2 Compute |
n
for N b 1 n N using (21).
Step 3 Compute Q
n,1
(0) for n = N, N 1, , N b and Q
Nb,1
(0) from (20).
Step 4 For n = N, N 1, , a, and j (= n 1) times, compute
*( 1)
,1
( )
j
n
Q
from
(30)(33).
Step 5 Compute Q
n,1
(0) for n = N b 1, , 1, 0 from (22) and (23), respectively.
Step 6 Compute Q
n,0
(0) for n = d 1, , 0 from (24), (25) and (34), respectively.
Step 7 Compute
, n j
Q
from (19).
Step 8 Compute Q
n,1
for 0 n N and Q
n,0
for a n d 1 using (38)(43).
Step 9 Compute
*(1)
,1
(1)
n
Q for 0 j a 1 and
*(1)
, 0
(1)
n
Q for a n d 1, from (46)(51).
Step 10 Compute Q
n,0
for 0 n d 1 from (44) and (45).
3.3 Simple examples
We use the solution algorithm to illustrate a recursive method. We discuss two simple
examples for two different inter-arrival time distributions such as geometric and
deterministic, respectively.
Example 1: For Geo/Geo
(a,d,b)
/1/N queueing system, we set the mean inter-arrival time
a
= 1/, where is the inter-arrival time. Assume that a = 2, d = 4, b = 5 and N = 7. In
this case, we have
( ) .
1
z
A z
z
Step 1 Set Q
7,1
= 1.
Step 2 For 1 n 7, compute |
n
using (21).
Using (21), we have
6
7
1
, , 1 6.
n
n
n

| |

| |
= = s s
|
|
\ .
Step 3 For 2 n 7, compute Q
n,1
(0) using (20).
From (20), we obtain
,1 7,1,
(0) for 2 7.
n n
Q Q n | = s s
Step 4 For n = 7, 6, , 2, compute
*( )
,1
( )
j
n
Q using (30)(33).
From (30)(33), we finally get


( )
( )
( )
( )
( )
( )( )
( )
*( )
7,1 7,1
1
7
*( )
7,1 ,1
2
5
*( )
7,1 2,1
2
,
1
1
, 3 6,
1
1
1 .
1 1
j
j
j
n
j
j
n
j
j
j
j
Q Q
Q Q n
Q j j Q
j
+
+
=
| |
= s s
|
\ .

| |
= + +
` |
\ . +
)
Step 5 For n = 1, 0, compute Q
n,1
(0) using (22) and (23), respectively.
From (22) and (23), it follows that
( )
( )
( )
5
*
1,1 1 7,1 5 7,1 7,1
1,1 *
0,1 5 6,1 6,1 6 5,1
6
7,1
2 2
1 1
(0) ,
(0)
(0) (0) (0)
1 1
.
Q Q Q Q
Q
Q Q Q Q
A
Q

| |

| |

(
| |
( ( = =
|

(
\ .

(
= +

(
| |
( =
|
(
\ .

Step 6 For n = 3, 2, 1, 0, compute Q
n,0
(0) using (24), (25) and (34).
Using (24), (25) and (34), it follows that
6
3, 0 3 7,1 3
2 2
2
2
2, 0 2 7,1 2 3
3
4
2 2
1,0 1 7,1 1 2
3 3
1 1 2 1
, where 1 , (0)
1 1
(0) , where ,
1 1
(0) , where
Q Q
Q Q
Q Q

e e

e e e

e e e

(
| | +
( = = +
` |
( \ . )

(
| |
( = =
|
(
\ .

| |
= = +
|
\ .
5 6
0,0 0 7,1 0 1
2 2
,
1 1 1 1
(0) , where 1 . Q Q

e e e

(
(
(
(
| | | |
(
= = + + + +
` | |
(
\ . \ .
)
Step 7 From (19), compute
,
,
n j
Q
, 0 , 0 ,1 ,1
(0) / , 0 3, and (0) / , 0 7.
n n n n
Q Q n Q Q n

= s s = s s
Step 8 Compute Q
n,1
for 0 n 7 using (38)(42) and Q
n,0
for n = 2, 3 using (43).
Using (38)(42), we get


6
,1 7,1
1
, 3 6,
n
n
Q Q n

| |
= s s
|
\ .
4
2,1 7,1
1
, Q Q

(
| |
( =
|
(
\ .

5
1,1 7,1
1
, Q Q

(
| |
( =
|
(
\ .

5 2
3
0,1 7,1
2
1 1 1 1
. Q Q
e

(
| | | | | | | | | | | |
(
= + + + +
| ` | | | | |
(
\ . \ . \ . \ . \ . \ .
)
Using (43), we get
( )
3
3, 0 2 3 7,1
2
1
, Q Q

e e

=
(
| |
( +
|
(
\ .

( )
4
2, 0 1 2 7,1
2 2
1 1
. Q Q

e e

(
| | | | +
( = +
| |
(
\ . \ .

Step 9 Compute
*(1)
,1
(1)
n
Q for n = 1, 0, and
*(1)
,0
(1)
n
Q and for n = 3, 2 from (46)(51).
It yields from (46)(51) that
( ) ( )
( ) ( )
( ) ( )
( ) ( )
*(1)
5,1 0,1 6,1 1,1 1,1
*(1)
4,1 3,1 3, 0 5,1 4,1 0,1 0,1
*(1)
2,1 2, 0 3,1 3, 0 3, 0
*(1)
7,1 6,1 1,1 1, 0 7,1 2,1 2, 0 2, 0
1
(1) ,
1
(1) ,
1
(1) ,
1
(1) .
Q Q Q Q Q
Q Q Q Q Q Q Q
Q Q Q Q Q
Q Q Q Q Q Q Q Q

(
= + +

(
= + + + +

(
= + +

(
= + + + + +

Step 10 Compute Q
1,0
and Q
0,0
using (44) and (45).
Using (44) and (45), it follows that
( )
( )
*(1)
1, 0 0,1 0, 0 1,1
5 2
0
1, 0 7,1
2
4 3 5 3
0, 0 7,1 6,1 ,1 , 0 7,1 ,1 0,1 , 0
1 1 2 2
(1) ,
1 1 1
1 ,
.
n n n n
n n n n
Q Q Q Q
Q Q
Q Q Q Q Q Q Q Q Q
e

= = = =
= + +
(
+ | | | |
(
= + +
` ` | |
(
\ . \ . )
)
| | | |
= + + + + + + | |
| |
\ . \ .
_ _ _ _


The above results are in accordance with the expressions given in Goswami et al. (2006).
Example 2: For D/Geo
a,d,b
/1/N queueing system, we set the mean inter-arrival time
a
= k. Assume that a = 2, d = 4, b = 5 and N = 7. In this case, we have
( ) ( ) ( ) , ,1 1
k k k
A z z A A = = =
Step 1 Set Q
7,1
= 1.
Step 2 For 1 n 7, compute |
n
using (21).
Using (21) we have
( )
( )
7
6
, , 1 6.
1
k
n
n k
k
n

| |

= = s s
Step 3 For 2 n 7, compute Q

n,1
(0) using (20).
From (20) we have
,1 7,1
(0) , for 2 7.
n n
Q Q n | = s s
Step 4 For n = 2, 3, , 7, compute ( )
*( )
,1
, 1 7
j
n
Q n s s using (30)(33).
( )
( )
( )
( )
( )
( )
1
*( )
7,1 7,1
1
*( )
7,1 ,1
7
2 2 1
7,1
*( )
2,1
4
!
,
( 1) 1 ( 1)!
!
, 3 6,
( 1) ( 1)!
( 1)! 1
.
1
1 1 ( 2)!
k j
j
k
k j
j
n
n
k
k j k
j
k k k k
k
Q Q
j k j
k
Q Q n
j k j
Q
k k
Q
j
k j

=
+
= s s
+
(

+
(
= +
`
( +

)

Step 5 For n = 1, 0, compute Q
n,1
(0) using (22) and (23), respectively.
From (22) and (23), it follows that
( )
( )
( )
( )
( )
( )
1
1,1 7,1
4 1
1
2
0,1 7,1
4 2 2 1
1
(0) ,
1
1
(0) .
1
k
k k
k
k
k k k
k
k
Q Q
k k
Q Q

+ +
(
(
=
(
(

(
(
=
`
(

(
)
Step 6 For n = 3, 2, 1, 0, compute Q
n,0
(0) using (24), (25) and (34).
Using (24), (25) and (34), it follows that


( )
( )
( )
( )
1
2 2
3,0 3 7,1, 3
3 1 4 2 2 3 2
2
2, 0 2 7,1, 2 3
3 2
3
3 2
1, 0 1 7,1, 1 2
4 2
0, 0
1 2
(0) where ,
1
1
(0) where ,
( 1) 1
(0) where ,
2 1
(0)
k
k k k k
k
k k
k
k k k
k k k
Q Q
k
Q Q
k k k
Q Q
Q

e e

e e e

e e e

+ + +
+
+
| |
|
= =
`
|
|
\ . )
(
= =
(

(
(
= = +
(

=
( )
( )
( )
( )
2
1
0 7,1, 0 1
2 1 4 2
1 1
1
where .
1
k k
k
k k k
k
k
k
Q

e e e

+ +
(

(
= +
`
(

(
)
Step 7 From (19), compute
,
,
n j
Q
, 0 , 0 ,1 ,1
(0) / , 0 3, and (0) / , 0 7.
n n n n
Q Q n Q Q n

= s s = s s
Step 8 Compute Q
n,1
for 0 n 7 using (38)(42) and Q
n,0,
for n = 2, 3 using (43).
Using (38)(42), we get
( )
( ) ( )
( )
( ) ( )
2
5 1
,1 7,1 2,1 7,1
7 5
1
1,1 7,1
1 2 4
1 2
1
0,1
4 3 4
1 1
1
, 3 6, ,
1
1 1 1
,
1
1 1
1 1
1
k k k
k
n
n k k
k
k k k
k k k k
k k
k k k
k k k k
k
Q Q n Q Q
k k
Q Q
k k k
Q

2
(
+
(
= s s =
(
(

(

= + ( `
( )
+
| || |

= + +
| |
| |
\ .\ .
7,1
3 1
2
.
k
k
Q
+
(
(
(

Using (43) we get
( )
( ) ( )
( )
( )
3, 0 2 3 7,1
3 1
2 1 3 5 1 6 1
2, 0 1 2 7,1
6
1 1
,
1 1 2 1
.
1
k
k k
k k k k k
k k
Q Q
k k
Q Q

e e

e e

+

( | |
= + ( |
|
( \ .
(
+ +
(
= +
(

Step 9 For n = 1, 0, compute
*(1)
,1
(1)
n
Q and for n = 3, 2, compute
*(1)
, 0
(1)
n
Q from (46)(51).


( ) ( )
( ) ( )
( ) ( )
( ) ( )
*(1)
5,1 0,1 6,1 1,1 1,1
*(1)
4,1 3,1 3, 0 5,1 4,1 0,1 0,1
*(1)
2,1 2, 0 3,1 3, 0 3,0
*(1)
7,1 6,1 1,1 1, 0 7,1 2,1 2, 0 2,0
1
(1) ,
1
(1) ,
1
(1) ,
1
(1) .
Q Q Q Q Q
Q Q Q Q Q Q Q
Q Q Q Q Q
Q Q Q Q Q Q Q Q

(
= + +

(
= + + + +

(
= + +

(
= + + + + +

Step 10 Compute Q
1,0
and Q
0,0
using (44) and (45).
Using (44) and (45), it follows that
( )
1 1 2 1
1, 0 0 7,1
2 4 2 1
4 3 5 3
0, 0 7,1 6,1 ,1 ,0 7,1 ,1 0,1 , 0
1 1 2 2
1 (1 ) (1 ) 1
,
1
.
k k k
k k k k
n n n n
n n n n
k k k k k
Q k Q
Q Q Q Q Q Q Q Q Q

e

+ +
+ +

= = = =
( | | | | + +
( = + + | |
| |
(
\ .\ .
| | | |
= + + + + + + | |
| |
\ . \ .
_ _ _ _
4 Outside observers distribution
Since an outside observers distribution plays an important role in evaluating
performance measures, its discussion seems important too. For example, in order to use
Littles rule to get the average waiting time in the queue/system, the average number of
customers in the queue/system at the outside observers observation epoch is needed.
Since an outside observers observation epoch falls in a time interval after a potential
arrival and before a potential batch departure, the probability
0 0
, 0 ,1
( )
n n
Q Q that the outside
observer sees n customers in the system (queue) with an accessible (a non-accessible)
batch when the server is idle (busy) can be obtained by using the relation
1
0, 0 0,0 , 0 0,1
, 0 , 0 ,1
, 0 , 0 ,1
0,1 0,1 ,1
,1 ,1 1
,1 ,1
,
, 1 1,
, 1,
,
, 1 ,
, 1 .
d
k
k a
n n n
n n n
b
k
k d
n n n b
n n
Q Q Q Q
Q Q Q n a
Q Q Q a n d
Q Q Q
Q Q Q n N b
Q Q N b n N
o o o
o o
o o
o o
o o
o

=
=
+ +
= + +
= + s s
= + s s
= +
= + s s
= + s s
_
_
The above relations have been obtained by considering arbitrary and outside observers
observation epochs in Figure 1. Now, solving for
, 0 n
Q
o
and
,1 n
Q
o
, we obtain


,1
,1
, 1 ,
n
n
Q
Q N b n N
o
= + s s (52)
,1 ,1 ,1
1
, , 1, ,1,
n n n b
Q Q Q n N b N b
o o
+
(
= =

! (53)
0,1 0,1 ,1
1
,
b
k
k d
Q Q Q
o o
=
(
= (
(

_
(54)
, 0 , 0 ,1
1
, 1,
n n n
Q Q Q a n d
o o
(
= s s

(55)
, 0 , 0 ,1
, 1 1,
n n n
Q Q Q n a
o o
= s s (56)
1
0, 0 0, 0 , 0 0,1
.
d
k
k a
Q Q Q Q
o o o
=
(
= + (
(

_
(57)
Now,
, 0 n
Q
o
and
,1 n
Q
o
can be computed by recursion using Q
n,0
and Q
n,1.
5 Performance measures and special cases
5.1 Performance measures
Performance measures are important features of queueing systems as they reflect the
efficiency of the queueing system under consideration. Once the state probabilities at pre-
arrival, arbitrary and outside observers observation epochs are known, we can evaluate
various performance measures such as the average number of customers in the queue at
an arbitrary epoch (L
q
), average waiting time in the queue (W
q
) and the PBL are given by
1
, 0 ,1 ,1
1 1
, PBL .
a N
q n n N
n n
L nQ nQ Q
= =
= + =
_ _
It may be noted that to obtain average waiting time in the queue (W
q
) of a customer, we
use Littles rule. However, to use this rule, we need to evaluate average queue length at
outside observers observation epoch which is denoted by
q
L
o
and is given by
1
0
, 0 ,1
1 1
.
a N
q n n
n n
L nQ nQ
o o
= =
= +
_ _
Therefore,
'
/
q q
W L
o
= where
,1
(1 )
N
Q
' = being the effective arrival rate.

5.2 Special cases
In this section, some special cases are deduced from our model by taking specific values
for the parameters a, d and b.


Case 1: a = d = b = 1, that is, the batch size is one. The model reduces to GI/Geo/1/N
queue formulated by Chaudhry and Gupta (1999).
Let us define Q
0
= Q
0,0
and Q
n
= Q
n1,1
, 1 n N + 1, where Q
n
= Pr{number in system
is n}.
Then from (38)(43), we obtain
1 ,
1
, 1, , 1.
=
= + = !
N N
n n n
Q Q
Q Q Q n N N
Using normalisation condition, we get
( ) 0 1
1 1 .
o N
Q Q Q

+
= +
It is to be noted that (39) and (43) will not occur in this case. Then from equations (52)
(57), we obtain outside observers observation epochs as
1 1
1
0 0 1
1
,
1
, , 1, , 2,1,
.
N N
n n n
Q Q
Q Q Q n N N
Q Q Q
o
o o
o o
+ +
+
=
(
= =

=
!
It is to be noted that (55) and (56) will not occur in this case. Finally, the average waiting
time in the queue which is equivalent to Chaudhry and Gupta (1999) is given by
/ ,
q q
W L
o
' = where
1 1 1
and (1 )
N
q n n N
L nQ Q
o o

= + +
' = _ = being the effective arrival rate.
Case 2: a = d, that is, the server is non-accessible. The model reduces to standard
GI/Geo
(a,b)
/1 = N queue. Substituting a = d in Equations (20), (22)(24) and (34),
(38)(42) and (44)(45), (52)(54) and (56)(57), the steady-state distributions at pre-
arrival, arbitrary and outside observers observation epochs can be deduced. It is to be
noted that (25), (43) and (55) will not occur in this case. The result of this model is not
available in the literature.
6 Computational results
In this section, we present some computational results in the form of tables and graphs, to
demonstrate the effectiveness of the model parameters. The results for the geometric
inter-arrival time distributions at pre-arrival, arbitrary and outside observers observation
epochs were obtained and are presented in Table 1, taking the following input parameters
= 0.4, = 0.2, a = 2, d = 4, b = 6, N = 10 and = 0.5, = 0.1, a = 5, d = 7, b = 10,
N = 15. The results for the deterministic and the arbitrary inter-arrival time distributions
at pre-arrival, arbitrary and outside observers observation epochs are presented in
Table 2, taking = 0.5, = 0.25, a = 2, d = 5, b = 7, N = 15 and = 0.049261, = 0.018,
a = 5, d = 7, b = 10, N = 15, respectively. Various performance measures such as the
blocking probabilities, the average queue-length at outside observers observation epoch
and the average waiting times in the queue using Littles rule are given at the bottom of


Tables 1 and 2. It can be seen from Table 1 that, for the geometrical inter-arrival times,
the queue length distributions at pre-arrival and arbitrary epoch probabilities are the same
due to the memoryless property of Bernoulli arrivals. We have matched our results with
Chaudhry and Gupta (1996) by taking a = d = b = 1. Further, the results obtained have
been matched with Goswami et al. (2006) by taking geometric inter-arrival time
distribution.
Table 1 Distributions of system length at various epochs for Geo/Geo
(a,d,b)
/1/N queue
= 0.4, = 0.2, a = 2
d = 4, b = 6, N=10
= 0.5, = 0.1, a = 5
d = 7, b = 10, N=15
(n, j) , n j
Q
, n j
Q
, n j
Q
o
, n j
Q
, n j
Q
, n j
Q
o
0,0 0.238805 0.238805 0.086795 0.031018 0.031018 0.025049
1,0 0.276542 0.276542 0.256775 0.051614 0.051614 0.038306
2,0 0.170385 0.170385 0.250286 0.069069 0.069069 0.057792
3,0 0.104978 0.104978 0.154863 0.083844 0.083844 0.074299
4,0 0.096336 0.096336 0.088267
5,0 0.086047 0.086047 0.091192
6,0 0.076844 0.076844 0.081445
0,1 0.076741 0.076741 0.088036 0.078870 0.078870 0.077857
1,1 0.048670 0.048670 0.059898 0.066892 0.066892 0.072881
2,1 0.030839 0.030839 0.037971 0.056662 0.056662 0.061777
3,1 0.019525 0.019525 0.024051 0.047941 0.047941 0.052301
4,1 0.012890 0.012890 0.015544 0.040518 0.040518 0.044229
5,1 0.007933 0.007933 0.009916 0.038972 0.038972 0.039745
6,1 0.004882 0.004882 0.006102 0.031886 0.031886 0.035429
7,1 0.003004 0.003004 0.003755 0.026089 0.026089 0.028988
8,1 0.001849 0.001849 0.002311 0.021345 0.021345 0.023717
9,1 0.001138 0.001138 0.001422 0.017464 0.017464 0.019405
10,1 0.001820 0.001820 0.002275 0.014289 0.014289 0.015877
11,1 0.011691 0.011691 0.012990
12,1 0.009565 0.009565 0.010628
13,1 0.007826 0.007826 0.008696
14,1 0.006403 0.006403 0.007115
15,1 0.028815 0.028815 0.032016
sum 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000
L
q
= 0.693459, W
q
= 1.736809,
PBL = 0.00182
Lq = 3.360797, Wq = 6.921021,
PBL = 0.028815


Table 2 Distributions of system length at various epochs for D/Geo
(a, d ,b)
/1/N and GI/Geo
(a, d, b)
/1/N queue with a
10
= 0.5, a
15
= 0.1, a
24
= 0.2, a
45
= 0.2
D/Geo
(a,d,b)
/1/N GI/Geo
(a,d,b)
/1/N
= 0.5, = 0.25, a = 2
d = 5, b = 7, N=15
= 0.049261, = 0.018, a = 5
d = 7, b = 10, N=15
(n, j) , n j
Q
, n j
Q
, n j
Q
o
, n j
Q
, n j
Q
, n j
Q
o
0,0 0.292197 0.197521 0.049769 0.094311 0.073792 0.069049
1,0 0.309089 0.302859 0.296067 0.112371 0.107618 0.106766
2,0 0.173884 0.218289 0.285892 0.125352 0.121936 0.121323
3,0 0.097822 0.122916 0.160948 0.134681 0.132226 0.131786
4,0 0.055032 0.069213 0.090608 0.141386 0.139622 0.139305
5,0 0.104182 0.112842 0.114675
6,0 0.076701 0.083104 0.084457
0,1 0.030963 0.041528 0.053563 0.059372 0.063500 0.064353
1,1 0.017644 0.020509 0.027168 0.042680 0.046537 0.047359
2,1 0.010056 0.011688 0.015482 0.030677 0.033450 0.034042
3,1 0.005730 0.006660 0.008823 0.022047 0.024041 0.024466
4,1 0.003264 0.003795 0.005027 0.015843 0.017276 0.017582
5,1 0.001860 0.002162 0.002864 0.011685 0.012654 0.012859
6,1 0.001059 0.001231 0.001631 0.008305 0.009083 0.009250
7,1 0.000603 0.000701 0.000929 0.005903 0.006456 0.006574
8,1 0.00349 0.000404 0.000531 0.004195 0.004589 0.004673
9,1 0.000196 0.000229 0.000305 0.002982 0.003261 0.003321
10,1 0.000110 0.000129 0.000172 0.002119 0.002318 0.002360
11,1 0.000062 0.000072 0.000097 0.001506 0.001647 0.001678
12,1 0.000035 0.000041 0.000054 0.001071 0.001171 0.001192
13,1 0.000020 0.000023 0.000031 0.000761 0.000832 0.000848
14,1 0.000011 0.000013 0.000017 0.000541 0.000592 0.000602
15,1 0.000014 0.000017 0.000022 0.001329 0.001454 0.001480
Sum 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000
Lq = 0.442784, Wq = 0.885581,
PBL = 0.000014
Lq = 1.892262, Wq = 38.464045
PBL = 0.001329
Figure 2 compares the effect of buffer size (N) on the probability of blocking (PBL) for
various inter-arrival time distributions with the following parameters: = 0.05,
= 0.018, a = 5, d = 7 and b = 10. As an effect of buffer size on the probability of
blocking, we observed that probability of blocking decreases as buffer size increases.
However, we further noted that the improving effect of buffer size on probability of
blocking is magnified as inter-arrival time variability increases. This is because the effect
of assigning buffer capacity is greater in longer lines in which the frequency of coupling
events is relatively higher. With the same reasoning, the extra buffer capacity yields a
reduction in probability of blocking in the high inter-arrival time variability case as


compared to the low inter-arrival time variability case. It can be seen that the geometrical
distribution gives the highest value for the PBL and the deterministic distribution gives
the smallest value. This is intuitively clear since the PBL of the inter-arrival times is
higher for the geometric distribution. This observation can be understood from the fact
that the higher the buffer contents, more customers get lost for a given amount of buffer
space. We further observe that for all distributions considered here, the PBL decreases as
buffer size N increases and finally reaches to its minimum value zero as it should be. This
is due to the fact that the model becomes an infinite-buffer queue. Hence, we can setup an
admissible buffer size in the system in order to have lower PBL.
Figure 3 depicts the effect of a on the average waiting time (W
q
) when inter-arrival
time is geometric with = 0.05, = 0.018, b = 40 and N = 50. We varied the AB size d.
It can be observed that, for fixed AB size d, W
q
monotonically increases with the increase
of minimum threshold value a. Further, with fixed minimum threshold value a, the
average waiting time decreases when the AB size d increases. For large minimum
threshold value a the increase is almost linear. The effect of minimum threshold value a
on average waiting time in the queue does not terminate as minimum threshold value a
increases. The above findings suggest that minimum threshold value a should not be
increased beyond a certain limit. The minimum threshold value a and the AB size d in the
system can be carefully setup to minimise average waiting time in the queue.
Figure 2 Effect of N on PBL


Figure 3 Effect of a on W
q
for different values of d
7 Conclusion
In this paper, we have carried out an analysis of a discrete-time single-server finite-buffer
renewal input batch-service queue with accessible or NABs that have potential
applications in modelling computer and telecommunication systems, computer networks,
etc. We have developed a recursive method, using the supplementary variable technique
and treating the remaining inter-arrival time as the supplementary variable, to find the
steady-state queue/system length distributions at pre-arrival, arbitrary and outside
observers observation epochs under the EAS. The recursive method is powerful and easy
to implement. We have illustrated a recursive method by presenting two simple examples
for geometrical and deterministic inter-arrival time distributions. Various performance
measures such as the PBL, average queue-length at outside observers observation epoch
and analysis of average waiting time in the queue have been carried out. The results for
the LAS-DA model can also be obtained in a similar manner. The techniques used in this
paper can be applied to analyse more complex models such as DMAP/Geo
(a,d,b)
/1/N and
GI/Geo
(a,d,b)
/1/N queues which are left for future investigations.


Acknowledgements
The authors are thankful to the referees for their valuable comments and suggestions
which have helped in improving the quality of the presentation of this paper.
References
Alfa, A.S. and He, Q.M. (2008) Algorithmic analysis of discrete time GI
X
/G
Y
/1 queueing system,
Performance Evaluation, Vol. 65, No. 9, pp.623640.
Bailey, N.T.J. (1954) On queueing process with bulk service, Journal of the Royal Statistical
Society, Series B (Statistical Methodology), Vol. 16, pp.8097.
Bruneel, H. and Kim, B.G. (1993) Discrete-Time Models for Communication Systems Including
ATM. Boston: Kluwer Academic Publishers.
Cai, N. and Zheng, Y. (2008) Increasing convex ordering of queue length in bulk queues,
Operations Research Letters, Vol. 36, No. 1, pp.123126.
Chang, W. (2006) The optimal batch size of M/D
N
/1 queue, Int. J. Operational Research, Vol. 1,
No. 4, pp.396409.
Chang, S.H. and Choi, D.W. (2006) Modeling and performance analysis of a finite-buffer queue
with batch arrivals, batch services, and setup times: the M
X
/G
Y
/1/K+B queue with setup times,
INFORMS Journal on Computing, Vol. 18, No. 2, pp.218228.
Chaudhry, M.L. and Chang, S.H. (2004) Analysis of the discrete-time bulk-service queue
Geo/G
Y
/1/N+B, Operations Research Letters, Vol. 32, No. 4, pp.355363.
Chaudhry, M.L. and Gupta, U.C. (1996) Performance analysis of the discrete-time GI/Geom/1/N
queue, Journal of Applied Probability, Vol. 33, No. 1, pp.239255.
Chaudhry, M.L. and Gupta, U.C. (1999) Modelling and analysis of M/G
a,b
/1/N queue a simple
alternative approach, Queueing Systems, Vol. 31, No. 12, pp.95100.
Chaudhry, M.L. and Templeton, J.G.C. (1983) A First Course in Bulk Queues. New York: Wiley.
Claeys, D., Laevens, K., Walraevens, J. and Bruneel, H. (2008) Delay in a discrete-time queueing
model with batch arrivals and batch services, Proceedings of the Information Technology:
New Generations, pp.10401045.
Goswami, V., Mohanty, J.R. and Samanta, S.K. (2006) Discrete-time bulk-service queues with
accessible and non-accessible batches, Applied Mathematics and Computation, Vol. 182,
No. 1, pp.898906.
Gravey, A. and Hbuterne, G. (1992) Simultaneity in discrete time single server queues with
Bernoulli inputs, Performance Evaluation, Vol. 14, No. 2, pp.123131.
Gross, D. and Harris, C.M. (1998) Fundamentals of Queueing Theory (3rd ed.). New York: John
Wiley & Sons.
Gupta, U.C. and Goswami, V. (2002) Performance analysis of finite buffer discrete-time queue
with bulk service, Computers and Operations Research, Vol. 29, No. 10, pp.13311341.
Hunter, J.J. (1983) Mathematical Techniques of Applied Probability, Volume II, Discrete-Time
Models: Techniques and Applications. New York: Academic Press.
Janssen, A.J.E.M. and Van Leeuwaarden, J.S.H. (2005) Analytic computation schemes for the
discrete-time bulk service queue, Queueing Systems, Vol. 50, No. 23, pp.141163.
Kleinrock, L. (1975) Queueing Systems, Vol. I, New York: John Wiley & Sons.
Laxmi, P.V. and Gupta, U.C. (1999) On the finite-buffer bulk-service queue with general
independent arrivals: GI/M
[b]
/1/N, Operations Research Letters, Vol. 25, No. 5, pp.241245.
Medhi, J. (1984) Recent Developments in Bulk Queueing Models. New Delhi, India: Wiley Eastern
Limited.
Medhi, J. (1991) Stochastic Models in Queueing Theory. New York: Academic Press.


Neuts, M.F. (1967) A general class of bulk queues with general input, Annals of Mathematical
Statistics, Vol. 38, No. 3, pp.759770.
Sivasamy, R. (1990) A bulk service queue with accessible and non-accessible batches, Opsearch
Journal of the Operational Research Society of India, Vol. 27, No. 1, pp.4654.
Takagi, H. (1993) Queueing Analysis A Foundation of Performance Evaluation: Volume 3,
Discrete-Time Systems, Amsterdam: Elsevier.
Woodward, M.E. (1994) Communication and Computer Networks: Modelling with Discrete-Time
Queues. London: Pentech Press.
Yi, X.W., Kim, N.K., Yoon, B.K. and Chae, K.C. (2007) Analysis of the queue-length distribution
for the discrete-time batch-service Geo/G
(a,Y)
/1/K queue, European Journal of Operational
Research, Vol. 181, No. 2, pp.787792.

Discrete Time Queue

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Discrete Time Queue

Transféré par

Droits d'auteur :

Formats disponibles

Int. J. Mathematics in Operational Research, Vol. 2, No.

= = < < > where 1 = and mean service

Let us define joint probabilities by

s s with the rates Q

from (19) we do not require the value of Q

Step 3 For 2 n 7, compute Q

' = being the effective arrival rate.

Vous aimerez peut-être aussi