<?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%">Pedro Casas</style></author><author><style face="normal" font="default" size="100%">Martin Varela</style></author><author><style face="normal" font="default" size="100%">Pierdomenico Fiadino</style></author><author><style face="normal" font="default" size="100%">Mirko Schiavone</style></author><author><style face="normal" font="default" size="100%">Helena Rivas</style></author><author><style face="normal" font="default" size="100%">Raimund Schatz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the Analysis of QoE in Cellular Networks: from Subjective Tests to Large-scale Traffic Measurements</style></title><secondary-title><style face="normal" font="default" size="100%">6th International Workshop on Traffic Analysis and Characterization (TRAC)</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>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%">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%">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%">Challenging Entropy-based Anomaly Detection and Diagnosis in Cellular Networks</style></title><secondary-title><style face="normal" font="default" size="100%">ACM SIGCOMM</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>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%">Mirko Schiavone</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">QoMOSN - On the Analysis of Traffic and Quality of Experience in Mobile Online Social Networks</style></title><secondary-title><style face="normal" font="default" size="100%">European Conference on Networks and Communications (EuCNC)</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>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%">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%">RCATool - A Framework for Detecting and Diagnosing Anomalies in Cellular Networks</style></title><secondary-title><style face="normal" font="default" size="100%">27th International Teletraffic Congress (ITC)</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>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%">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%">Towards Automatic Detection and Diagnosis of Internet Service Anomalies via DNS Traffic Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">6th International Workshop on Traffic Analysis and Characterization (TRAC)</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>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%">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%">Vivisecting WhatsApp through Large-Scale Measurements in Mobile Networks</style></title><secondary-title><style face="normal" font="default" size="100%">SIGCOMM 2014</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Large-Scale Measurements</style></keyword><keyword><style  face="normal" font="default" size="100%">mobile networks</style></keyword><keyword><style  face="normal" font="default" size="100%">WhatsApp</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%">08/2014</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">Chicago, 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;WhatsApp, the new giant in instant multimedia messaging in mobile networks is rapidly increasing its popularity, taking over the traditional SMS/MMS messaging. In this paper we present the first large-scale characterization of WhatsApp, useful among others to ISPs willing to understand the impacts of this and similar applications on their networks. Through the combined analysis of passive measurements at the core of a national mobile network, worldwide geo-distributed active measurements, and traffic analysis at end devices, we show that: (i) the WhatsApp hosting architecture is highly centralized and exclusively located in the US; (ii) video sharing covers almost 40% of the total WhatsApp traffic volume; (iii) flow characteristics depend on the OS of the end device; (iv) despite the big latencies to US servers, download throughputs are as high as 1.5 Mbps; (v) users react immediately and negatively to service outages through social networks feedbacks.&lt;/p&gt;</style></abstract></record></records></xml>