Reducing Greenhouse Gas Emissions With Power Source-Aware Multidomain Multilayer Networks

Traffic grooming is necessary for the efficient use of optical networks. It generally requires a signal conversion from the optical to the electrical domain and back. Planners have some freedom in selecting the location where this energy-intensive process takes place. A subset of nodes in a network...

Full description

Saved in:
Bibliographic Details
Published inIEEE systems journal Vol. 11; no. 2; pp. 673 - 683
Main Authors Schoendienst, Thilo, Vokkarane, Vinod M.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.06.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Traffic grooming is necessary for the efficient use of optical networks. It generally requires a signal conversion from the optical to the electrical domain and back. Planners have some freedom in selecting the location where this energy-intensive process takes place. A subset of nodes in a network may be powered by renewable energy sources. Those green nodes cause lower greenhouse gas (GHG) emissions than others. We suggest to choose these green sites for grooming. We propose a model for GHG emissions caused by network operations. Depending on the level of penetration of renewable sources in the power supplies across the network, emissions can be reduced significantly. We introduce a hierarchical grooming approach to collect and multiplex traffic at those green nodes, groom it there, and therefore save emissions. We evaluate the emission model and the hierarchical approaches' performance. Furthermore, we apply them to various network/demand scenarios in an effort to identify favorable conditions for this scheme. We find that, by relaxing energy-efficiency requirements in green nodes and being more stringent in black nodes, we can reduce overall network emissions. The hierarchical approach is scalable and efficiently applicable to operating and future networks.
ISSN:1932-8184
1937-9234
DOI:10.1109/JSYST.2015.2448599