Online scheduling protocol design for energy-efficient TWDM-OLT

The design of energy-efficient optical network units (ONUs) in passive optical networks (PONs) has been studied extensively in the literature. Time- and wavelength- division multiplexed PONs, a widely accepted future access technology, offer an additional opportunity to save energy at the OLT along...

Full description

Saved in:
Bibliographic Details
Published inJournal of optical communications and networking Vol. 10; no. 3; pp. 260 - 271
Main Authors Dutta, Sourav, Roy, Dibbendu, Bhar, Chayan, Das, Goutam
Format Journal Article
LanguageEnglish
Published Piscataway Optica Publishing Group 01.03.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The design of energy-efficient optical network units (ONUs) in passive optical networks (PONs) has been studied extensively in the literature. Time- and wavelength- division multiplexed PONs, a widely accepted future access technology, offer an additional opportunity to save energy at the OLT along with the existing energyefficient ONU design due to the idle periods (voids) created by scheduling. Existing proposals utilize few of the available wavelengths (active wavelengths) for scheduling, and energy efficiency is achieved by switching off the OLT receivers associated with the remaining wavelengths. In this paper we reason that, subject to a delay bound of the upstream data, the voids created due to scheduling in the active wavelengths remain unutilized and thus create ample opportunity for saving energy at the OLT. Further, we show that modifications of the conventional method provide a limited scope of utilizing these voids for energy efficiency. Thus, we deviate from the conventional methodology and propose a novel online scheduling protocol which aims at minimizing the number of voids in all wavelengths. Our results demonstrate a significant improvement in energy efficiency, as compared to existing proposals, without affecting the algorithmic complexity.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1943-0620
1943-0639
DOI:10.1364/JOCN.10.000260