Improving the energy efficiency of software-defined backbone networks

Carpa, Radu; Glück, Olivier; Lefèvre, Laurent; Mignot, Jean-Christophe

doi:10.1007/s11107-015-0552-9

Cited by 10 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, for a full mesh of virtual tunnels, each node must keep exactly |V | − 1 states: one per each tunnel which starts at the concerned node. An interested reader can relate to our previous work [13] or to the draft IETF RFC [14] for a more detailed overview of the SPRING protocol, which is a very efficient way to simplify the implementation compared to MPLS + RSVP-TE.…”

Section: Methodsmentioning

confidence: 99%

Responsive algorithms for handling load surges and switching links on in green networks

Carpa

Assunção

Glück

et al. 2016

2016 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

Abstract-Reducing the energy consumed by wired computer networks is a challenge that has been actively investigated over the past few years. A popular mechanism proposed to reduce the consumption aims to put links and line cards to sleep mode during off-peak hours. Such a mechanism, however, decreases the available network capacity and increases the risk of congestion if traffic rises unexpectedly. This paper proposes a solution to rapidly react to network bursts and turn-on sleeping links, which we term as SegmenT Routing based Energy Efficient Traffic Engineering for switching ON (STREETE-ON). The proposed algorithm was implemented in the OMNeT++ network simulator using state-of-art dynamic graph algorithms. In such a way, we achieved execution times of tens of milliseconds for a 50-node network. Experimental results show that STREETE-ON can effectively prevent network congestion, avoid turningon unneeded links, and preserve good energy-efficiency of the network.

show abstract

Section: Methodsmentioning

confidence: 99%

Responsive algorithms for handling load surges and switching links on in green networks

Carpa

Assunção

Glück

et al. 2016

2016 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Given that a large part of network traffic is often carried by a small number of large, long-lived flows [5], rerouting these flows may significantly reduce the overall network throughput. We encountered this problem in practice on a testbed set up to evaluate energy-efficient algorithms [3] [4]. These algorithms, implemented in the SDN controller ONOS [6], were reacting too fast to a reduction in the network throughput caused by a recent rerouting.…”

Section: B Rerouting and Congestion Controlmentioning

confidence: 99%

“…As its name suggests, the algorithm grows the congestion window by using a cubic function of the elapsed time from the last loss event y = (∆t) 3 . More precisely, using a shifted and scaled version y = 0.4 · (∆t − RT T − K) 3 + W max .…”

Section: ) Cubicmentioning

confidence: 99%

“…We consider backbone networks with high aggregation level employing SDN to improve their energy efficiency. Previous work introduced algorithms to minimise the number of active system components to reduce its overall energy consumption [3], [4]. Flows are aggregated on a subset of links to put network elements in sleep mode, hence maximising the utilisation of active components.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Evaluating the impact of SDN-induced frequent route changes on TCP flows

Carpa

Assunção

Glück

et al. 2017

2017 13th International Conference on Network and Service Management (CNSM)

Self Cite

View full text Add to dashboard Cite

Abstract-Traffic engineering technologies such as MPLS have been proposed to adjust the paths of data flows according to network availability. Although the time interval between traffic optimisations is often on the scale of hours or minutes, modern SDN techniques enable reconfiguring the network more frequently. It is argued, however, that changing the paths of TCP flows too often could severely impact their performance by incurring packet loss and reordering. This work analyses and evaluates the impact of frequent route changes on the performance of TCP flows. Experiments carried out on a network testbed show that rerouting a flow can affect its throughput when reassigning it a path either longer or shorter than the original path. Packet reordering has a negligible impact when compared to the increase of RTT. Moreover, constant rerouting influences the performance of the congestion control algorithm. Designed to assess the limits on SDN-induced reconfiguration, a scenario where the traffic is rerouted every 0.1s demonstrates that the throughput can be as low as 35% of that achieved without rerouting.

show abstract

“…the optical drive and LCD-backlight, and shows only 20% can be attributed to the CPU. On the other hand, in large-scale infrastructures the EC of network equipment is argued not to fluctuate heavily with increased traffic [30]. With regard to the instructions to process, a workload model should be made to reflect realistic conditions [24].…”

Section: B Resource Utilizationmentioning

confidence: 99%

A Resource Utilization Score for Software Energy Consumption

Jagroep¹,

Werf²,

Broekman³

et al. 2016

Proceedings of ICT for Sustainability 2016

View full text Add to dashboard Cite

Abstract-Software as the true consumer of power and its potential contribution to reach sustainability goals is increasingly being acknowledged. Studies so far have presented successful results and methods to address the energy consumption of the software, indicating that different stakeholders striving for green software have different information needs with respect to their goals. However, currently there is no uniform manner to communicate measurements to the different stakeholders such that key findings are clearly identifiable and easy to understand, which is likely to hamper green software practices. In this paper we propose a metric that expresses a score for the resource utilization, such as power consumption, of a software product. The metric is designed to be a single score and is flexible to encompass those aspects that a stakeholder considers relevant in the context of software energy consumption. The metric was applied on two applications and allowed for objective comparison of application configurations and versions. Also the behavior of these applications across different hardware configurations could be analyzed. In addition to the metric we investigate means to visualize measurements which enhances communication and helped with highlighting the key findings.

show abstract

Improving the energy efficiency of software-defined backbone networks

Cited by 10 publications

References 14 publications

Responsive algorithms for handling load surges and switching links on in green networks

Responsive algorithms for handling load surges and switching links on in green networks

Evaluating the impact of SDN-induced frequent route changes on TCP flows

A Resource Utilization Score for Software Energy Consumption

Contact Info

Product

Resources

About