<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Edion Tego</style></author><author><style face="normal" font="default" size="100%">Elena Mammi</style></author><author><style face="normal" font="default" size="100%">Ariana Rufini</style></author><author><style face="normal" font="default" size="100%">Francesco Matera</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SLA verification and certification, Traffic Monitoring and Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">Traffic Monitoring and Analysis (TMA), Barcellona, 21-25 April 2015.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Poster</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Hadrien Hours</style></author><author><style face="normal" font="default" size="100%">Ernst Biersack</style></author><author><style face="normal" font="default" size="100%">Patrick Loiseau</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Marco Mellia</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Study of the Impact of DNS Resolvers on Performance Using a Causal Approach</style></title><secondary-title><style face="normal" font="default" size="100%">Internet Teletraffic Congress</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">DNS</style></keyword><keyword><style  face="normal" font="default" size="100%">reasoner</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08/2015</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Ghent, Belgium</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">For a user to access any resource on the Internet, it is necessary to first locate a server hosting the requested resource. The Domain Name System service (DNS) represents the first step in this process, translating a human readable name, the resource host name, into an IP address. With the expansion of Content Distribution Networks (CDNs), the DNS service has seen its importance increase. In a CDN, objects are replicated on different servers to decrease the distance from the client to a server hosting the object that needs to be accessed. The DNS service should improve user experience by directing its demand to the optimal CDN server. While most of the Internet Service Providers (ISPs) offer a DNS service to their customers, it is now common to see clients using a public DNS service instead. This choice may have an impact on Web browsing performance. In this paper we study the impact of choosing one DNS server instead of another and we compare the performance of a large European ISP DNS service with the one of a public DNS service, Google DNS. We propose a causal approach to expose the structural dependencies of the different parameters impacted by the DNS service used and we show how to model these dependencies with a Bayesian network. This model allows us to explain and quantify the benefits obtained by clients using their ISP DNS service and to propose a solution to further improve their performance.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">S. Colabrese</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">Marco Mellia</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Scalable accurate consolidation of passively measured statistical data</style></title><secondary-title><style face="normal" font="default" size="100%">Passive and Active Measurement (PAM), Extended Abstract</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">March</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://perso.telecom-paristech.fr/~drossi/paper/rossi14pam-a.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Los Angeles, USA</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Passive probes continuously collect a significant amount of traffic vol- ume, and autonomously generate statistics on a large number of metrics. A common statistical output of passive probe is represented by probability mass functions (pmf). The need for consolidation of several pmfs arises in two contexts, namely: (i) whenever a central point collects and aggregates measurement of multiple disjoint vantage points, and (ii) whenever a local measurement processed at a single vantage point needs to be distributed over multiple cores of the same physical probe, in order to cope with growing link capacity. Taking an experimental approach, we study both cases assessing the impact of different consolidation strategies, obtaining general design and tuning guidelines.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luigi Grimaudo</style></author><author><style face="normal" font="default" size="100%">Marco Mellia</style></author><author><style face="normal" font="default" size="100%">Elena Baralis</style></author><author><style face="normal" font="default" size="100%">Ram Keralapura</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SeLeCT: Self-Learning Classifier for Internet Traffic</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Transactions on Network and Service Management</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">clustering</style></keyword><keyword><style  face="normal" font="default" size="100%">self-seeding</style></keyword><keyword><style  face="normal" font="default" size="100%">Traffic Classification</style></keyword><keyword><style  face="normal" font="default" size="100%">unsupervised machine learning</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">06/2014</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">11</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Network visibility is a critical part of traffic engineering, network management, and security. The most popular&amp;nbsp;current solutions - Deep Packet Inspection (DPI) and statistical&amp;nbsp;classification, deeply rely on the availability of a training set.&amp;nbsp;Besides the cumbersome need to regularly update the signatures,&amp;nbsp;their visibility is limited to classes the classifier has been trained&amp;nbsp;for. Unsupervised algorithms have been envisioned as a viable&amp;nbsp;alternative to automatically identify classes of traffic. However,&amp;nbsp;the accuracy achieved so far does not allow to use them for traffic&amp;nbsp;classification in practical scenario.&lt;/p&gt;&lt;p&gt;To address the above issues, we propose SeLeCT, a Self-Learning Classifier for Internet Traffic. It uses unsupervised algorithms along with an adaptive seeding approach to automatically&amp;nbsp;let classes of traffic emerge, being identified and labeled. Unlike&amp;nbsp;traditional classifiers, it requires neither a-priori knowledge of&amp;nbsp;signatures nor a training set to extract the signatures. Instead,&amp;nbsp;SeLeCT automatically groups flows into pure (or homogeneous)&amp;nbsp;clusters using simple statistical features. SeLeCT simplifies label&amp;nbsp;assignment (which is still based on some manual intervention) so&amp;nbsp;that proper class labels can be easily discovered. Furthermore,&amp;nbsp;SeLeCT uses an iterative seeding approach to boost its ability to&amp;nbsp;cope with new protocols and applications.&lt;/p&gt;&lt;p&gt;We evaluate the performance of SeLeCT using traffic traces&amp;nbsp;collected in different years from various ISPs located in 3&amp;nbsp;different continents. Our experiments show that SeLeCT achieves&amp;nbsp;excellent precision and recall, with overall accuracy close to 98%.&amp;nbsp;Unlike state-of-art classifiers, the biggest advantage of SeLeCT&amp;nbsp;is its ability to discover new protocols and applications in an&amp;nbsp;almost automated fashion.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue><section><style face="normal" font="default" size="100%">144</style></section></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Daniele Apiletti</style></author><author><style face="normal" font="default" size="100%">Elena Baralis</style></author><author><style face="normal" font="default" size="100%">Tania Cerquitelli</style></author><author><style face="normal" font="default" size="100%">Silvia Chiusano</style></author><author><style face="normal" font="default" size="100%">Luigi Grimaudo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SEARUM: a cloud-based SErvice for Association RUle Mining</style></title><secondary-title><style face="normal" font="default" size="100%">The 11th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA-13)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">association rule mining</style></keyword><keyword><style  face="normal" font="default" size="100%">cloud-based service</style></keyword><keyword><style  face="normal" font="default" size="100%">distributed computing model</style></keyword><keyword><style  face="normal" font="default" size="100%">network data analysis</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Large volumes of data are being produced by various modern applications at an ever increasing rate. These applications range from wireless sensors networks to social networks. The automatic analysis of such huge data volume is a challenging task since a large amount of interesting knowledge can be extracted. Association rule mining is an exploratory data analysis method able to discover interesting and hidden correlations among data. Since this data mining process is characterized by computationally intensive tasks, efficient distributed approaches are needed to increase its scalability. This paper proposes a novel cloud-based service, named SEARUM, to efficiently mine association rules on a distributed computing model. SEARUM consists of a series of distributed MapReduce jobs run in the cloud. Each job performs a different step in the association rule mining process. As a case study, the proposed approach has been applied to the network data scenario. The experimental validation, performed on two real network datasets, shows the effectiveness and the efficiency of&amp;nbsp;SEARUM in mining association rules on a distributed computing model.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dimitri Papadimitriou</style></author><author><style face="normal" font="default" size="100%">Dario Rossi</style></author><author><style face="normal" font="default" size="100%">YiXi Gong</style></author><author><style face="normal" font="default" size="100%">Brian Trammell</style></author><author><style face="normal" font="default" size="100%">Marco Milanesio</style></author><author><style face="normal" font="default" size="100%">Ernst Biersack</style></author><author><style face="normal" font="default" size="100%">Rolf Winter</style></author><author><style face="normal" font="default" size="100%">Francesco Matera</style></author><author><style face="normal" font="default" size="100%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Balazs Szabo</style></author><author><style face="normal" font="default" size="100%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Marco Mellia</style></author><author><style face="normal" font="default" size="100%">Alessandro Capello</style></author><author><style face="normal" font="default" size="100%">Fabio Invernizzi</style></author><author><style face="normal" font="default" size="100%">Omar Jabr</style></author><author><style face="normal" font="default" size="100%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">Benoit Donnet</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Selection of Existing Probes and Datasets</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">active probes</style></keyword><keyword><style  face="normal" font="default" size="100%">existing probes</style></keyword><keyword><style  face="normal" font="default" size="100%">passive probes</style></keyword><keyword><style  face="normal" font="default" size="100%">probes</style></keyword><keyword><style  face="normal" font="default" size="100%">proxy probes</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08/2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">D2.1</style></number><publisher><style face="normal" font="default" size="100%">mPlane Consortium</style></publisher><pub-location><style face="normal" font="default" size="100%">Torino</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The mPlane architecture has been designed to include the possibility to interface with existing systems and platforms. While most measurement platforms in existence target a very specific measurement use case (e.g., the discovery of the Internet's router-level topology, the continuous measurement of the RTT among host pairs, the exporting via SNMP of network state, etc.), there are platforms that have a large deployed base, with lot of data being at disposal, and/or continuously
collecting data. It would be a waste of resources to merely reproduce this effort within mPlane. Instead, mPlane aims at directly interfacing with existing systems and re-using their capabilities and data to feed measurement results to the mPlane intelligence. This document lists selected existing systems that are important for mPlane either for theoretical, conceptual or practical reasons, and that are part of the background of mPlane partners. A sub-set of these systems will be eventually incorporated into mPlane by developing the necessary interfaces. Others could be integrated by the means of proxy probes,
i.e., the conceptual component responsible for such interfacing. The main focus of this document is to elaborate the concept of proxy probes, enumerate the systems that will be possibly considered for interface (proxy probe) development, and to
give high level descriptions of the proxy probe design for these systems. The following list enumerates the systems that the consortium has chosen to include:
- QoF - a TCP-aware IPFIX flow meter  Cisco Ping and SLA Agents - commercial availability and basic network parameter agents  
- Tracebox - a tool for middlebox detection and identification
- Scamper - a sophisticated active probing tool
- MERLIN - a router-level topology discovery tool
- TopHat - a configurable measurement system on top of PlanetLab
- Tstat - a passive network monitoring tool
- BlockMon - a flexible network monitoring and analysis tool
- MisuraInternet - a QoS measurement system
- Firelog - a Firefox plugin to measure HTTP QoE
- Pytomo - an end-host-based video OoE measurement tool
- DATI - a high performance deep packet inspector
- MobiPerf - a tool for monitoring smartphone performance</style></abstract><work-type><style face="normal" font="default" size="100%">Public Deliverable</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luigi Grimaudo</style></author><author><style face="normal" font="default" size="100%">Marco Mellia</style></author><author><style face="normal" font="default" size="100%">Elena Baralis</style></author><author><style face="normal" font="default" size="100%">Ram Keralapura</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Self-Learning Classifier for Internet Traffic</style></title><secondary-title><style face="normal" font="default" size="100%">The 5th IEEE International Traffic Monitoring and Analysis Workshop (TMA 2013)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Network visibility is a critical part of traffic engineering, network management, and security. Recently, unsupervised algorithms have been envisioned as a viable alternative&amp;nbsp;to automatically identify classes of traffic. However, the accuracy&amp;nbsp;achieved so far does not allow to use them for traffic classification&amp;nbsp;in practical scenario.&lt;br /&gt;In this paper, we propose SeLeCT, a Self-Learning Classifier&amp;nbsp;for Internet traffic. It uses unsupervised algorithms along with&amp;nbsp;an adaptive learning approach to automatically let classes of&amp;nbsp;traffic emerge, being identified and (easily) labeled. SeLeCT&amp;nbsp;automatically groups flows into pure (or homogeneous) clusters&amp;nbsp;using alternating simple clustering and filtering phases to remove&amp;nbsp;outliers. SeLeCT uses an adaptive learning approach to boost its&amp;nbsp;ability to spot new protocols and applications. Finally, SeLeCT&amp;nbsp;also simplifies label assignment (which is still based on some&amp;nbsp;manual intervention) so that proper class labels can be easily&amp;nbsp;discovered.&lt;br /&gt;We evaluate the performance of SeLeCT using traffic traces&amp;nbsp;collected in different years from various ISPs located in 3&amp;nbsp;different continents. Our experiments show that SeLeCT achieves&amp;nbsp;overall accuracy close to 98%. Unlike state-of-art classifiers, the&amp;nbsp;biggest advantage of SeLeCT is its ability to help discovering&amp;nbsp;new protocols and applications in an almost automated fashion.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gianni De Rosa</style></author><author><style face="normal" font="default" size="100%">Stefano Pentassuglia</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Specification of mPlane Access Control and Data Protection Mechanisms</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">access control</style></keyword><keyword><style  face="normal" font="default" size="100%">anonymisation</style></keyword><keyword><style  face="normal" font="default" size="100%">authentication plane</style></keyword><keyword><style  face="normal" font="default" size="100%">privacy</style></keyword><keyword><style  face="normal" font="default" size="100%">security</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08/2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">D1.2</style></number><publisher><style face="normal" font="default" size="100%">mPlane Consortium</style></publisher><pub-location><style face="normal" font="default" size="100%">Torino</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This document primarily defines security specifications for the mPlane architecture (in terms of authentication, access control and safe communications), on the basis of what specified in the D1.1. Also, it provides a description of the measures that can be adopted in order to guarantee the privacy of the data gathered through the probes. This aspect of the mPlane infrastructure must not be neglected, since from a legal point of view the users' right to privacy must be protected in any case. The techniques to be adopted are anonymization and aggregation, but utility of data decreases as the level of privacy increases, hence it is necessary to find a good trade-off. Two protocols are proposed for secure communications among components: TLS and SSH, which adopt respectively X.509 certificates and RSA keys for identity management. As the access control policy that will be adopted depends mostly on the mPlane administrators' choices, this document provides a survey of several approaches. The cross-domain and the mobile scenarios are also analyzed, providing solutions that can guarantee access control, security and privacy.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Public Deliverable</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bagnulo  Marcelo</style></author><author><style face="normal" font="default" size="100%">Eardley Philip</style></author><author><style face="normal" font="default" size="100%">Burbridge Trevor</style></author><author><style face="normal" font="default" size="100%">Brian Trammell</style></author><author><style face="normal" font="default" size="100%">Rolf Winter</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Standardizing large-scale measurement platforms</style></title><secondary-title><style face="normal" font="default" size="100%">SIGCOMM Comput. Commun. Rev.</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">design</style></keyword><keyword><style  face="normal" font="default" size="100%">ietf</style></keyword><keyword><style  face="normal" font="default" size="100%">measurement platforms</style></keyword><keyword><style  face="normal" font="default" size="100%">standardization</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://doi.acm.org/10.1145/2479957.2479967</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">43</style></volume><pages><style face="normal" font="default" size="100%">58–63</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mirja Kuehlewind</style></author><author><style face="normal" font="default" size="100%">Sebastian Neuner</style></author><author><style face="normal" font="default" size="100%">Brian Trammell</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the state of ECN and TCP Options on the Internet</style></title><secondary-title><style face="normal" font="default" size="100%">Passive and Active Measurement Conference (PAM)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">03/2013</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Hong Kong</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span&gt;Explicit Congestion Notification (ECN) is a TCP/IP extension that can avoid packet loss and thus improve network performance. Though standardized in 2001, it is barely used in today’s Internet. This study, following on previous active measurement studies over the past decade, shows marked and continued increase in the deployment of ECN-capable servers, and usability of ECN on the majority of paths to such servers. We additionally present new measurements of ECN on IPv6, passive observation of actual ECN usage from flow data, and observations on other congestion-relevant TCP options (SACK, Timestamps and Window Scaling). We further present initial work on burst loss metrics for loss-based congestion control following from our findings.&amp;nbsp;&lt;/span&gt;&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Simoncelli, Davide</style></author><author><style face="normal" font="default" size="100%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Francesco Gringoli</style></author><author><style face="normal" font="default" size="100%">Saverio Niccolini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Stream-monitoring with blockmon: convergence of network measurements and data analytics platforms</style></title><secondary-title><style face="normal" font="default" size="100%">SIGCOMM Comput. Commun. Rev.</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">data analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">distributed computing</style></keyword><keyword><style  face="normal" font="default" size="100%">performance analysis</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://doi.acm.org/10.1145/2479957.2479962</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">43</style></volume><pages><style face="normal" font="default" size="100%">29–36</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>