eprintid: 10066073
rev_number: 15
eprint_status: archive
userid: 608
dir: disk0/10/06/60/73
datestamp: 2019-01-18 12:36:16
lastmod: 2020-02-12 16:40:51
status_changed: 2019-01-18 12:36:16
type: article
metadata_visibility: show
creators_name: Giroire, F
creators_name: Huin, N
creators_name: Moulierac, J
creators_name: Truong, KP
title: Energy-Aware Routing in Software-Defined Network using Compression
ispublished: pub
divisions: UCL
divisions: A01
divisions: B04
divisions: C05
divisions: F46
keywords: Science & Technology, Technology, Computer Science, Hardware & Architecture, Computer Science, Information Systems, Computer Science, Software Engineering, Computer Science, Theory & Methods, Computer Science, software-defined networks, energy-aware routing, forwarding tables, compression with wildcards, algorithms, green networking, DESIGN
note: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
abstract: Software-defined Network (SDN) is a new networking paradigm enabling innovation through network programmability. Over past few years, many applications have been built using SDN such as server load balancing, virtual-machine migration, traffic engineering and access control. In this paper, we focus on using SDN for energy-aware routing (EAR). Since traffic load has a small influence on the power consumption of routers, EAR allows putting unused links into sleep mode to save energy. SDN can collect traffic matrix and then computes routing solutions satisfying QoS while being minimal in energy consumption. However, prior works on EAR have assumed that the SDN forwarding table switch can hold an infinite number of rules. In practice, this assumption does not hold since such flow tables are implemented in Ternary Content Addressable Memory (TCAM) which is expensive and power hungry. We consider the use of wildcard rules to compress the forwarding tables. In this paper, we propose optimization methods to minimize energy consumption for a backbone network while respecting capacity constraints on links and rule space constraints on routers. In details, we present two exact formulations using Integer Linear Program (ILP) and introduce efficient heuristic algorithms. Based on simulations on realistic network topologies, we show that using this smart rule space allocation, it is possible to save almost as much power consumption as the classical EAR approach.
date: 2018-03-24
date_type: published
publisher: OXFORD UNIV PRESS
official_url: https://doi.org/10.1093/comjnl/bxy029
oa_status: green
full_text_type: other
language: eng
primo: open
primo_central: open_green
article_type_text: Article
verified: verified_manual
elements_id: 1617207
doi: 10.1093/comjnl/bxy029
lyricists_name: Phan, Truong
lyricists_id: TKPHA06
actors_name: Phan, Truong
actors_id: TKPHA06
actors_role: owner
full_text_status: public
publication: The Computer Journal
volume: 61
number: 10
pagerange: 1537-1556
pages: 20
issn: 1460-2067
citation:        Giroire, F;    Huin, N;    Moulierac, J;    Truong, KP;      (2018)    Energy-Aware Routing in Software-Defined Network using Compression.                   The Computer Journal , 61  (10)   pp. 1537-1556.    10.1093/comjnl/bxy029 <https://doi.org/10.1093/comjnl%2Fbxy029>.       Green open access   
 
document_url: https://discovery.ucl.ac.uk/id/eprint/10066073/1/draft.pdf