<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Cervello-Pastor_et_al_2016a</id>
		<title>Cervello-Pastor et al 2016a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Cervello-Pastor_et_al_2016a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Cervello-Pastor_et_al_2016a&amp;action=history"/>
		<updated>2026-06-28T23:34:17Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Cervello-Pastor_et_al_2016a&amp;diff=205679&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 478271551 to Cervello-Pastor et al 2016a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Cervello-Pastor_et_al_2016a&amp;diff=205679&amp;oldid=prev"/>
				<updated>2021-02-03T16:38:24Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_478271551&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 478271551&quot;&gt;Draft Content 478271551&lt;/a&gt; to &lt;a href=&quot;/public/Cervello-Pastor_et_al_2016a&quot; title=&quot;Cervello-Pastor et al 2016a&quot;&gt;Cervello-Pastor et al 2016a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 16:38, 3 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Cervello-Pastor_et_al_2016a&amp;diff=205678&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  hieving energy efficiency has recently become an essential aim of networking research due to the ever increasing power consumption and CO2 emissions generated...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Cervello-Pastor_et_al_2016a&amp;diff=205678&amp;oldid=prev"/>
				<updated>2021-02-03T16:38:21Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  hieving energy efficiency has recently become an essential aim of networking research due to the ever increasing power consumption and CO2 emissions generated...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
hieving energy efficiency has recently become an essential aim of networking research due to the ever increasing power consumption and CO2 emissions generated by large data networks. For this problem, the emerging paradigm of Software-Defined Networks (SDN) can be seen as an attractive solution. In these networks an energy-aware routing model could be easily implemented leveraging the control and data plane separation. This paper addresses the problem of optimizing the power consumption in SDN using an energy-aware traffic engineering approach that minimizes the number of links that can be used to satisfy a given traffic demand. Different from previous works, we focus on optimizing energy consumption in OpenFlow networks with in-band control traffic. Our approach also considers performance constraints that are crucial in the correct operation of SDN, such as bounded delay for the control plane traffic and load balance between controllers. First, we present a complete formulation of the optimization problem involving the routing requirements for control and data plane communications. To reduce the time complexity of our model in large-scale topologies we derive a heuristic algorithm. Significant values of energy saving (up to 60%) are reached in the simulations using real topologies and demands data.&lt;br /&gt;
&lt;br /&gt;
Peer Reviewed&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://hdl.handle.net/2117/104406 http://hdl.handle.net/2117/104406]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/7840067/7841475/07841561.pdf?arnumber=7841561 http://xplorestaging.ieee.org/ielx7/7840067/7841475/07841561.pdf?arnumber=7841561],&lt;br /&gt;
: [http://dx.doi.org/10.1109/glocom.2016.7841561 http://dx.doi.org/10.1109/glocom.2016.7841561]&lt;br /&gt;
&lt;br /&gt;
* [https://ieeexplore.ieee.org/document/7841561 https://ieeexplore.ieee.org/document/7841561],&lt;br /&gt;
: [https://dblp.uni-trier.de/db/conf/globecom/globecom2016.html#Fernandez-Fernandez16 https://dblp.uni-trier.de/db/conf/globecom/globecom2016.html#Fernandez-Fernandez16],&lt;br /&gt;
: [https://upcommons.upc.edu/handle/2117/104406 https://upcommons.upc.edu/handle/2117/104406],&lt;br /&gt;
: [http://ieeexplore.ieee.org/document/7841561 http://ieeexplore.ieee.org/document/7841561],&lt;br /&gt;
: [https://doi.org/10.1109/GLOCOM.2016.7841561 https://doi.org/10.1109/GLOCOM.2016.7841561],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2583467198 https://academic.microsoft.com/#/detail/2583467198]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>