<?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%">P. Casoria</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><author><style face="normal" font="default" size="100%">T. Friedman</style></author><author><style face="normal" font="default" size="100%">A. Pescape</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Distributed active measurement of Internet queuing delays</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://www.enst.fr/ drossi/paper/rossi14pam-b.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;Despite growing link capacities, over-dimensioned buffers are still causing, in the Internet of the second decade of the third millenium, hosts to suffer from severe queuing delays (or bufferbloat). While maximum bufferbloat possibly exceeds few seconds, it is far less clear how often this maximum is hit in practice. This paper reports on our ongoing work to build a spatial and temporal map of Internet bufferbloat, describing a system based on distributed agents running on PlanetLab that aims at providing a quantitative answer to the above question.&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%">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>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>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">C. Testa</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">A. Rao</style></author><author><style face="normal" font="default" size="100%">A. Legout</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Plane Throughput vs Control Plane Delay: Experimental Study of BitTorrent Performance</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE P2P'XIII</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%">09/2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.enst.fr/ drossi/paper/rossi13p2p-a.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper, we address the trade-off between the data plane efficiency and the control plane timeliness for the BitTorrent performance. We argue that loss-based congestion control protocols can fill large buffers, leading to a higher end-to-end delay, unlike low-priority or delay-based congestion control protocols. We perform experiments for both the uTorrent and mainline BitTorrent clients, and we study the impact of uTP (a novel transport protocol proposed by BitTorrent) and several TCP congestion control algorithms (Cubic, New Reno, LP, Vegas and Nice) on the download completion time. Briefly, in case peers in the swarm all use the same congestion control algorithm, we observe that the specific algorithm has only a limited impact on the swarm performance. Conversely, when a mix of TCP congestion control algorithms coexists, peers employing a delay-based low-priority algorithm exhibit shorter completion time.</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%">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>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%">Zied Ben-Houidi</style></author><author><style face="normal" font="default" size="100%">Samir Ghamri-Doudane</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">M. Milanesio</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%">Edion Tego</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%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">L. Máthé</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%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">Yan Grunenberger</style></author><author><style face="normal" font="default" size="100%">L. Baltrunas</style></author><author><style face="normal" font="default" size="100%">Benoit Donnet</style></author><author><style face="normal" font="default" size="100%">Guy Leduc</style></author><author><style face="normal" font="default" size="100%">Y. Liao</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Design of Analysis Modules</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">analysis</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%">D4.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><isbn><style face="normal" font="default" size="100%">D4.1</style></isbn><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%">A. Araldo</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%">Dissecting Bufferbloat: Measurement and Per-Application Breakdown of Queueing Delay</style></title><secondary-title><style face="normal" font="default" size="100%">ACM CoNEXT'13, Student Workshop</style></secondary-title></titles><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://www.enst.fr/ drossi/paper/rossi13conext.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We propose a passive methodology to estimate the queueing delay incurred by TCP traffic, and additionally leverage DPI classification to breakdown the delay across different applications. Ultimately, we correlate the queueing delay to the performance perceived by the users of that applications, depending on their delay-sensitivity. We implement our methodology in Tstat, and make it available 1 as open source software to the community. We validate and tune the tool, and run a preliminary measurement campaign based on a real ISP traffic trace, showing interesting yet partly counter-intuitive results.&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%">YiXi Gong</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">C. Testa</style></author><author><style face="normal" font="default" size="100%">S. Valenti</style></author><author><style face="normal" font="default" size="100%">D. Taht</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Fighting the bufferbloat: on the coexistence of AQM and low priority congestion control</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE INFOCOM Workshop on Traffic Monitoring and Analysis  (TMA'13)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Bufferbloat</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://www.enst.fr/ drossi/paper/rossi13tma-b.pdf</style></url></web-urls></urls><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%">D Rossi</style></author><author><style face="normal" font="default" size="100%">Y. Nicolas</style></author><author><style face="normal" font="default" size="100%">D. Wolff</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%">I tube, YouTube, P2PTube: assessing ISP benefits of peer-assisted caching of YouTube content</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE P2P'XIII</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%">09/2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.enst.fr/ drossi/paper/rossi13p2p-b.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper proposes P2PTube, a very simple yet effective set-top-box system to assist diffusion of YouTube videos. We argue that, due to the spatial and temporal nature of video requests, the simplest design already provides non marginal gains. Our trace driven evaluation shows that, with moderate cache size (100MB) and nominal upload rates (500Kbps), about half of the video requests could be served by P2PTube. Interestingly, we also see that non marginal gains are already achievable with tiny caches – which is tied to the presence of advertisement prior that the actual video requested by the user.&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%">YiXi Gong</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">Emilio Leonardi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modeling the interdependency of low-priority congestion control and active queue management</style></title><secondary-title><style face="normal" font="default" size="100%"> 25th International Teletraffic Congress (ITC'25), Runner up for best-paper award</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;Recently, a negative interplay has been shown to&lt;br /&gt;arise when scheduling/AQM techniques and low-priority conges-&lt;br /&gt;tion control protocols are used together: namely, AQM resets&lt;br /&gt;the relative level of priority among congestion control protocols.&lt;br /&gt;This work explores this issue by (i) studying a fluid model that&lt;br /&gt;describes system dynamics of heterogeneous congestion control&lt;br /&gt;protocols competing on a bottleneck link governed by AQM and&lt;br /&gt;(ii) proposing a system level solution able to reinstate priorities&lt;br /&gt;among protocols.&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%">Marco Mellia</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%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">Balazs Szabo</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">Benoit Donnet</style></author><author><style face="normal" font="default" size="100%">Fabrizio Invernizzi</style></author><author><style face="normal" font="default" size="100%">Dimitri Papadimitriou</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">mPlane Architecture Speciﬁcation</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%">11/2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">D1.3</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%">Walter Bellante</style></author><author><style face="normal" font="default" size="100%">Rosa Vilardi</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%">On Netflix catalog dynamics and caching performance</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE CAMAD</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%">09/2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.enst.fr/ drossi/paper/rossi13camad.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Multimedia streaming applications have substantially changed the market policy of an increasing number of content providers that offer streaming services to the users. The need for effective video content delivery re-fueled interest for caching: since the Web-like workload of the 90s are not longer fit to describe the new Web of videos, in this work we investigate the suitability of the publicly available Netflix dataset for caching studies. Our analysis shows that, as the dataset continuously evolves (i) a steady state description is not statistically meaningful and (ii) despite the cache hit ratio decreases due to the growth of active movies in the catalog, simple caching replacement approaches are close to the optimum given the growing skew in the popularity distribution over the time. Additionally, we point out that, since the dataset reports logs of movie ratings, anomalies arise when ratings are considered to be movie views. At the same time, we show anomalies yield conservative caching results, that reinforces the soundness of our study.&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%">C. Chirichella</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">C. Testa</style></author><author><style face="normal" font="default" size="100%">T. Friedman</style></author><author><style face="normal" font="default" size="100%">A. Pescape</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Passive bufferbloat measurement exploiting transport layer information</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE GLOBECOM</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%">12/2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.enst.fr/ drossi/paper/rossi13globecom.pdf</style></url></web-urls></urls><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%">C. Chirichella</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">C. Testa</style></author><author><style face="normal" font="default" size="100%">T. Friedman</style></author><author><style face="normal" font="default" size="100%">A. Pescape</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Remotely Gauging Upstream Bufferbloat Delays</style></title><secondary-title><style face="normal" font="default" size="100%">Passive and Active Measurement (PAM)</style></secondary-title></titles><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://www.enst.fr/ drossi/paper/rossi13pam.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">  ``Bufferbloat'' is the growth in buffer size that has led Internet
  delays to occasionally exceed the light propagation delay from the Earth
  to the Moon. Manufacturers have built in large buffers to prevent
  losses on Wi-Fi, cable and ADSL links. But the combination of some links'
  limited bandwidth with TCP's tendency to saturate that
  bandwidth results in  excessive queuing delays. In response, new
  congestion control protocols such as BitTorrent's uTP/LEDBAT aim at
  explicitly limiting the delay that they add over the bottleneck link.
