Energy Efficient Routing and Network Coding in Core Networks

TL;DR

This paper explores the use of network coding to improve energy efficiency in core networks, demonstrating significant power savings through optimization models and analyzing the impact of topology changes.

Contribution

It introduces a MILP model and heuristic for energy-efficient network coding in core networks, with analysis of topology effects and analytic bounds.

Findings

Up to 33% power savings with non-bypass routing.

Up to 28% power savings with bypass routing.

Savings proportional to average hop count.

Abstract

We propose network coding as an energy efficient data transmission technique in core networks with non-bypass and bypass routing approaches. The improvement in energy efficiency is achieved through reduction in the traffic flows passing through intermediate nodes. A mixed integer linear program (MILP) is developed to optimize the use of network resources, and the results show that our proposed network coding approach introduces up to 33% power savings for the non-bypass case compared with the conventional architectures. For the bypass case, 28% power savings are obtained considering futuristic network components power consumption. A heuristic based on the minimum hop count routing shows power savings comparable to the MILP results. Furthermore, we study how the change in network topology affects the savings produced by network coding. The results show that the savings are proportional to the average hop count of the network topology. We also derive power consumption analytic bounds and closed form expressions for networks that implement network coding and thus also verify the results obtained by the MILP model.