Professional Documents
Culture Documents
Corresponding author.
E-mail addresses: ali.razmkhah@gmail.com (A. Razmkhah), ghaffarpour@sut.
ac.ir (A.G. Rahbar).
Optical Fiber Technology 17 (2011) 586593
Contents lists available at SciVerse ScienceDirect
Optical Fiber Technology
www. el sevi er . com/ l ocat e/ yof t e
3. The limited granting (LG) scheme [11] introduces maximum
window size W
max
, in which each ONU is granted the minimum
of its requested size and W
max
. The limitation on window size
can provide better fairness and shortest cycle time. Cycle time
denotes the duration in which all ONUs can transmit their data
or report messages once. The LG scheme removes the channel
monopolizing problem in the gated granting scheme. Addition-
ally, some granting schemes which are decedents of the LG
scheme have been proposed. The limited with excess distribu-
tion scheme (LED) [15,16] provides a minimum bandwidth
guarantee (B
min
) for each ONU by initially assigning B
min
to each
ONU, and then sharing excess bandwidth of light-loaded ONU
(those ONUs with report <B
min
) among heavy-loaded ONUs
(those ONUs with report >B
min
). On the other hand, the grant
estimation scheme [17] estimates the size of new arriving pack-
ets between two consecutive pollings, and assigns the requester
ONU additional estimated size together with its reported win-
dow. Other estimation based DBAs have been proposed in Refs.
[18,19]. These schemes are the extension of the LG scheme, and
their allocated window size is limited by W
max
. The advantages
of the LG scheme and its descendants are to relieve the inef-
ciency problem of the xed granting scheme and to remove
channel monopolizing problem of the gated scheme. In short,
the LG scheme has been widely employed in TDM EPONS, intel-
ligent gap lling scheme (IGFS) [9], Nearest First Scheme (NFS)
[10] and other WDM EPON techniques like [20,21].
There are two major groups of DBA scheduling in both TDM and
WDM EPON [7,2224] as online and ofine scheduling. Under the
online scheduling, e.g., [10,22], the OLT schedules an ONU upon its
report message arrival. Whereas in ofine scheduling, e.g., [7,9],
the OLT makes scheduling after the arrival of all report messages
from all ONUs. A comparison of ofine vs. online DBA scheduling
has been presented in Ref. [25]. For example, IGFS [9] is an ofine
scheduler and NFS [10] is an online scheduler. The IGFS rst favors
ONUs that their transmission window can be accommodated in the
gaps between other ONUs transmission windows, and second or-
ders ONUs by their transmission end times and favors ONUs which
have the minimum latency, i.e., the end time of transmission win-
dow. The NFS scheme has an ofine characteristic and by intelli-
gently employing early allocation mechanism, it functions in a
semi online manner. The NFS prioritizes ONUs based on their
round trip times (RTTs) in an ascending order. The NFS can allevi-
ate channel idle time and can provide more efcient transmission.
Both the NFS and the IGFS are suitable for heterogeneous WDM
EPONs, where ONUs are located at different distances from the
OLT. In Ref. [26], another DBA for heterogeneous EPONs has been
proposed.
As aforementioned, the LG scheme has been widely employed
in WDM EPON. However, the LG scheme suffers from under-serv-
ing of buffers when report size is greater than W
max
[27]. Under-
serving of buffers wastes the upstream bandwidth, and increases
both queuing delay and packet drop ratio. This motivates us to de-
sign a more efcient granting scheme, called the ONU Side Limited
Granting (OSLG) scheme.
Our objective is to propose two ONU Side Limited Granting
(OSLG)schemes in order to improve performance of the LG scheme
in terms of queuing delay and drop ratio in WDM EPON. The OSLG
can be used as granting scheme of any DBA to provide better per-
formance in the terms of packet drop ratio and queuing delay. The
OSLG can even be applied to the next generation optical access
networks, i.e., Long Reach PON (LR-PON) [2831] which extends
OLT-ONU distance up to 100 km and the OLT arbitrates hundreds
of ONUs. The OSLG_GA uses Gate Accommodation (GA) algorithm
which is based on the LG scheme, in which each ONU knows W
max
in advance. Instead of reporting its whole queue size, each ONU
computes the optimal value of transmission window size by taking
W
max
into account that fully meets its trafc requirements. By this,
no bandwidth is wasted and the network can optimize packet drop
ratio and queuing delay performances. In addition, the Save and
Compensate (SC) mechanism is employed in the OSLG_SC to
achieve better performance and to completely serve maximum
granted window.
The contributions of this paper are the proposal of OSLG_GA and
OSLG_SC as two granting schemes for WDM EPON that can im-
prove queuing delay and drop ratio performances compared to
the LG scheme.
The remainder of this paper is organized as follows. In Section 2,
network model is presented. Section 3 introduces our proposed
OSLG algorithm. Section 4 presents performance evaluation, fol-
lowed by a conclusion in Section 5.
2. Network model
The network is a WDM EPON with tree topology with n ONUs,
displayed in Fig. 1. The transmission bandwidth is deployed by x
data wavelengths; where x is equal or smaller than n. In addition,
the network uses control channel k
0
to exchange gate messages.
The ONUs may be located in different distances from the OLT. Each
ONU is equipped with a tunable transmitter to transmit its data
and report messages on a scheduled wavelength, and a xed recei-
ver to receive data and gate messages on k
0
. On the other hand, the
OLT uses xed array of receivers to receive data packets together
with report messages, while it uses a xed transmitter in order
to send gate messages on k
0
. Using the gate message, the OLT
informs each ONU the transmission time and the scheduled wave-
length in order to transmit its data and report message. A Report
message is transmitted at the head of data in this paper. A list of
general notations and symbols are illustrated in Table 1.
3. The OSLG scheme
Bandwidth wasting in the LG scheme leads to under-serving of
buffers, where packet queuing delay and packet drop ratio in-
crease. To illustrate the bandwidth wastage, for example, consider
we have W
max
= 8000 bytes. Let an ONU report 8500 bytes to the
OLT, where this ONU has ve packets with size 1500 bytes and
one packet with size 1000 bytes. The OLT grants the ONU the
amount of W
max
. The ONU uses 7500 bytes of W
max
and uploads
its rst ve packets. Then, the ONU has a right to transmit 8000
7500 = 500 bytes, but the last packet size is 1000 bytes. Since the
Ethernet packet cannot be fragmented, the reminder of W
max
is
wasted.
We introduce two OSLG techniques that can resolve the band-
width wastage problem by two Gate Accommodation (GA) and
Save and Compensate (SC) mechanisms. Note that the OSLG is a
granting scheme, not a DBA. The scheduling of ONUs and assigning
wavelengths to them are the functions of the OLT. An ONU only
determines the size of the transmission window. An abstract of
notations and general symbols are tabulated in Table 1.
3.1. The OSLG with Gate Accommodation (GA) algorithm (OSLG_GA)
The OSLG with Gate Accommodation (GA) algorithm is based on
the following rule. First, the OLT announces W
max
to all ONUs.
Then, the algorithm in Fig. 2 is executed by ONU
i
to compute the
optimal report size that must be announced to the OLT. Let S
i
and buf
i
denote the optimum window size and buffer of the ith
ONU, respectively; where buf
i
[j] determines the length of the j-th
packet stored in the ith ONU buffer. The OSLG_GA reviews packets
from the head of the buffer until the length of all reviewed packets
A. Razmkhah, A.G. Rahbar / Optical Fiber Technology 17 (2011) 586593 587
is less than or equal to W
max
. This algorithm respects two con-
straints as (1) the reported size 6W
max
; and (2) the reported size
should include an integer number of buffered packets. Finally,
the ONU reports the computed size S
to the OLT.
The computational complexity of the proposed OSLG_GA algo-
rithm is O(bufLength) where bufLength denotes the number of
packets stored in the buffer. Both Lines 1 and 2 have O(1) complex-
ity. Lines from 4 to 9 need O(3) complexity for each loop. Since the
while loop is repeated at most bufLength times, total complexity is
O(1 + 1 + 3 bufLength) = O(bufLength).
Now, a discussion is provided on the analysis of the LG and
OSLG_GA:
Under the LG, bandwidth is wasted when the granted window
cannot accommodate the next Ethernet packet. Recall that the
maximum length of an Ethernet frame is 1518 bytes with a pay-
load of 1500 bytes. Therefore, in the worst case, 1518
1 = 1517 bytes of a granted window can be wasted. Clearly, no
trafc is wasted under the best case.
Let b denote average Ethernet frame length buffered in an ONU.
Bandwidth wastage is minimized when W
max
is an integer mul-
tiplicand of b. In this case, granted window can fully accommo-
date an integer number of buffered packets. Let r be the amount
of wasted bandwidth obtained by r = W
max
mod b, where b mod c
means the remainder of b divided by c. This equation is used to
compute minimum and maximum bandwidth wastage in a sin-
gle cycle, where minimum wastage is 0 byte and maximum
wastage is b 1 bytes. Therefore, r
b1
2
b
2
bytes are wasted
on average in each bandwidth granting; and the wastage ratio
(w
r
) can be given by
w
r
b
2 W
max
100%: 1
To reduce w
r
in Eq. (1), one can consider W
max
large enough.
However, considering large values for W
max
results in monopo-
lizing of channel similar to the gated scheme, and large values
for W
max
cannot completely remove the wastage problem.
The wasted bandwidth in the LG together with guard times
leads to a larger gap between transmissions of two consecutive
ONUs. Thus, removing the wasted bandwidth can increase net-
work throughput. To completely remove the wasted bandwidth,
OSLG_GA can be employed, where it determines granting win-
dow size by complexity of O(bufLength). The OSLG_GA
decreases cycle time by relieving bandwidth wastage so that
the OLT can schedule the next cycle sooner than the LG scheme.
This results in reducing packet drop ratio and packet queuing
delay in each ONU. Since an ONU determines grant window
size, there is no need to compare the report size with W
max
at
the OLT side. In other words, the OLT grants whatever size the
ONU has requested similar to the gated scheme.
3.2. The OSLG with Save and Compensate (SC) algorithm (OSLG_SC)
Under the OSLG with Save and Compensate (OSLG_SC) scheme,
ONU
i
executes the algorithm depicted in Fig. 3 to compute the
Fig. 1. Typical WDM EPON.
Table 1
Abbreviation of symbols and notations.
b Average Ethernet frame length
k
i
The ith wavelength
x Number of wavelengths in WDM EPON network
B
min
Minimum guaranteed bandwidth
buf
i
Buffer of the ith ONU
buf
i
[j] Length of the j-th buffered packet of the ith ONU
CA
i
Channel availability time of the ith wavelength
g Guard time
granted_window_size Length of granted transmission window
n Number of ONUs
R Link bit rate
r
b,i
Residual unused bandwidth in the ith ONU
received_packet_size Length of packet that OLT has received
S
i
for the current cycle by taking both W
max
and Sb
i
into account (in parameter Temp_W
max
); by executing OSLG_GA
with Temp_W
max
instead of W
max
. If ONU
i
cannot satisfy its tempo-
rary maximum window (i.e., Temp_W
max
) and the condition dif-
f + Ub
i
6 U
l
holds true, it can use more bandwidth than
Temp_W
max
to deliver the next packet by updating Ub
i
and S
by
the diff and S
p
parameters, respectively. Note the parameter diff is
the difference of the requested bandwidth and Temp_W
max
pro-
vided that the requested bandwidth is larger than Temp_W
max
.
Otherwise, S