BLOCKING TIME IN MULTI-CLASS OBS NODES
the blocking time for the horizon-based multi-class OBS nodes and obtain the Laplace–Stieltjes
transforms (LSTs) of the blocking time for horizon-based multi-class OBS nodes, from which the
n-order moments of the blocking time can be derived.
Further, we study the impacts of the offset time and the arrival density on the blocking time, in
which some interesting observations are obtained. For example, an arrival density of a low priority
burst has no influence on the average blocking time of a higher priority burst. The offset time has
a stronger impact on the lower priority burst than that on the higher priority burst. We believe that
these observations are important in performance evaluation and the design of OBS networks.
We organize the presentation of the current paper as follows. Section 3 presents the analytical
model for the OBS nodes for later analyses. In Section 4, we study the blocking time and obtain its
LSTs. In Section 5, we show a numerical example to discuss the impact of the parameters on the
blocking time and also to verify our theoretical expositions. Finally, Section 6 concludes the whole
paper.
3. MULTILAYER STOCHASTIC FLUID MODEL FOR THE OPTICAL BURST SWITCHING
The current paper will follow the model in [16] but with significant extensions. In order to bring the
paper to be self-contained, we first give an introduction of the model, and the readers can also refer
to [20]. Throughout the paper, we write A
ij
as the block matrix of A, and let its .i; j /-th element
be ŒA
ij
. We also denote I, 0 and 1 by the unit matrix, zero matrix and the unit column vector with
appropriate dimensions, respectively. We now work on a multi-class OBS node in an OBS network,
which uses the horizon reservation scheme. We assume that the sources generate K classes of bursts
(or BCPs), and we label them from burst-1 to burst-K.Burst-k, 1 6 k 6 K, arrives with an arrival
density
k
and follows a Poisson distribution. The Poisson distribution represents the probability of
the number of bursts occurring in a fixed time duration if these bursts occur with a known arrival
density and independently of the time since the last burst. Let X
k
be the number of burst-k arriving
in time t, then the probability mass function of burst-k is given by
P.X
k
D m/ D
.
k
t/
m
e
k
t
mŠ
:
This simple yet widely adopted traffic model allows tractable analysis and provides insights for
further study.
Let ı
k
denote the offset time of burst-k, and we assume the class of the burst with larger identifier
has higher priority. This means that if j<k,thenı
j
<ı
k
.LetL
k
be the length of burst-k,
and it has a phase-type distribution PH.˛
k
; Q
k
/: Let q
k
DQ
k
1 and denote its transient state
space by
M
k
. Without loss of generality, we let the cardinality of M
k
be n for all k and denote
M
k
D¹m
k1
;m
k2
; ;m
kn
º and S
1
D M
1
[[M
K
.
Let H.t/ be the channel horizon at time t. When some BCP-k (burst-k) arrives at this time epoch
t, this burst-k is blocked immediately if the channel horizon H.t/ > ı
k
, while it is admitted imme-
diately after its arrival if H.t/ 6 ı
k
. After the burst-k is admitted, the channel horizon becomes
H.tC/ D H.t/ C L
k
C ı
k
, and the channel is occupied for the incoming burst-v (v 6 k) imme-
diately. When BCP-k (burst-k) is blocked, the time duration from the time epoch at which BCP-k
(burst-k) arrives to the time epoch after which the channel is available again for the potential burst-
k is referred to as the blocking time of burst-k [20]. Given the level of horizon is w when burst-k
arrives, we write the blocking time of burst-k as B
k
.w/.
To illustrate the operation of the multi-class OBS node, a sample path of the channel horizon
process is described in Figure 1(a) as an example when K D 3, the first packet (burst-1) arrives at
time epoch t D 0, and it is accepted because the channel is unused and available. When the second
packet (burst-2) arrives at this time epoch, the channel horizon is less than ı
2
, that is, the channel is
available for transmission of the second packet when it arrives. However, at the time point that the
third packet (burst-1) arrives, the channel horizon is larger than ı
1
, which means that the channel is
still occupied by the second packet (burst-2) and that the burst-1 is blocked as soon as it arrives. The
other packets can be analyzed similarly.
Copyright © 2016 John Wiley & Sons, Ltd. Int. J. Commun. Syst. (2016)
DOI: 10.1002/dac