Amr Elrasad

Bio: Amr Elrasad is an academic researcher from Trinity College, Dublin. The author has contributed to research in topics: Dynamic bandwidth allocation & Passive optical network. The author has an hindex of 5, co-authored 13 publications receiving 93 citations. Previous affiliations of Amr Elrasad include King Abdullah University of Science and Technology & University of Ottawa.

Virtual dynamic bandwidth allocation enabling true PON multi-tenancy

Abstract: We propose a virtual-DBA architecture enabling true PON multi-tenancy, giving Virtual Network Operators full control over capacity assignment algorithms. We achieve virtualization enabling efficient capacity sharing without increasing scheduling delay compared to traditional (non-virtualized) PONs.

Demonstration of Real Time VNF Implementation of OLT with Virtual DBA for Sliceable Multi-Tenant PONs

Abstract: We demonstrate the VNF implementation of a sliceable PON architecture enabling true multi-tenancy, giving Virtual Network Operators full control over capacity scheduling. We analyze resource sharing efficiency and latency performance for different NFV co-location scenarios.

DBA Capacity Auctions to Enhance Resource Sharing across Virtual Network Operators in Multi-Tenant PONs

Abstract: We propose an economic-robust auction mechanism for multi-tenant PON's capacity sharing that operates within the DBA process. We demonstrate that our mechanism improves PON utilization by providing economic sharing incentives across VNOs and infrastructure providers.

Frame Level Sharing for DBA virtualization in multi-tenant PONs

Abstract: The worldwide installation of Fiber-to-the-premises (FTTP) access network solutions is hindered by the high upfront cost of deploying ubiquitous fiber infrastructure. While passive optical networks can provide lower cost compared to point-to-point solutions, their total cost of ownership is still high for most operators to justify a mass scale deployment. Sharing passive optical network (PON) infrastructure has thus been proposed as a solution for network operators to reduce the cost of running FTTP services. In addition, the ability for operators to offer business services (including for example mobile backhaul) in addition to residential services, is crucial to increase the overall PON network revenue. However running services with highly diverse requirements over a physical infrastructure shared among multiple operators (which we now refer to as virtual network operators -VNOs) requires VNOs to have a tight control over PON capacity scheduling. In this paper, we introduce a novel upstream PON capacity sharing algorithm called Frame Level Sharing (FLS). FLS is based on the idea of virtual Dynamic Bandwidth Assignment (vDBA), and allows sharing the upstream frame among multiple VNOs to maximize bandwidth utilization, minimize latency, and provide a high level of service isolation among the VNOs sharing the PON. Our simulation results show that FLS outperforms other benchmark algorithms proposed in the literature.

iFrag: interference-aware frame fragmentation scheme for wireless sensor networks

Abstract: Reliable data transmission is a fundamental challenge in resource-constrained wireless sensor networks. In current implementations, a single bit error requires retransmitting the entire frame. This incurs extra processing overhead and power consumption, especially for large frames. Frame fragmentation into small blocks with individual error detection codes can reduce the unnecessary retransmission of the correctly received blocks. The optimal block size, however, varies based on the wireless channel conditions. In this paper, we propose an interference-aware frame fragmentation scheme called iFrag. iFrag dynamically adjusts the number of blocks inside a frame based on current channel conditions, and effectively addresses all challenges associated with such dynamic partitioning. Through analytical and experimental results, we show that iFrag achieves up to $$3\times$$ 3 × improvement in goodput when the channel is noisy, while reducing the delay by 12 % compared to other static fragmentation approaches. On average, it shows a 13 % gain in goodput across all channel conditions used in our experiments. Our testbed results also show that iFrag lowers the energy consumed per useful bit by 60 %, as improved data transmission reliability reduces the number of frame retransmissions which increases the motes energy efficiency.

Sharing Distributed and Heterogeneous Resources toward End-to-End 5G Networks: A Comprehensive Survey and a Taxonomy

Abstract: Regardless of the context to which it is applied, sharing resources is well-recognized for its considerable benefits. Since 5G networks will be service-oriented, on-demand, and highly heterogeneous, it is utmost important to approach the design and optimization of the network from an end-to-end perspective. In addition, in order to ensure end-to-end performance, this approach has to entail both wireless and optical domains, altogether with the IoT, edge, and cloud paradigms which are an indispensable part of the 5G network architecture. Shifting from the exclusive ownership of network resources toward sharing enables all participants to cope with stringent service requirements in 5G networks, gaining significant performance improvements and cost savings at the same time. The main objective of this paper is to survey the literature on resource sharing, providing an in-depth and comprehensive perspective of sharing by recognizing the main trends, the techniques which enable sharing, and the challenges that need to be addressed. By providing a taxonomy which brings the relevant features of a comprehensive sharing model into focus, we aim to enable the creation of sharing models for more efficient future communication networks. We also summarize and discuss the relevant issues arising from network sharing, that should be properly tackled in the future.

