TY - JOUR
T1 - Parallel Void Thread in Long-Reach Ethernet Passive Optical Networks
AU - Elrasad, Amr
AU - Shihada, Basem
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2015/6/25
Y1 - 2015/6/25
N2 - This work investigates void filling (idle periods) in long-reach Ethernet passive optical networks. We focus on reducing grant delays and hence reducing the average packet delay. We introduce a novel approach called parallel void thread (PVT), which allocates bandwidth grants during voids baseless of bandwidth requests. We introduce three different grant sizing schemes for PVT, namely void extension, count controlled batch void filling, and size controlled batch void filling. The proposed approaches canbe integrated with almost all of the previously reported dynamic bandwidth allocation schemes. Unlike other void filling schemes, PVT is less sensitive to the differential distance between optical network units and can work very well in the case of limited differential distances. We have analytically investigated the packet delay and derived a bound condition for PVT to outperform the other competitors. We support our work with extensive simulation study considering bursty traffic with long range dependence for both the single-class and differentiated services (DiffServ) scenarios. Numerical results show delay reduction up to 35% compared with the non-void filling scheme for the single-class scenario. For DiffServ traffic, PVT achieves delay reduction up to 80% for expedited forward traffic, 52% for assured forward traffic, and 56% for best effort traffic. © 2015 OSA.
AB - This work investigates void filling (idle periods) in long-reach Ethernet passive optical networks. We focus on reducing grant delays and hence reducing the average packet delay. We introduce a novel approach called parallel void thread (PVT), which allocates bandwidth grants during voids baseless of bandwidth requests. We introduce three different grant sizing schemes for PVT, namely void extension, count controlled batch void filling, and size controlled batch void filling. The proposed approaches canbe integrated with almost all of the previously reported dynamic bandwidth allocation schemes. Unlike other void filling schemes, PVT is less sensitive to the differential distance between optical network units and can work very well in the case of limited differential distances. We have analytically investigated the packet delay and derived a bound condition for PVT to outperform the other competitors. We support our work with extensive simulation study considering bursty traffic with long range dependence for both the single-class and differentiated services (DiffServ) scenarios. Numerical results show delay reduction up to 35% compared with the non-void filling scheme for the single-class scenario. For DiffServ traffic, PVT achieves delay reduction up to 80% for expedited forward traffic, 52% for assured forward traffic, and 56% for best effort traffic. © 2015 OSA.
UR - http://hdl.handle.net/10754/575908
UR - https://www.osapublishing.org/abstract.cfm?URI=jocn-7-7-656
UR - http://www.scopus.com/inward/record.url?scp=84938360221&partnerID=8YFLogxK
U2 - 10.1364/JOCN.7.000656
DO - 10.1364/JOCN.7.000656
M3 - Article
SN - 1943-0620
VL - 7
SP - 656
JO - Journal of Optical Communications and Networking
JF - Journal of Optical Communications and Networking
IS - 7
ER -