Monir Paper 04
Monir Paper 04
Monir Paper 04
1 JANUARY 2013
127
PAPER
SUMMARY
This paper proposes a dynamic bandwidth allocation algorithm that improves the network performance and bandwidth sharing
eciency in the upstream channels of a hybrid passive optical network
(PON) that combines a fiber-to-the-home (FTTH) access network and wireless sensor networks (WSNs). The algorithm is called the adaptive limited dynamic bandwidth allocation (ALDBA) algorithm. Unlike existing algorithms, the ALDBA algorithm is not limited to controlling just
FTTH access networks, it also supports WSNs. For the proposed algorithm, we investigate the dierence in the lengths of generated data packets between the FTTH terminals and sensor nodes of WSN to eectively
evaluate the end-to-end average packet delay, bandwidth utilization, time
jitter, and upstream eciency. Two variants of the proposed algorithm
and a limited service (LS) scheme, which is an existing well-known algorithm, are compared under non-uniform trac conditions without taking into consideration priority scheduling. We demonstrate the proposed
scheme through simulation by generating a realistic network trac model,
called self-similar network trac. We conducted a detailed simulation using several performance parameters to validate the eectiveness of the proposed scheme. The results of the simulation showed that both ALDBA
variants outperformed the existing LS scheme in terms of average packet
delay, bandwidth utilization, jitter, and upstream eciency for both low
and high trac loads.
key words: WSN, DBA algorithm, bandwidth utilization, jitter, upstream
eciency, delay
1.
Introduction
128
In this section, we first explain the proposed network structure of the hybrid PON combining FTTH access networks
129
Fig. 3
Fig. 2
recognized.
2.2 ALDBA1 Scheme
We consider a hybrid PON-based access network with N
ONUs (i.e., N = NSN + NFTTH , where NSN is the number of
ONUs connected to CHs of WSN and NFTTH is the number of ONUs connected to FTTH terminals). In every DBA
algorithm, the allocation of transmission windows to the
ONUs depend on the requested window size W R and maximum window size max . In the LS scheme, the maximum
allocated window size max depends on the cycle time (i.e.,
length of a polling cycle) T cycle , as shown in the following
equation:
T cycle N(T E + T R + TG )
(1)
N
Here, T E is the length of the Ethernet overhead, T R is the
length of the Report message, and TG is the guard time. In
every DBA scheme, T cycle is a variable parameter that varies
from a minimum value to an upper bound, depending on
the number of active ONUs and their trac load. Making
T cycle too small will result in more bandwidth being wasted
and not utilized by Ethernet overheads (EOs), guard intervals (GIs), and Report messages, as shown in Fig. 2. This
max =
if Wi,Rj Wi,max
Wi, j
j +W
ALDBA1
Wi, j
=
(3)
avg
avg
Wi,max
if Wi,Rj > Wi,max
j +W
j +W
Where Wi,ALDBA1
is the window size allocated to ONU i at
j
time cycle j using the ALDBA1 scheme, and Wi,Rj is the requested window size of ONU i at time cycle j, and Wi,max
j is
the maximum window size for the ONU of FTTH terminal
or CH of WSN at time cycle j.
Figure 3 shows an illustrative example of the ALDBA1
scheme. If ONU1 at time cycle j is a lightly loaded ONU,
avg
, then the granted window size is
i.e., W1,R j < W1,max
j + W
W1,R j . In contrast, if the ONU2 at time cycle j is a heavavg
ily loaded ONU, i.e., W2,R j > W2,max
, then the granted
j +W
max
avg
window size is W2, j + W .
130
WTexcess
otal, j =
LSN
max
R
max
R
W
WFTTH,
+
WSN,
m, j
j
j Wn, j
m=1
R
WTexcess
otal, j Wi, j
H
R
k=1 Wk, j
(4)
n=1
(5)
where Wi,excess
is the excessive bandwidth for ONU i at time
j
cycle j and H is the number of heavily loaded ONUs.
Usually, the waiting time in a PON is determined by
the RTT and the delay of Gate starting time TGd of each
ONU. For simplicity, only RTT time is considered in the
analysis. The OLT predicts the amount of deferred data during the waiting time of each ONU and allocates the extra
bandwidth up to W avg in addition to the requested window
W R . Prediction of the deferred data during the waiting time
depends on the current queue occupancy and RTT of each
ONU, as shown in the equation below:
Wi,pred
j =
Wi,Rj RT T
T i,acquisition
j
where WTexcess
otal, j is the total excessive bandwidth at time cycle
j, LFTTH and LSN are the number of lightly loaded ONUs
connected to FTTH terminals and CHs of WSN, respecR
tively, and Wm/n,
j is the requested window size of lightly
loaded ONU m/n at time cycle j. The following equation is
used to fairly distribute the total excessive bandwidth calculated in Eq. (4) among the heavily loaded ONUs to solve the
congestion problem of the hybrid PON:
=
Wi,excess
j
Fig. 4
(6)
where T i,acquisition
is the acquisition time of present data in the
j
queue, Wi,pred
j is the predicted window size for ONU i at time
avg
.
cycle j, and Wi,pred
j W
The main dierences between the proposed ALDBA2
scheme and the existing scheme in [10] are as follows:
pred
R
excess
if Wi,Rj Wi,max
Wi, j +Wi, j
j +Wi, j
=
W max +W excess +W pred if W R > W max +W excess
i, j
i, j
i, j
i, j
i, j
i, j
(7)
where Wi,ALDBA2
is the allocated bandwidth for ONU i at time
j
cycle j using the ALDBA2 scheme.
The illustrative example of bandwidth allocation in the
ALDBA2 scheme is shown in Fig. 4. Here, requested window W1,R j with predicted window W1,pred
j is allocated to the
lightly loaded ONU1 at time cycle j. In contrast, maximum
max
excess
transmission window WN,
j and excessive bandwidth WN, j
pred
with predicted window WN,
j is allocated to the heavily
loaded ONU N at time cycle j.
3.
131
Table 1
Simulation parameters.
time was assumed to be 10 s for the proposed DBA algorithms, as used by I. Wang et al. [14]. All the analyses were
done for non-uniform oered loads in the range 01.4 with
a variable cycle time in the range 0.53 ms. Our simulation
took into consideration the queuing delay, transmission delay, congestion delay, and processing delay without taking
into consideration any priority scheduling. The simulation
parameters are summarized in Table 1.
The end-to-end packet delay is one of the most important parameters for every network. The proposed hybrid
PON consists of sensor networks and the data of some sensor nodes (e.g., hospital and fire alarm sensor systems) are
delay sensitive. One of the main objectives of the proposed
ALDBA algorithms is the reduction of end-to-end packet
delay by allocating larger transmission window to heavily
loaded ONUs.
Bandwidth utilization of a PON system is expressed by
the following formula:
BU =
total
Wgrant
total
Wgrant
+ N BC
(8)
total
where Wgrant
is the total granted window for all active
ONUs. Since the term NBC in the denominator is constant,
bandwidth utilization can be improved if we can provide a
total
by taking into considlonger total granted window Wgrant
eration the ONUs trac. Note that the proposed scheme
can achieve better bandwidth sharing eciency and can reduce the unused bandwidth by using two dierent maximum
transmission windows for both types of ONU. This granting
of more transmission windows to the heavily loaded ONUs
is the reason why the proposed ALDBA schemes can improve the bandwidth utilization of a hybrid PON.
The nature of usual network trac models is highly
bursty. Due to this bursty network trac, the data packets
of a particular ONU suer from variations in arrival times
in dierent time cycles. To measure the variation in the data
packet arrival time of an ONU, jitter performance of the proposed ALDBA schemes were analyzed. The upstream eciency of a PON system is defined by Eq. (9):
total
is the total generated window of all active
here, Wgenerated
total
ONUs. The calculation of Wgrant
is similar to that of the
total
in the debandwidth utilization, BWU. However, Wgenerated
nominator of upstream eciency consists of a summation of
the total generated windows of all the ONUs in a time cycle even when the generated window is greater than W max .
Because of that upstream eciency can be lower than the
bandwidth utilization.
The following equations are used to calculate the endto-end packet delay DA1 , bandwidth utilization BU A1 , jitter
JA1 , and upstream eciency UE A1 of the ALDBA1 scheme:
N
(WiR +BC )
i=1
R
max
avg
i=1 i
+ T cng if Wi > Wi + W
RU
N R
Wi
i=1
R +B
W
i=1 ( i C )
(11)
BU A1 =
N
(Wimax +W avg )
i=1
R
max
avg
if Wi > Wi + W
n
2
1 A1
A1
JA1 =
(12)
T avl, j T avl,
j1
n j=1
N
(WiR +BC )
i=1
A1
RU
(13)
T avl,
N
j =
(W max +W avg+BC )
R
max
avg
i=1 i
+T cng if Wi > Wi +W
RU
N R
Wi
i=1
R +B
W
(
)
C
i=1 i
(14)
UE A1 =
N
Wimax +W avg )
i=1
R
max
avg
N (W R +B ) if Wi > Wi + W
C
i
i=1
i=1
RU
pred
i=1 i
+ T cng if WiR > Wimax +Wiexcess
RU
BU A2
N R pred
Wi +Wi
i=1
N
pred
R
i=1
UE =
total
Wgrant
total
Wgenerated
+ N BC
(9)
Wi
+Wi
+Wi
+BC
(15)
if WiR Wimax +Wiexcess
132
A2
T avl,
j =
N
i=1
RU
i=1 i
+ T cng if WiR > Wimax +Wiexcess
RU
JA2 =
UE A2
(17)
n
2
1
A2
A2
T avl,
T avl,
j
j1
n j=1
N R pred
Wi +Wi
i=1
N
=
N
i=1
N R pred
i=1
4.
Wi +Wi
(18)
(19)
+BC
Simulation Results
Fig. 5
Fig. 6
Fig. 7
133
Fig. 8
Fig. 9
shown using the white arrows in the contour plots; therefore, the ALDBA2 scheme is more suitable even though the
cycle time is low.
Jitter performances of the existing LS scheme and the
proposed ALDBA schemes are shown in Figs. 8(a), 8(b),
and 8(c). As shown using the white arrows in the contour
plots, the ALDBA2 scheme provides the lowest jitter until the oered load of 1.35 at a 3-ms cycle time while the
ALDBA1 and LS schemes provide the lowest jitter until the
oered load is 1.0 and 0.85, respectively. From the comparison for the 2-ms cycle time in Fig. 8(d), it is found that
the ALDBA2 scheme performs better than both the LS and
ALDBA1 schemes.
Comparison of the upstream eciencies for the same
ranges of cycle time and oered load is shown by the contour plots in Figs. 9(a), 9(b), and 9(c). In this case, the
proposed ALDBA schemes are also better than the existing
LS scheme; this result is consistent with all the above re-
Conclusions
134
References
[1] J. Tang, X. Jin, Y. Zhang, X. Zhang, and W. Cai, A hybrid radio
over fiber wireless sensor network architecture, Proc. 3rd International Conference on Wireless Communications, Networking and
Mobile Computing, WiCom2007, pp.26752678, Shanghai, China,
Sept. 2007.
[2] M. Hossen, K. Kim, and Y. Park, Ecient clustering algorithm for
delay sensitive PON-based wireless sensor network, Proc. 9th International Conference on Optical Internet (COIN), pp.341343, The
Shilla Jeju, Korea, July 2010.
[3] S. Bandyopadhyay and E.J. Coyle, An energy ecient hierarchical clustering algorithm for wireless sensor networks, Proc. IEEE
INFOCOM 2003, vol.3, pp.17131723, 2003.
[4] M.P. McGarry, M. Reisslein, and M. Maier, Ethernet passive optical network architectures and dynamic bandwidth allocation algorithms, Proc. IEEE Commun. Surveys Tutorials, vol.10, no.3,
pp.4660, 3rd Quarter 2008.
[5] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss,
An architecture for dierentiated services, IETF, RFC 2475, Dec.
1998.
[6] IEEE Draft P802.3ahTM /D1.2, Media access control parameters,
physical layers and management parameters for subscriber access
networks, Dec. 2002, http://grouper.ieee.org/groups/802/3/efm
[7] G. Kramer and B. Mukherjee, Ethernet PON: Design and analysis of an optical access network, IEEE Photonic Netw. Commun.,
vol.3, no.3, pp.307319, July 2001.
[8] G. Kramer and B. Mukherjee, Interleaved polling with adaptive
cycle time (IPACT): A dynamic bandwidth distribution scheme in
an optical access network, IEEE Photonic Netw. Commun., vol.4,
no.1, pp.89107, 2002.
[9] G. Kramer, B. Mukherjee, S. Dixit, Y. Ye, and R. Hirth, On supporting dierentiated classes of service in EPON-based access network,
Proc. OSA J. Optical Networks, vol.1, no.8/9, pp.280298, 2002.
[10] C. Assi, Y. Ye, S. Dixit, and M. Ali, Dynamic bandwidth allocation for quality-of-service over Ethernet PONs, IEEE J. Sel. Areas
Commun., vol.21, no.9, pp.14671477, Nov. 2003.
[11] W. Willinger, M.S. Taqqu, and A. Erramilli, A bibliographical
guide to self-similar trac and performance modeling for modern high-speed networks, stochastic networks: Theory and applications, Royal Statistical Society Lecture Notes Series, vol.4, pp.339
366, Oxford University Press, Oxford, U.K., 1996.
[12] B. Lannoo, L. Verslegers, D. Colle, M. Pikavet, P. Demeester, and
M. Gagnaire, Thorough analysis of the IPACT dynamic bandwidth
allocation algorithm for EPONs, Proc. 4th International Conference
on Broadband Communications, Networks and Systems, pp.486
494, 2007.
[13] V. Rajendran, K. Obraczka, and J.J. Garcia-Luna-Aceves, Energyecient, collision-free medium access control for wireless sensor
networks, J. Wireless Netw., vol.12, no.1, pp.6378, 2006.
[14] I. Hwang, Z. Shyu, L. Ke, and C. Chang, A novel early DBA
mechanism with prediction-based fair excessive bandwidth allocation scheme in EPON, Proc. J. Comput. Commun., vol.31, no.9,
pp.18141823, 2008.
Monir Hossen
received a B.Sc. in EEE
from KUET, Bangladesh in 2002. He joined
KUET as a faculty member in the ECE Department in 2004. He completed his M.Sc. in Electronics Engineering at Kookmin University, Korea in 2010. Currently, he is working toward a
Ph.D. at the Interdisciplinary Graduate School
of Medicine and Engineering in University of
Yamanashi, Japan. His present research focus
on PON-based hybrid networks.
Masanori Hanawa
received a B.E., M.E.,
and Ph.D. from Saitama University, Japan, in
1990, 1992, and 1995, respectively. In 1995, he
joined University of Yamanashi, Japan as a research associate. Since 2002, he has been an associate professor of the university. His research
interests are optical signal processing, optical
fiber communications including optical code division multiplexing.