<?xml version="1.0" encoding="UTF-8"?><xml><records><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%">Arian Bär</style></author><author><style face="normal" font="default" size="100%">Lukasz Golab</style></author><author><style face="normal" font="default" size="100%">Stefan Ruehrup</style></author><author><style face="normal" font="default" size="100%">Mirko Schiavone</style></author><author><style face="normal" font="default" size="100%">Pedro Casas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Cache Oblivious Scheduling of Shared Workloads</style></title><secondary-title><style face="normal" font="default" size="100%">31st IEEE International Conference on Data Engineering (ICDE)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/2015</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Seoul, Korea</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;Shared workload optimization is feasible if the set of tasks to be executed is known in advance, as is the case in updating a set of materialized views or executing an extract-transform-load workflow. In this paper, we consider dataintensive shared workloads with precedence constraints arising from data dependencies, i.e., before executing some task, other tasks may have to run first and generate some data needed by the next task(s). While there has been previous work on identifying common subexpressions in shared workloads and task re-ordering to enable shared scans, in this paper we go a step further and solve the problem of scheduling shared data-intensive workloads in a cache-oblivious way. Our solution relies on a novel formulation of precedence constrained scheduling with the additional constraint that once a data item is in the cache, all tasks that require this data item should execute as soon as possible thereafter. The intuition behind this formulation is that the longer a data item remains in the cache, the more likely it is to be evicted regardless of the cache size. We give an optimal ordering algorithm using A* search over the space of possible orderings, and we propose efficient and effective heuristics that obtain nearly-optimal results in much less time. We present experimental results on real-life data warehouse workloads and the TCP-DS benchmark to validate our claims.&lt;/p&gt;</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%">Arian Bär</style></author><author><style face="normal" font="default" size="100%">Philippe Svoboda</style></author><author><style face="normal" font="default" size="100%">Pedro Casas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">MTRAC - Discovering M2M Devices in Cellular Networks from Coarse-grained Measurements</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE International Conference on Communications (ICC)</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></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%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Saverio Niccolini</style></author><author><style face="normal" font="default" size="100%">Sofia Nikitaki</style></author><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%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Luigi Grimaudo</style></author><author><style face="normal" font="default" size="100%">Stefano Traverso</style></author><author><style face="normal" font="default" size="100%">Francesco Matera</style></author><author><style face="normal" font="default" size="100%">Edion Tego</style></author><author><style face="normal" font="default" size="100%">V, Guchev</style></author><author><style face="normal" font="default" size="100%">Zied Ben Houidi</style></author><author><style face="normal" font="default" size="100%">Pietro Michiardi</style></author><author><style face="normal" font="default" size="100%">Marco Milanesio</style></author><author><style face="normal" font="default" size="100%">YiXi Gong</style></author><author><style face="normal" font="default" size="100%">Dario Rossi</style></author><author><style face="normal" font="default" size="100%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">G, Dimopoulos</style></author><author><style face="normal" font="default" size="100%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">A, Bakay</style></author><author><style face="normal" font="default" size="100%">Arian Bär</style></author><author><style face="normal" font="default" size="100%">Pedro Casas</style></author><author><style face="normal" font="default" size="100%">Alessandro D'Alconzo</style></author><author><style face="normal" font="default" size="100%">Pierdomenico Fiadino</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Algorithm and Scheduler Design and Implementation</style></title><short-title><style face="normal" font="default" size="100%">D3.3</style></short-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">algorithm design</style></keyword><keyword><style  face="normal" font="default" size="100%">job scheduler</style></keyword><keyword><style  face="normal" font="default" size="100%">mPlane software</style></keyword><keyword><style  face="normal" font="default" size="100%">repository tools</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%">09/2014</style></date></pub-dates></dates><isbn><style face="normal" font="default" size="100%">D3.3</style></isbn><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%">Pedro Casas</style></author><author><style face="normal" font="default" size="100%">Alessandro D'Alconzo</style></author><author><style face="normal" font="default" size="100%">Pierdomenico Fiadino</style></author><author><style face="normal" font="default" size="100%">Arian Bär</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the Analysis of QoE-based Performance Degradation in YouTube Traffic</style></title><secondary-title><style face="normal" font="default" size="100%">10th International Conference on Network and Service Management, CNSM 2014</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">clustering</style></keyword><keyword><style  face="normal" font="default" size="100%">Content Delivery Networks</style></keyword><keyword><style  face="normal" font="default" size="100%">Empirical Entropy</style></keyword><keyword><style  face="normal" font="default" size="100%">Performance Degradation</style></keyword><keyword><style  face="normal" font="default" size="100%">Quality of Experience</style></keyword><keyword><style  face="normal" font="default" size="100%">YouTube</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%">11/2014</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Rio de Janeiro, Brazil</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;YouTube is the most popular service in today's Internet. Google relies on its massive Content Delivery Network (CDN) to push YouTube videos as close as possible to the end-users to improve their Quality of Experience (QoE), as well as to pursue its own optimization goals. Adopting space and time variant traffic delivery policies, Google servers handle users' requests from multiple geo-distributed locations at different times. Such traffic delivery policies can have a relevant impact on the traffic routed through the Internet Service Providers (ISPs) providing the access, but most importantly, they can have negative effects on the end-user QoE. In this paper we shed light on the problem of diagnosing QoE-based performance degradation events in YouTube's traffic. Through the analysis of one month of YouTube flow traces collected at the network of a large European ISP, we particularly identify and drill down a Google's CDN server selection policy negatively impacting the watching experience of YouTube users during several days at peak-load times. The analysis combines both the user-side perspective and the CDN perspective of the end-to-end YouTube delivery service to diagnose the problem. On the one hand, we rely on the monitoring of YouTube QoE-based Key Performance Indicators (KPIs) to detect performance degradation events affecting the end-customers. On the other hand, we analyze the temporal behavior of the Google CDN traffic delivery policies, by tracking the activity of the Google servers providing the videos. The analysis is supported by time-series analysis, entropy-based approaches, and clustering techniques to flag the aforementioned anomaly. The main contributions of the paper are threefold: firstly, we provide a large-scale characterization of the YouTube service in terms of traffic characteristics and provisioning behavior of the Google CDN servers. Secondly, we introduce simple yet effective QoE-based KPIs to monitor YouTube videos from the end-user perspective. Finally and most important, we analyze and provide evidence of the occurrence of QoE-based YouTube anomalies induced by CDN server selection policies, which are somehow normally hidden from the common knowledge of the end-user. This is a main issue for ISPs, who see their reputation degrade when such events occur, even if Google is the culprit.&lt;/p&gt;</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%">Pierdomenico Fiadino</style></author><author><style face="normal" font="default" size="100%">Alessandro D'Alconzo</style></author><author><style face="normal" font="default" size="100%">Arian Bär</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Pedro Casas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the Detection of Network Traffic Anomalies in Content Delivery Network Services</style></title><secondary-title><style face="normal" font="default" size="100%">ITC26</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%">09/2014</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Karlskrona, Sweden</style></pub-location><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%">Arian Bär</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Pedro Casas</style></author><author><style face="normal" font="default" size="100%">Lukasz Golab</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%">Large-Scale Network Traffic Monitoring with DBStream, a System for Rolling Big Data Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Big Data, IEEE BigData</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Big Data Analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">Data Stream Processing</style></keyword><keyword><style  face="normal" font="default" size="100%">network data analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">System Performance</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%">11/2014</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Washington D.C., 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;The complexity of the Internet has rapidly increased, making it more important and challenging to design scalable network monitoring tools. Network monitoring typically requires rolling data analysis, i.e., continuously and incrementally updating (rolling-over) various reports and statistics over high-volume data streams. In this paper, we describe DBStream, which is an SQL-based system that explicitly supports incremental queries for rolling data analysis. We also present a performance comparison of DBStream with a parallel data processing engine (Spark), showing that, in some scenarios, a single DBStream node can outperform a cluster of ten Spark nodes on rolling network monitoring workloads. Although our performance evaluation is based on network monitoring data, our results can be generalized to other big data problems with high volume and velocity.&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%">Brian Trammell</style></author><author><style face="normal" font="default" size="100%">Pedro Casas</style></author><author><style face="normal" font="default" size="100%">Dario Rossi</style></author><author><style face="normal" font="default" size="100%">Arian Bär</style></author><author><style face="normal" font="default" size="100%">Zied Ben-Houidi</style></author><author><style face="normal" font="default" size="100%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">Tivadar Szemethy</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%">mPlane: an Intelligent Measurement Plane for the Internet</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Communications Magazine, Special Issue on Monitoring and Troubleshooting Multi-domain Networks using Measurement Federations</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%">05/2014</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">42</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">5</style></issue></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%">Pedro Casas</style></author><author><style face="normal" font="default" size="100%">Pierdomenico Fiadino</style></author><author><style face="normal" font="default" size="100%">Arian Bär</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Understanding HTTP Traffic and CDN Behavior from the Eyes of a Mobile ISP</style></title><secondary-title><style face="normal" font="default" size="100%">Passive and Active Measurements Conference (PAM)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><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%">Alessandro D'Alconzo</style></author><author><style face="normal" font="default" size="100%">Pedro Casas</style></author><author><style face="normal" font="default" size="100%">Pierdomenico Fiadino</style></author><author><style face="normal" font="default" size="100%">Arian Bär</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Who to Blame when YouTube is not Working? Detecting Anomalies in CDN Provisioned Services</style></title><secondary-title><style face="normal" font="default" size="100%">TRAC</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%">08/2014</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Nicosia, Cyprus</style></pub-location><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%">Pedro Casas</style></author><author><style face="normal" font="default" size="100%">Pierdomenico Fiadino</style></author><author><style face="normal" font="default" size="100%">Arian Bär</style></author><author><style face="normal" font="default" size="100%">Alessandro D'Alconzo</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%">YouTube All Around: Characterizing YouTube from Mobile and Fixed-line Network Vantage Points</style></title><secondary-title><style face="normal" font="default" size="100%">EuCNC</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%">06/2014</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Bologna, IT</style></pub-location><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>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pietro Michiardi</style></author><author><style face="normal" font="default" size="100%">Antonio Barbuzzi</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Stefano Traverso</style></author><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><author><style face="normal" font="default" size="100%">A. Rufini</style></author><author><style face="normal" font="default" size="100%">Francesco Matera</style></author><author><style face="normal" font="default" size="100%">A. Valentii</style></author><author><style face="normal" font="default" size="100%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Mohamed Ahmed</style></author><author><style face="normal" font="default" size="100%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">L. Németh</style></author><author><style face="normal" font="default" size="100%">R. Szalay</style></author><author><style face="normal" font="default" size="100%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">Yan Grunenberger</style></author><author><style face="normal" font="default" size="100%">P. Casas</style></author><author><style face="normal" font="default" size="100%">Alessandro D’Alconzo</style></author><author><style face="normal" font="default" size="100%">A Bär</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">YiXi Gong</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Basic Network Data Analysis</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">big data</style></keyword><keyword><style  face="normal" font="default" size="100%">storage</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%">05/2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">D3.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%">&lt;p&gt;This document describes the requirements, input, output for the algorithms needed to perform analytic tasks on a large amount of data, in the context of WP3. Starting from the use cases defined in WP1, we identify the algorithms needed to address the various scenario requirements. Operating on a large amount of data, these algorithms strive for parallel and scalable approaches; the designing and implementation of the algorithm itself can be a challenging research task since today very little is known concerning how to develop efficient and scalable algorithms that runs on parallel processing frameworks.&lt;br /&gt;The algorithm in the storage layer are characterized by the fact that they operate on a large amount of data, and produce a concise representation of it, extracting features and aggregating it, so that the produced output is easier to handle and understand. Depending on the amount of data produced, on the scenario characteristics and on the time constraints, algorithms can require a real time (or near real time) or a batch processing.&lt;br /&gt;For each algorithm and use case, the input data and the initial state, the computation to run and the output produced are described.&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>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">A Bär</style></author><author><style face="normal" font="default" size="100%">P. Casas</style></author><author><style face="normal" font="default" size="100%">Alessandro D’Alconzo</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Antonio Barbuzzi</style></author><author><style face="normal" font="default" size="100%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Gianni De Rosa</style></author><author><style face="normal" font="default" size="100%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">Jordan Augé</style></author><author><style face="normal" font="default" size="100%">Marc-Oliver Buob</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Database Layer Design</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">big data</style></keyword><keyword><style  face="normal" font="default" size="100%">databases</style></keyword><keyword><style  face="normal" font="default" size="100%">repositories</style></keyword><keyword><style  face="normal" font="default" size="100%">storage</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%">11/2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">D3.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><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%">Pierdomenico Fiadino</style></author><author><style face="normal" font="default" size="100%">A Bär</style></author><author><style face="normal" font="default" size="100%">P. Casas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">HTTPTag: A Flexible On-line HTTP Classification System for Operational 3G Networks</style></title><secondary-title><style face="normal" font="default" size="100%">INFOCOM'2013 Demo/Poster Session (INFOCOM'2013 - Demo/Poster Session)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">3G Networks</style></keyword><keyword><style  face="normal" font="default" size="100%">HTTP</style></keyword><keyword><style  face="normal" font="default" size="100%">Pattern Matching</style></keyword><keyword><style  face="normal" font="default" size="100%">Traffic Classification</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><pub-location><style face="normal" font="default" size="100%">Turin, Italy</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;The popularity of web-based services and applications like YouTube and Facebook has taken HTTP back to the pole position on end-user traffic consumption. We present HTTPTag, a flexible on-line HTTP classification system based on pattern matching and tagging. HTTPTag recognizes on the fly and tracks the evolution of more than 280 applications running on top of HTTP in an operational 3G network, representing more than 70\% of the total HTTP traffic volume consumed by its customers. HTTPTag improves the network traffic visibility of an operator, performing tasks such as top-services ranking, long-term monitoring of applications popularity, and trend analysis among others.&lt;/p&gt;</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%">Pedro Casas</style></author><author><style face="normal" font="default" size="100%">Pierdomenico Fiadino</style></author><author><style face="normal" font="default" size="100%">Arian Bär</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">IP Mining: Extracting Knowledge from the Dynamics of the Internet Addressing Space (BEST PAPER AWARD)</style></title><secondary-title><style face="normal" font="default" size="100%">25th International Teletraffic Congress, ITC 25</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Content Delivery Networks</style></keyword><keyword><style  face="normal" font="default" size="100%">HTTP Traffic</style></keyword><keyword><style  face="normal" font="default" size="100%">IP Addressing Space</style></keyword><keyword><style  face="normal" font="default" size="100%">Traffic Classification and 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;Going back to the Internet of one decade ago, HTTP-based content and web services were provided by centralized or barely distributed servers. Single hosts providing exclusive services at fixed IP addresses was the standard approach. Current situation has drastically changed, and the mapping of IPs to different content and services is nowadays extremely dynamic. The adoption of large CDNs by major Internet players, the extended usage of transparent content caching, the explosion of Cloud-based services, and the decoupling between content providers and the hosting infrastructure have created a difficult to manage Internet landscape. Understanding such a complex scenario is paramount for network operators, both to control the traffic on their networks and to improve the quality experienced by their customers, specially when something goes wrong. Using a full week of HTTP traffic traces collected at the mobile broadband network of a major European ISP, this paper studies the associations between web services, the hosting organizations-ASes, and the content servers' IPs. By mining correlations among these, we extract useful insights about the dynamics of the IP addressing space used by the top web services, and the way content providers and hosting organizations deliver their services to the mobile endusers. The extracted knowledge is applied on two specific use-cases, the former on hosting and service delivery characterization, the latter on automatic IP-based HTTP services classification.&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%">Brian Trammell</style></author><author><style face="normal" font="default" size="100%">Stephan Neuhaus</style></author><author><style face="normal" font="default" size="100%">Francesco Matera</style></author><author><style face="normal" font="default" size="100%">Ernst Biersack</style></author><author><style face="normal" font="default" size="100%">Antonio Barbuzzi</style></author><author><style face="normal" font="default" size="100%">Saverio Niccolini</style></author><author><style face="normal" font="default" size="100%">Mohamed Ahmed</style></author><author><style face="normal" font="default" size="100%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">Balazs Szabo</style></author><author><style face="normal" font="default" size="100%">P. Casas</style></author><author><style face="normal" font="default" size="100%">A Bär</style></author><author><style face="normal" font="default" size="100%">Konstantina Papagiannaki</style></author><author><style face="normal" font="default" size="100%">Yan Grunenberger</style></author><author><style face="normal" font="default" size="100%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">Rolf Winter</style></author><author><style face="normal" font="default" size="100%">Zied Ben-Houidi</style></author><author><style face="normal" font="default" size="100%">Giovanna Carofiglio</style></author><author><style face="normal" font="default" size="100%">Samir Ghamri-Doudane</style></author><author><style face="normal" font="default" size="100%">Diego Perino</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Use Case Elaboration and Requirements Specification</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">architecture</style></keyword><keyword><style  face="normal" font="default" size="100%">measurement</style></keyword><keyword><style  face="normal" font="default" size="100%">platform</style></keyword><keyword><style  face="normal" font="default" size="100%">scenario</style></keyword><keyword><style  face="normal" font="default" size="100%">use case</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%">01/2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">D1.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%">&lt;p&gt;&lt;span&gt;The document defines the requirements for the mPlane architecture on the background of a set of scenarios explored by the consortium, a survey of existing comparable measurement systems and platforms and applicable standards therefore, and a set of architectural first principles drawn from the description of work and the consortium's experience.&amp;nbsp;As mPlane is intended to be a fully flexible measurement platform, freely integrating existing probes and repositories with ones to be developed in the project, this document is primarily concerned with the definition of interfaces among mPlane components. While it does enumerate capabilities to be provided by these components, these are primarily intended to ensure the platform has the flexibility required to meet all the scenarios envisioned; the enumerations of measurements, metrics, data types, and other component capabilities are therefore not to be construed to limit the scope of work on components within the project to just those scenarios treated in this document; nor do the scenarios enumerated here define the capabilities to be demonstrated in the project's integrated trial.&amp;nbsp;&lt;/span&gt;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Public Deliverable</style></work-type></record></records></xml>