An Energy-Efficient Distributed Dynamic Bandwidth Allocation Algorithm for Passive Optical Access Networks

The rapid deployment of passive optical access networks (PONs) increases the global energy consumption of networking infrastructure. This paper focuses on the minimization of energy consumption in Ethernet PONs (EPONs). We present an energy-efficient, distributed dynamic bandwidth allocation (DBA) a...

Full description

Saved in:
Bibliographic Details
Published inSustainability Vol. 12; no. 6; p. 2264
Main Authors Khalili, Hamzeh, Rincón, David, Sallent, Sebastià, Piney, José Ramón
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 13.03.2020
Subjects
Access control
Algorithms
Bandwidths
Downstream effects
Energy conservation
Energy consumption
Energy efficiency
Ethernet
Optical communication
Pons
Queues
Scheduling
Sustainability
Switching theory
Traffic
Transmitters
Upstream
Online AccessGet full text

Cover

More Information
Summary:The rapid deployment of passive optical access networks (PONs) increases the global energy consumption of networking infrastructure. This paper focuses on the minimization of energy consumption in Ethernet PONs (EPONs). We present an energy-efficient, distributed dynamic bandwidth allocation (DBA) algorithm able to power off the transmitter and receiver of an optical network unit (ONU) when there is no upstream or downstream traffic. Our main contribution is combining the advantages of a distributed DBA (namely, a smaller packet delay compared to centralized DBAs, due to less time being needed to allocate the transmission slot) with energy saving features (that come at a price of longer delays due to the longer queue waiting times when transmitters are switched off). The proposed algorithm analyzes the queue size of the ONUs in order to switch them to doze/sleep mode when there is no upstream/downstream traffic in the network, respectively. Our results show that we minimized the ONU energy consumption across a wide range of network loads while keeping delay bounded.
ISSN:2071-1050
2071-1050
DOI:10.3390/su12062264