<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Andersson_et_al_2018a</id>
		<title>Andersson et al 2018a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Andersson_et_al_2018a"/>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Andersson_et_al_2018a&amp;action=history"/>
		<updated>2026-06-13T19:45:18Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=Andersson_et_al_2018a&amp;diff=191560&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 518814085 to Andersson et al 2018a</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Andersson_et_al_2018a&amp;diff=191560&amp;oldid=prev"/>
				<updated>2021-01-28T16:41:49Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_518814085&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 518814085&quot;&gt;Draft Content 518814085&lt;/a&gt; to &lt;a href=&quot;/public/Andersson_et_al_2018a&quot; title=&quot;Andersson et al 2018a&quot;&gt;Andersson et al 2018a&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:41, 28 January 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>http://www.colloquiam.com/wd/index.php?title=Andersson_et_al_2018a&amp;diff=191559&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==   end-to-end encryption on the Internet is becoming more prevalent, techniques such as deep packet inspection (DPI) can no longer be expected to be able to cla...&quot;</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Andersson_et_al_2018a&amp;diff=191559&amp;oldid=prev"/>
				<updated>2021-01-28T16:41:46Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==   end-to-end encryption on the Internet is becoming more prevalent, techniques such as deep packet inspection (DPI) can no longer be expected to be able to cla...&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;
 end-to-end encryption on the Internet is becoming more prevalent, techniques such as deep packet inspection (DPI) can no longer be expected to be able to classify traffic. In many cellular networks a large fraction of all traffic is video traffic, and being able to divide flows in the network into video and non-video can provide considerable traffic engineering benefits. In this study we examine machine learning based flow classification using features that are available also for encrypted flows. Using a data set of several several billion packets from a live cellular network we examine the obtainable classification performance for two different ensemble-based classifiers. Further, we contrast the classification performance of a statistical-based feature set with a less computationally demanding alternate feature set. To also examine the runtime aspects of the problem, we export the trained models and use a tailor-made C implementation to evaluate the runtime performance. The results quantify the trade-off between classification and runtime performance, and show that up to 1 million classifications per second can be achieved for a single core. Considering that only the subset of flows reaching some minimum flow length will need to be classified, the results are promising with regards to deployment also in scenarios with very high flow arrival rates.  HITS&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://kau.diva-portal.org/smash/get/diva2:1238751/FULLTEXT02 http://kau.diva-portal.org/smash/get/diva2:1238751/FULLTEXT02]&lt;br /&gt;
&lt;br /&gt;
* [http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-68705 http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-68705]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/8424835/8432202/08432263.pdf?arnumber=8432263 http://xplorestaging.ieee.org/ielx7/8424835/8432202/08432263.pdf?arnumber=8432263],&lt;br /&gt;
: [http://dx.doi.org/10.1109/aina.2018.00061 http://dx.doi.org/10.1109/aina.2018.00061]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/aina/aina2018.html#GarciaKAV18 https://dblp.uni-trier.de/db/conf/aina/aina2018.html#GarciaKAV18],&lt;br /&gt;
: [http://www.diva-portal.org/smash/record.jsf?pid=diva2:1238751 http://www.diva-portal.org/smash/record.jsf?pid=diva2:1238751],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2885862920 https://academic.microsoft.com/#/detail/2885862920]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>