<?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=Antichi_et_al_2019a</id>
		<title>Antichi et al 2019a - 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=Antichi_et_al_2019a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Antichi_et_al_2019a&amp;action=history"/>
		<updated>2026-06-10T20:01:48Z</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=Antichi_et_al_2019a&amp;diff=205879&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 550852118 to Antichi et al 2019a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Antichi_et_al_2019a&amp;diff=205879&amp;oldid=prev"/>
				<updated>2021-02-03T16:52:20Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_550852118&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 550852118&quot;&gt;Draft Content 550852118&lt;/a&gt; to &lt;a href=&quot;/public/Antichi_et_al_2019a&quot; title=&quot;Antichi et al 2019a&quot;&gt;Antichi et al 2019a&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:52, 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=Antichi_et_al_2019a&amp;diff=205878&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  The advent of Software-Defined Networking with OpenFlow first, and subsequently the emergence of programmable data planes, has boosted lot of research around...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Antichi_et_al_2019a&amp;diff=205878&amp;oldid=prev"/>
				<updated>2021-02-03T16:52:17Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  The advent of Software-Defined Networking with OpenFlow first, and subsequently the emergence of programmable data planes, has boosted lot of research around...&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;
The advent of Software-Defined Networking with OpenFlow first, and subsequently the emergence of programmable data planes, has boosted lot of research around many networking aspects: monitoring, security, traffic engineering. In the context of network monitoring, most of the proposed solutions show the benefits of data plane programmability by simplifying the complexity of the network with a one big-switch abstraction. Only few papers look at network-wide solutions, but consider the network as non heterogeneous: only composed by programmable devices. In this paper, we argue that the primary challenge for a successful adoption of those solutions is the deployment problem: how to compose and monitor a network consisting of both legacy and programmable switches? We propose an approach for incrementally deploy programmable devices in an ISP network with the goal of monitoring as many distinct network flows as possible. While assessing the benefits of our solution, we realized that proposed network-wide monitoring algorithms might not be optimized for a partial deployment scenario. We then also developed a novel strategy capable of detecting network-wide heavy flows with the same accuracy of state-of-the-art solutions but by relying on less information from the data plane.&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/10281/273145 http://hdl.handle.net/10281/273145]&lt;br /&gt;
&lt;br /&gt;
* [https://boa.unimib.it/bitstream/10281/273145/1/2019__Netsoft_Incremental_Deployment.pdf https://boa.unimib.it/bitstream/10281/273145/1/2019__Netsoft_Incremental_Deployment.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/8792325/8806619/08806649.pdf?arnumber=8806649 http://xplorestaging.ieee.org/ielx7/8792325/8806619/08806649.pdf?arnumber=8806649],&lt;br /&gt;
: [http://dx.doi.org/10.1109/netsoft.2019.8806649 http://dx.doi.org/10.1109/netsoft.2019.8806649]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/netsoft/netsoft2019.html#DingSAS19 https://dblp.uni-trier.de/db/conf/netsoft/netsoft2019.html#DingSAS19],&lt;br /&gt;
: [https://cris.fbk.eu/handle/11582/317869 https://cris.fbk.eu/handle/11582/317869],&lt;br /&gt;
: [https://boa.unimib.it/handle/10281/273145 https://boa.unimib.it/handle/10281/273145],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2969517360 https://academic.microsoft.com/#/detail/2969517360]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>