This work proposes and validate a methodology to monitor the upstream
    queuing delay experienced by remote hosts, both those using
  LEDBAT, through LEDBAT's native one-way delay measurements, and
  those using TCP (via the Time-stamp Option). 
</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%">C. Chirichella</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%">To the Moon and back: are Internet bufferbloat delays really that large</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE INFOCOM Workshop on Traffic Monitoring and Analysis  (TMA'13)</style></secondary-title></titles><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://www.enst.fr/~drossi/paper/rossi13tma-a.pdf</style></url></web-urls></urls><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%">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><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%">YiXi Gong</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">C. Testa</style></author><author><style face="normal" font="default" size="100%">S. Valenti</style></author><author><style face="normal" font="default" size="100%">D. Taht</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Interaction or Interference: can AQM and Low Priority Congestion Control Successfully Collaborate</style></title><secondary-title><style face="normal" font="default" size="100%">ACM CoNEXT, Extended Abstract</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">12/2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.enst.fr/drossi/paper/rossi12conext.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Heterogeneity in the Internet ecosystem sometimes turns interaction into interference. Over the years, active queue management (AQM) and end-to-end low-priority congestion control (LPCC) have been proposed as alternative solutions to counter the persistently full buffer problem -- that recently became popular under the ``bufferbloat'' term. In this work, we point out the existence of a negative interplay among AQM and LPCC techniques. Intuitively, as AQM is designed to penalize the most aggressive flows it mainly hit best effort TCP: it follows that LPCC is not able to maintain its low priority, thus becoming as aggressive as TCP. By an extended set of simulation on various AQM policies and LPCC protocols, including the very recent CoDel AQM and LEDBAT LPCC proposals, we point out that this interference is quite universal and deserves further attention.&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 Maria Santiago del Rio</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">Francesco Gringoli</style></author><author><style face="normal" font="default" size="100%">Lorenzo Nava</style></author><author><style face="normal" font="default" size="100%">Luca Salgarelli</style></author><author><style face="normal" font="default" size="100%">Javier Aracil</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Wire-speed statistical classification of network traffic on commodity hardware</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Internet Measurement Conference (IMC)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">11/2012</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we present a software-based traffic classification engine running on commodity multi-core hardware, able to process in real-time aggregates of up to 14.2Mpps over a single 10Gbps interface -- i.e., the maximum possible packet rate over a 10Gbps Ethernet links given the minimum frame size of 64Bytes. This significant advance with respect to the current state of the art in terms of achieved classification rates are made possible by: (i) the use of an improved network driver, PacketShader, to efficiently move batches of packets from the NIC to the main CPU; (ii) the use of lightweight statistical classification techniques exploiting the size of the first few packets of every observed flow; (iii) a careful tuning of critical parameters of the hardware environment and the software application itself.&lt;/p&gt;</style></abstract></record></records></xml>