<?xml version="1.0" encoding="UTF-8"?><xml><records><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%">Claudio Testa</style></author><author><style face="normal" font="default" size="100%">Dario Rossi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Delay-based congestion control: Flow vs. BitTorrent swarm perspectives</style></title><secondary-title><style face="normal" font="default" size="100%">Elsevier Computer Networks</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%">02/2014</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.enst.fr/ drossi/paper/rossi14comnet-a.pdf</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">60</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;BitTorrent, one of the most widespread file-sharing P2P applications, recently introduced LEDBAT, a novel congestion control protocol aiming at (i) limiting the additional delay due to queuing, to reduce interference with the rest of user traffic (e.g., Web, VoIP and gaming) sharing the same access bottleneck, and (ii) efficiently using the available link capacity, to provide users with good BitTorrent performance at the same time. In this work, we adopt two complementary perspectives: namely, a flow viewpoint to assess the Quality of Service (QoS) as in classic congestion control studies, and a BitTorrent swarm viewpoint to assess peer-to-peer users Quality of Experience (QoE). We additionally point out that congestion control literature is rich of protocols, such as VEGAS, LP, and NICE sharing similarities with LEDBAT, that is therefore mandatory to consider in the analysis. Hence, adopting the above viewpoints we both (i) contrast LEDBAT to the other protocols and (ii) provide deep understanding of the novel protocol and its implication on QoS and QoE. Our simulation based investigation yields several insights. At flow-level, we gather LEDBAT to be lowest priority among all protocols, which follows from its design that strives to explicitly bound the queuing delay at the bottleneck link to a maximum target value. At the same time, we see that this very same protocol parameter can be exploited by adversaries, that can set a higher target to gain an unfair advantage over competitors. Interestingly, swarm-level performance exhibit an opposite trade-off, with smaller targets being more advantageous for QoE of BitTorrent users. This can be explained with the fact that larger delay targets slow down BitTorrent signaling task, with possibly negative effect on the swarming protocol efficiency. Additionally, we see that for the above reason, in heterogeneous swarms, any delay-based protocol (i.e., not only LEDBAT but also VEGAS or NICE) can yield a competitive QoE advantage over loss-based TCP. Overall this tension between swarm and flow-levels suggests that, at least in current ADSL/cable access bottleneck scenarios, a safe LEDBAT operational point may be used in practice. At the same time, our results also point out that benefits similar to LEDBAT can also be gathered with other delay-based protocols such as VEGAS or NICE.&lt;/p&gt;</style></abstract><section><style face="normal" font="default" size="100%">115 -- 128</style></section></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%">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%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Sofia Nikitaki</style></author><author><style face="normal" font="default" size="100%">Mohamed Ahmed</style></author><author><style face="normal" font="default" size="100%">Stefano Traverso</style></author><author><style face="normal" font="default" size="100%">Marco Mellia</style></author><author><style face="normal" font="default" size="100%">Daniele Apiletti</style></author><author><style face="normal" font="default" size="100%">Luigi Grimaudo</style></author><author><style face="normal" font="default" size="100%">Elena Baralis</style></author><author><style face="normal" font="default" size="100%">Dario Rossi</style></author><author><style face="normal" font="default" size="100%">D. Joumblatt</style></author><author><style face="normal" font="default" size="100%">Alessandro Capello</style></author><author><style face="normal" font="default" size="100%">M. D'Ambrosio</style></author><author><style face="normal" font="default" size="100%">Fabrizio Invernizzi</style></author><author><style face="normal" font="default" size="100%">M. Ullio</style></author><author><style face="normal" font="default" size="100%">Andrea Fregosi</style></author><author><style face="normal" font="default" size="100%">Eike Kowallik</style></author><author><style face="normal" font="default" size="100%">Stefano Raffaglio</style></author><author><style face="normal" font="default" size="100%">Andrea Sannino</style></author><author><style face="normal" font="default" size="100%">Marco Milanesio</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%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">Balazs Szabo</style></author><author><style face="normal" font="default" size="100%">L. Németh</style></author><author><style face="normal" font="default" size="100%">Zied Ben Houidi</style></author><author><style face="normal" font="default" size="100%">G. Dimopoulos</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%">Michael Faath</style></author><author><style face="normal" font="default" size="100%">Rolf Winter</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%">Design of the Reasoner</style></title><short-title><style face="normal" font="default" size="100%">D4.2</style></short-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">design</style></keyword><keyword><style  face="normal" font="default" size="100%">private deliverable</style></keyword><keyword><style  face="normal" font="default" size="100%">reasoner</style></keyword><keyword><style  face="normal" font="default" size="100%">WP4</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><number><style face="normal" font="default" size="100%">D4.2</style></number><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">report</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%">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%">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></records></xml>