Amr Elrasad

Sleep-time sizing and scheduling in green passive optical networks

Next-generation passive optical network (PON) has been widely considered as a cost-effective broadband access technology. With the ever-increasing power saving concern, energy efficiency has been an important issue for its operations. In this paper, we present a novel sleep time sizing and scheduling framework that satisfies power efficient bandwidth allocation in PONs. We consider the downstream links from an optical line terminal (OLT) to an optical network unit (ONU). The ONU has two classes of traffic, control and data. Control traffic are delay intolerant with higher priority than the data traffic. Closed form model for average ONU sleeping time and end-to-end data traffic delay are presented and evaluated. Our framework decouples the dependency between ONU sleeping time and the QoS of the traffic.

Reducing attendance time in LR-EPONs with differentiated services

This work presents a novel on-the-fly void filling scheme for Long-Reach EPON called Size Controlled Batch Void Filling (SCBVF). SCBVF aims at reducing the time between consecutive bandwidth grants (attendance time) and hence reducing the average delay for delay-sensitive traffic.

Parallel void thread in long-reach ethernet passive optical networks

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 can be 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.

Blind void filling in LR-EPONs: How efficient it can be?

This work proposes a novel blind void (idle periods) filling in Long-Reach Ethernet Passive Optical Networks (LR-EPONs) namely Size Controlled Batch Void Filling (SCBVF). We emphasize on reducing grant delays and hence reducing the average packet delay. SCBVF delay reduction is achieved by early flushing data during the idle time periods (voids) between allocated grants. The proposed approach can be integrated with almost all of the previously reported dynamic bandwidth allocation schemes. SCBVF is less sensitive to differential distance between ONUs and can work well in case of small differential distances compared to previously reported void filling schemes. We support our work by extensive simulation study considering bursty traffic with long range dependency. Numerical results show a delay reduction up to 35% compared to non-void filling scheme outperforming its main competitors that can achieve up to 7% delay reduction.