Virtual DBA: virtualizing passive optical networks to enable multi-service operation in true multi-tenant environments

Abstract: This paper presents the concept of virtual dynamic bandwidth allocation (DBA), a method we propose to virtualize upstream capacity scheduling in passive optical networks (PONs), which provides multiple independent virtual network operators with the ability to precisely schedule their upstream traffic allocation. After a brief introduction on the evolution of access network sharing, we present our virtual DBA architecture, detailing its main components. We then provide a summary of the work done in this area from both theoretical and practical implementation perspectives. In this paper, we propose a novel stateless algorithm for merging multiple independent virtual bandwidth maps based on priority classes and analyze its performance in terms of efficiency of capacity allocation and latency. Through our results, we discuss the existence of a trade-off between traffic load and grant size distribution versus efficiency and latency. We find that, different from a residential single-tenant application, when PONs are used for low-latency and multi-tenant applications, the system has better overall performance if grants are allocated in small size. In addition, our analysis shows that for high-priority, strict latency services, our proposed merging algorithm presents delay performance that is independent of the traffic distribution considered.

Proposing a Novel Method based on Network- Coding for Optimizing Error Recovery in Wireless Sensor Networks

Abstract: In Wireless Sensor Networks (WSNs), signals are used as channels for communicating data. Wireless channels are inherently insecure; hence, the vulnerability of signals to external destructive factors and to the interference of intruders can result in the production of errors in data to be transferred. On the other hand, in as much as wireless sensors have limited energy, optimal consumption of energy for enhancing network lifetime is of high significance. In this paper, a protocol based on block-level retransmission and network-coding has been proposed which is intended to optimize error recovery in sensor networks. This protocol takes the parameters of reliability and energy consumption into account. In this protocol, data frames are divided into blocks and in the case of error occurrence, the total frame need not to be transferred since only the error containing block is retransferred using the network coding technique. This procedure minimizes the number of transfer and reception in the nodes. Consequently, energy consumption is reduced. The simulation results revealed that utilizing the networking coding technique in the proposed method results in reliability enhancement. Thus, the simulation results indicate that the proposed method leads to higher reliability and lower energy consumption than the LIERMO method.

Moving the Network to the Cloud: The Cloud Central Office Revolution and Its Implications for the Optical Layer

Abstract: Software Defined Networking (SDN) and Network Function Virtualisation (NFV) have recently changed the way we operate networks. By decoupling control and data plane operations and virtualizing their components, they have opened up new frontiers toward reducing network ownership costs and improving usability and efficiency. Recently, their applicability has moved toward public telecommunications networks, with concepts such as the Cloud Central Office (cloud-CO) that have pioneered its use in access and metro networks: an idea that has quickly attracted the interest of network operators. By merging mobile, residential and enterprise services into a common framework, built around commoditized data centre types of architectures, future embodiments of this CO virtualization concept could achieve significant capital and operational cost savings, while providing customised network experience to high-capacity and low-latency future applications. This tutorial provides an overview of the various frameworks and architectures outlining current network disaggregation trends that are leading to the virtualization/cloudification of central offices. It also provides insight on the virtualization of the access-metro network, showcasing new software functionalities like the virtual Dynamic Bandwidth Allocation (DBA) mechanisms for Passive Optical Networks (PONs). In addition, we explore how it can bring together different network technologies to enable convergence of mobile and optical access networks and pave the way for the integration of disaggregated Reconfigurable Add Drop Multiplexer (ROADM) networks.

A Sharing Platform for Multi-Tenant PONs

Abstract: In this paper, we address the sharing incentive issue in multi-tenant passive optical networks (PONs). We propose an economic-robust and efficient sharing platform for new emerging multi-tenant PON networks. This platform is capable of accommodating a diverse range of service providers and enhancing the network utilization. We propose a sharing platform that provides sharing incentives for the incumbent network operators through monetization of inter-operator network sharing. Meanwhile, the platform allows the incumbent operators to operate a virtual instance of the bandwidth scheduling algorithm that enables them to meet their quality of service and latency requirements. Therefore, the proposed sharing platform grants a high degree of control to the operators co-operating the same network while, thanks to the higher resource efficiency, reduces the initial investment. We first model the multi-tenant PON as a market and define the roles of the virtual network operators and the infrastructure provider along with their utility functions. We propose a double auction mechanism to facilitate the trading of excess resources. The proposed double auction satisfies the crucial economic properties of a market while it achieves more efficient resource allocation among the market players. We have theoretically proven the economic robustness of the mechanism including incentive compatibility, individual rationality, and weak budget balance. Through extensive market simulations, we confirmed that the proposed mechanism achieves superior allocative efficiency compared to a reference baseline mechanism.