@inproceedings {Cas2015a, title = {On the Analysis of QoE in Cellular Networks: from Subjective Tests to Large-scale Traffic Measurements}, booktitle = {6th International Workshop on Traffic Analysis and Characterization (TRAC)}, year = {2015}, author = {Pedro Casas and Martin Varela and Pierdomenico Fiadino and Mirko Schiavone and Helena Rivas and Raimund Schatz} } @inproceedings {DR:AIMS-15, title = {Anycast census and geolocation}, booktitle = {7th Workshop on Active Internet Measurements (AIMS 2015)}, year = {2015}, month = {April 2015}, url = {http://www.enst.fr/~drossi/paper/rossi15aims.pdf}, author = {Cicalese, Danilo and Auge, Jordan and Joumblatt, Diana and Rossi, Dario and Friedman, Timur} } @inproceedings {Bae2015, title = {Cache Oblivious Scheduling of Shared Workloads}, booktitle = {31st IEEE International Conference on Data Engineering (ICDE)}, year = {2015}, month = {05/2015}, publisher = {IEEE}, organization = {IEEE}, address = {Seoul, Korea}, abstract = {

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.

}, author = {Arian B{\"a}r and Lukasz Golab and Stefan Ruehrup and Mirko Schiavone and Pedro Casas} } @inproceedings {DR:CoNEXT-15, title = {Characterizing IPv4 Anycast Adoption and Deployment}, booktitle = {ACM CoNEXT}, year = {2015}, month = {12/2015}, publisher = {ACM}, organization = {ACM}, address = {Heidelberg, DE}, url = {http://www.enst.fr/~drossi/paper/rossi15conext.pdf}, author = {Cicalese, Danilo and Auge, Jordan and Joumblatt, Diana and Friedman, Tim ur and Rossi, Dario} } @article {D61, title = {Demonstration Plan}, number = {D6.1}, year = {2015}, month = {01/2015}, type = {Public Deliverable}, issn = {D6.1}, author = {Pedro Casas and Edion Tego and Francesco Matera and Maurizio Dusi and A. Bakay and Balazs Szabo and G. Rozsa and Stefano Traverso and Ilias Leontiadis and L. Baltrunas and Yan Grunenberger and Andrea Fregosi and A. Kahveci and Eike Kowallik and G. Mattellini and C. Meregalli and Stefano Raffaglio and M. Russo and Andrea Sannino and M. Scarpino} } @inproceedings {DR:INFOCOM-15a, title = {A Fistful of Pings: Accurate and Lightweight Anycast Enumeration and Geolocation}, booktitle = {IEEE INFOCOM}, year = {2015}, month = {04/2015}, abstract = {

Use of IP-layer anycast has increased in the last few years: once relegated to DNS root and top-level domain servers, anycast is now commonly used to assist distribution of general purpose content by CDN providers. Yet, the measurement techniques for discovering anycast replicas have been designed around DNS, limiting their usefulness to this particular service. This raises the need for protocol agnostic methodologies, that should additionally be as lightweight as possible in order to scale up anycast service discovery. This is precisely the aim of this paper, which proposes a new method for exhaustive and accurate enumeration and city-level geolocation of anycast instances, requiring only a handful of latency measurements from a set of known vantage points. Our method exploits an iterative workflow that enumerates (an optimization problem) and geolocates (a classification problem) anycast replicas. We thoroughly validate our methodology on available ground truth (several DNS root servers), using multiple measurement infrastructures (PlanetLab, RIPE), obtaining extremely accurate results (even with simple algorithms, that we compare with the global optimum), that we make available to the scientific community. Compared to the state of the art work that appeared in INFOCOM 2013 and IMC 2013, our technique (i) is not bound to a specific protocol, (ii) requires 1000 times fewer vantage points, not only (iii) achieves over 50\% recall but also (iv) accurately identifies the city-level geolocation for over 78\% of the enumerated servers, with (v) a mean geolocation error of 361 km for all enumerated servers.

}, url = {http://www.enst.fr/~drossi/paper/rossi15infocom.pdf}, author = {Cicalese, Danilo and Joumblatt, Diana and Rossi, Dario and Buob, Marc-Olivier and Auge, Jordan and Friedman, Timur} } @inproceedings {DR:TRAC-15, title = {Impact of Carrier-Grade NAT on Web Browsing}, booktitle = { 6th International Workshop on TRaffic Analysis and Characterization (TRAC) - The paper won the BEST PAPER award}, year = {2015}, month = {08/2015}, publisher = {IEEE}, organization = {IEEE}, address = {Dobrovnik, Croatia}, abstract = {

Public IPv4 addresses are a scarce resource. While IPv6 adoption is lagging, Network Address Translation (NAT) technologies have been deployed over the last years to alleviate IPv4 exiguity and their high rental cost. In particular, Carrier- Grade NAT (CGN) is a well known solution to mask a whole ISP network behind a limited amount of public IP addresses, significantly reducing expenses. Despite its economical benefits, CGN can introduce connectiv- ity issues which have sprouted a considerable effort in research, development and standardization. However, to the best of our knowledge, little effort has been dedicated to investigate the impact that CGN deployment may have on users{\textquoteright} traffic. This paper fills the gap. We leverage passive measurements from an ISP network deploying CGN and, by means of the Jensen- Shannon divergence, we contrast several performance metrics considering customers being offered public or private addresses. In particular, we gauge the impact of CGN presence on users{\textquoteright} web browsing experience. Our results testify that CGN is a mature and stable technology as, if properly deployed, it does not harm users{\textquoteright} web browsing experience. Indeed, while our analysis lets emerge expected stochastic differences of certain indexes (e.g., the difference in the path hop count), the measurements related to the quality of users{\textquoteright} browsing are otherwise unperturbed. Interestingly, we also observe that CGN protects customers from unsolicited, often malicious, traffic.

}, url = {http://www.enst.fr/~drossi/paper/rossi15trac.pdf}, author = {Bocchi, Enrico and Safari, Ali and Traverso, Stefano and Finamore, Alessandro and Di Gennaro, Valeria and Mellia, Marco and Munafo, Maurizio and Rossi, Dario} } @inproceedings {DR:INFOCOM-15b, title = {A Lightweight Anycast Enumeration and Geolocation}, booktitle = {IEEE INFOCOM, Demo Session}, year = {2015}, address = {Hong Kong, China}, abstract = {

Several Internet services such as CDNs, DNS name servers, and sinkholes use IP-layer anycast to reduce user response times and increase robustness with respect to network failures and denial of service attacks. However, current geolocation tools fail with anycast IP addresses. In our recent work [1], we remedy to this by developing an anycast detection, enumeration, and geolocation technique based on a set of delay measurements from a handful of geographically distributed vantage points. The technique (i) detects if an IP is anycast, (ii) enumerates replicas by finding the maximum set of non-overlapping disks (i.e., areas centered around vantage points), and (iii) geolocates the replicas by solving a classification problem and assigning the server location to the most likely city. We propose to demo this technique. In particular, we visually show how to detect an anycast IP, enumerate its replicas, and geolocate them on a map. The demo allows to browse previously geolocated services, as well as to explore new targets on demand.

}, url = {http://www.enst.fr/~drossi/paper/rossi15infocom-b.pdf}, author = {Cicalese, Danilo and Joumblatt, Diana and Rossi, Dario and Buob, Marc-Olivier and Auge, Jordan and Friedman, Timur} } @inproceedings {Nay2015, title = {multi-context TLS (mcTLS): Enabling Secure In-Network Functionality in TLS}, booktitle = {2015 ACM SIGCOMM Conference (SIGCOMM {\textquoteright}15)}, year = {2015}, publisher = {ACM}, organization = {ACM}, address = {London}, abstract = {

Transport Layer Security (TLS), is the de facto protocol supporting secure HTTP (HTTPS), and is being discussed as the default transport protocol for HTTP2.0. It has seen wide adoption and is currently carrying a significant fraction of the overall HTTP traffic (Facebook, Google and Twitter use it by default). However, TLS makes the fundamental assumption that all functionality resides solely at the endpoints, and is thus unable to utilize the many in-network services that optimize network resource usage, improve user experience, and protect clients and servers from security threats. Re-introducing such in-network functionality into secure TLS sessions today is done through hacks, in many cases weakening overall security.

In this paper we introduce multi-context TLS (mcTLS) which enhances TLS by allowing middleboxes to be fully supported participants in TLS sessions. mcTLS breaks the "all-or-nothing" security model by allowing endpoints and content providers to explicitly introduce middleboxes in secure end-to-end sessions, while deciding whether they should have read or write access, and to which specific parts of the content. mcTLS enables transparency and control for both clients and servers.

We evaluate a prototype mcTLS implementation in both controlled and "live" experiments, showing that the benefits offered have minimal overhead.More importantly, we show that mcTLS can be incrementally deployed and requires small changes to clients, servers, and middleboxes, for a large number of use cases.

}, author = {David Naylor and Kyle Schomp and Matteo Varvello and Ilias Leontiadis and Jeremy Blackburn and Diego Lopez and Konstantina Papagiannaki and Pablo Rodriguez and Peter Steenkiste} } @article {Teg2015a, title = {SLA verification and certification, Traffic Monitoring and Analysis}, year = {2015}, type = {Poster}, author = {Edion Tego and Elena Mammi and Ariana Rufini and Francesco Matera} } @inproceedings {DR:TMA-15, title = {Zen and the art of network troubleshooting: a hands on experimental study}, booktitle = {Traffic Monitoring and Analysis}, year = {2015}, abstract = {

Growing network complexity necessitates tools and methodologies to automate network troubleshooting. In this paper, we follow a crowd-sourcing trend, and argue for the need to deploy measurement probes at end-user devices and gateways, which can be under the control of the users or the ISP. Depending on the amount of information available to the probes (e.g., ISP topology), we formalize the network troubleshooting task as either a clustering or a classification problem, that we solve with an algorithm that (i) achieves perfect classification under the assumption of a strategic selection of probes (e.g., assisted by an ISP) and (ii) operates blindly with respect to the network performance metrics, of which we consider delay and bandwidth in this paper. While previous work on network troubleshooting privileges a more theoretical vs practical approaches, our workflow balances both aspects as (i) we conduct a set of controlled experiments with a rigorous and reproducible methodology, (ii) on an emulator that we thoroughly calibrate, (iii) contrasting experimental results affected by real-world noise with expected results from a probabilistic model.

}, url = {http://www.enst.fr/~drossi/paper/rossi15tma.pdf}, author = {Espinet, Fran{\c c}ois and Joumblatt, Diana and Rossi, Dario} } @inbook {Sil2014, title = {Aggregation of Statistical Data from Passive Probes: Techniques and Best Practices}, booktitle = {Traffic Monitoring and Analysis}, series = {Lecture Notes in Computer Science}, volume = {8406}, year = {2014}, pages = {38-50}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {

Passive probes continuously generate statistics on large number of metrics, that are possibly represented as 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. In this work, we take an experimental approach and study both cases using, whenever possible, open source software and datasets. Considering different consolidation strategies, we assess their accuracy in estimating pmf deciles (from the 10th to the 90th) of diverse metrics, obtaining general design and tuning guidelines. In our dataset, we find that Monotonic Spline Interpolation over a larger set of percentiles (e.g., adding 5th, 10th, 15th, and so on) allow fairly accurate pmf consolidation in both the multiple vantage points (median error is about 1\%, maximum 30\%) and local processes (median 0.1\%, maximum 1\%) cases.

}, keywords = {Data aggregation, data reduction, scalability problem}, isbn = {978-3-642-54998-4}, doi = {10.1007/978-3-642-54999-1_4}, url = {http://dx.doi.org/10.1007/978-3-642-54999-1_4}, author = {Colabrese, Silvia and Rossi, Dario and Mellia, Marco} } @article {Dus2014a, title = {Algorithm and Scheduler Design and Implementation}, year = {2014}, month = {09/2014}, keywords = {algorithm design, job scheduler, mPlane software, repository tools}, isbn = {D3.3}, issn = {D3.3}, author = {Maurizio Dusi and Saverio Niccolini and Sofia Nikitaki and Daniele Apiletti and Elena Baralis and Alessandro Finamore and Luigi Grimaudo and Stefano Traverso and Francesco Matera and Edion Tego and V, Guchev and Zied Ben Houidi and Pietro Michiardi and Marco Milanesio and YiXi Gong and Dario Rossi and Ilias Leontiadis and G, Dimopoulos and Tivadar Szemethy and A, Bakay and Arian B{\"a}r and Pedro Casas and Alessandro D{\textquoteright}Alconzo and Pierdomenico Fiadino} } @inproceedings {DR:ICN-14c, title = {Analyzing Cacheable Traffic in ISP Access Networks for Micro CDN applications via Content-Centric Networking}, booktitle = {ACM SIGCOMM Information Centric Networks (ICN)}, year = {2014}, month = {09/2014}, address = {Paris, FR}, url = {http://www.enst.fr/~drossi/paper/rossi14icn-c.pdf}, author = {Imbrenda, Claudio and Muscariello, Luca and Rossi, Dario} } @inproceedings {Ruf2014b, title = {Bandwidth Measurements and Capacity Exploitation in Gigabit Passive Optical Networks}, booktitle = {Fotonica 2014}, year = {2014}, month = {05/2014}, abstract = {

We report an experimental investigation on the
measurement of the available bandwidth for users in Gigabit
Passive Optical Networks (GPON) and the limitations caused by
the Internet protocols. We point out that the huge capacity
offered by the GPON highlights the enormous differences that
can be showed among the available and actually exploitable
bandwidth in the case of TCP. In this ultrabroadband
environment we also investigated on use of the UDP and of the
multisession TCP. A correlation in terms of QoE is also reported.

}, keywords = {access capacity, GPON, QoE, QoS, Throughput}, author = {Arianna Rufini and Edion Tego and Francesco Matera and Marco Mellia} } @article {D43, title = { Cross-check of Analysis Modules and Reasoner Interactions}, number = {D4.3}, year = {2014}, month = {10/2014}, type = {Deliverable}, keywords = {reasoner, WP4}, author = {Umberto Manferdini and Stefano Traverso and Marco Mellia and Edion Tego and Francesco Matera and Zied Ben Houidi and Marco Milanesio and Pietro Michiardi and Dario Rossi and D. Cicalese and D. Joumblatt and Jordan Aug{\'e} and Maurizio Dusi and Sofia Nikitaki and Mohamed Ahmed and Ilias Leontiadis and L. Baltrunas and M. Varvello and Pedro Casas and Alessandro D{\textquoteright}Alconzo and Benoit Donnet and W. Du and Guy Leduc and Y. Liao and Alessandro Capello and Fabrizio Invernizzi} } @article {DR:COMNET-14a, title = {Delay-based congestion control: Flow vs. BitTorrent swarm perspectives}, journal = {Elsevier Computer Networks}, volume = {60}, year = {2014}, month = {02/2014}, chapter = {115 -- 128}, abstract = {

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.

}, url = {http://www.enst.fr/~drossi/paper/rossi14comnet-a.pdf}, author = {Claudio Testa and Dario Rossi} } @article {D42, title = {Design of the Reasoner}, number = {D4.2}, year = {2014}, month = {06/2014}, type = {report}, keywords = {design, private deliverable, reasoner, WP4}, issn = {D4.2}, author = {Pedro Casas and Alessandro D{\textquoteright}Alconzo and Maurizio Dusi and Sofia Nikitaki and Mohamed Ahmed and Stefano Traverso and Marco Mellia and Daniele Apiletti and Luigi Grimaudo and Elena Baralis and Dario Rossi and D. Joumblatt and Alessandro Capello and M. D{\textquoteright}Ambrosio and Fabrizio Invernizzi and M. Ullio and Andrea Fregosi and Eike Kowallik and Stefano Raffaglio and Andrea Sannino and Marco Milanesio and Edion Tego and Francesco Matera and Tivadar Szemethy and Balazs Szabo and L. N{\'e}meth and Zied Ben Houidi and G. Dimopoulos and Ilias Leontiadis and Yan Grunenberger and L. Baltrunas and Michael Faath and Rolf Winter and Dimitri Papadimitriou} } @inproceedings {Schiavone:2014:DDA:2680821.2680831, title = {Diagnosing Device-Specific Anomalies in Cellular Networks}, booktitle = {Proceedings of the 2014 CoNEXT on Student Workshop}, year = {2014}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {anomaly diagnosis, cellular networks., entropy-based analysis}, isbn = {978-1-4503-3282-8}, doi = {10.1145/2680821.2680831}, url = {http://doi.acm.org/10.1145/2680821.2680831}, author = {Schiavone, Mirko and Romirer-Maierhofer, Peter and Fiadino, Pierdomenico and Casas, Pedro} } @inproceedings {Cas2014a, title = {Distributed active measurement of Internet queuing delays}, booktitle = {Passive and Active Measurement (PAM), Extended Abstract}, year = {2014}, month = {March}, address = {Los Angeles, USA}, abstract = {

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.

}, url = {http://www.enst.fr/~drossi/paper/rossi14pam-b.pdf}, author = {P. Casoria and D Rossi and Jordan Aug{\'e} and Marc-Oliver Buob and T. Friedman and A. Pescape} } @inproceedings {Tra2014b, title = {Exploiting Hybrid Measurements for Network Troubleshooting}, booktitle = {IEEE Networks}, year = {2014}, month = {09/2014}, publisher = {IEEE}, organization = {IEEE}, address = {Funchal, PT}, abstract = {Network measurements are a fundamental pillar to understand network performance and perform root cause analysis in case of problems. Traditionally, either active or passive measurements are considered. While active measurements allow to know exactly the workload injected by the application into the network, the passive measurements can offer a more detailed view of transport and network layer impacts. In this paper, we present a hybrid approach in which active throughput measurements are regularly run while a passive measurement tool monitors the generated packets. This allows us to correlate the application layer measurements obtained by the active tool with the more detailed view offered by the passive monitor. The proposed methodology has been implemented following the mPlane reference architecture, tools have been installed in the Fastweb network, and we collect measurements for more than three months. We report then a subset of results that show the benefits obtained when correlating active and passive measurements. Among results, we pinpoint cases of congestion, of ADSL misconfiguration, and of modem issues that impair throughput obtained by the users.}, keywords = {Hybrid measurements, measurement analysis, WP2}, author = {Stefano Traverso and Edion Tego and Eike Kowallik and Stefano Raffaglio and Andrea Fregosi and Marco Mellia and Francesco Matera} } @article {DR:COMNET-14b, title = {{Fighting the bufferbloat: on the coexistence of AQM and low priority congestion control (extended version)}}, journal = {Elsevier Computer Networks}, volume = {60}, year = {2014}, chapter = {115--128}, abstract = {

Nowadays, due to excessive queuing, delays on the Internet can grow longer than the round trip time between the Moon and the Earth {\textendash} for which the {\textquoteleft}{\textquoteleft}bufferbloa t{\textquoteright}{\textquoteright} term was recently coined. Some point to active queue management (AQM) as the solution. Others propose end-to-end low-priority congestion control techniques (LPCC). Under both approaches, promising advances have been made in recent times: notable examples are CoDel for AQM, and LEDBAT for LPCC. In this paper, we warn of a potentially fateful interaction when AQM and LPCC techniques are combined: namely, AQM resets the relative level of priority between best-effort and low-priority congestion control protocols. We validate the generality of our findings by an extended set of experiments with packet-level ns2 simulation, considering 5 AQM techniques and 3 LPCC protocols, and carry on a thorough sensitivity analysis varying several parameters of the networking scenario. We complete the simulation via an experimental campaign conducted on both controlled testbeds and on the Internet, confirming the reprioritization issue to hold in the real world at least under all combination of AQM policies and LPCC protocols available in the Linux kernel. To promote cross-comparison, we make our scripts and dataset available to the research community.

}, url = {http://www.enst.fr/~drossi/paper/rossi14comnet-b.pdf}, author = {YiXi Gong and Dario Rossi and Claudio Testa and Silvio Valenti and Dave Taht} } @inbook {Geo2014, title = {Flow Management at Multi-Gbps: Tradeoffs and Lessons Learned}, booktitle = {Traffic Monitoring and Analysis}, series = {Lecture Notes in Computer Science}, volume = {8406}, year = {2014}, pages = {1-14}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, isbn = {978-3-642-54998-4}, doi = {10.1007/978-3-642-54999-1_1}, url = {http://dx.doi.org/10.1007/978-3-642-54999-1_1}, author = {Nassopulos, Georges and Rossi, Dario and Gringoli, Francesco and Nava, Lorenzo and Dusi, Maurizio and Santiago del Rio, PedroMaria} } @article {Tra, title = {mPlane: an Intelligent Measurement Plane for the Internet}, journal = {IEEE Communications Magazine, Special Issue on Monitoring and Troubleshooting Multi-domain Networks using Measurement Federations}, volume = {42}, year = {2014}, month = {05/2014}, author = {Brian Trammell and Pedro Casas and Dario Rossi and Arian B{\"a}r and Zied Ben-Houidi and Ilias Leontiadis and Tivadar Szemethy and Marco Mellia} } @article {Ruf2014, title = {Multilevel Bandwidth Measurements and Capacity Exploitation in Gigabit Passive Optical Networks}, journal = {IET Communications}, volume = {8}, year = {2014}, month = {11/2014}, pages = {8}, chapter = {3357}, abstract = {

We report an experimental investigation on the measurement of the available bandwidth for the users in Gigabit Passive Optical Networks (GPON) and the limitations caused by the Internet protocols, and TCP in particular. We point out that the huge capacity offered by the GPON highlights the enormous differences that can be showed among the available and actually exploitable bandwidth. In fact, while the physical layer capacity can reach value of 100 Mb/s and more, the bandwidth at disposal of the user (i.e. either throughput at transport layer or goodput at application layer) can be much lower when applications and services based on TCP protocol are considered. In the context of Service Level Agreements (SLA) verification, we show how to simultaneously measure throughput and line capacity by offering a method to verify multilayer SLA. We also show how it is possible to better to exploit the physical layer capacity by adopting multiple TCP connections to avoid the bottleneck of a single connection.

}, keywords = {Fiber Networks, GPON, Quality of Service, TCP}, issn = {1751-8628}, doi = {10.1049/iet-com.2014.0165}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6980492}, author = {Arianna Rufini and Marco Mellia and Edion Tego and Francesco Matera} } @inproceedings {Ruf2014a, title = {Multilevel QoS vs QoE measurements and Verification of Service Level Agreements}, booktitle = {European Conference on Networks and Communications, EUCNC 2014}, year = {2014}, month = {06/2014}, abstract = {

Experimental investigation on QoS measurements in terms of throughput versus access capacity, including a correlation in terms of QoE evaluated for some web TV\ 

}, author = {Arianna Rufini and Edion Tego and Francesco Matera} } @inproceedings {DR:TMA-14c, title = {Peeking Through the BitTorrent Seedbox Hosting Ecosystem}, booktitle = {Traffic Monitoring and Analysis (TMA)}, year = {2014}, abstract = {

In this paper, we propose a lightweight method for detecting and classifying BitTorrent content providers with a minimal amount of resources. While
heavy methodologies are typically used (which require long term observation
and data exchange with peers of the swarm and/or a semantic analysis of torrent
websites), we instead argue that such complexity can be avoided by analyzing
the correlations between peers and torrents. We apply our methodology to study
over 50K torrents injected in ThePirateBay during one month, collecting more
than 400K IPs addresses. Shortly, we find that exploiting the correlations not
only enhances the classification accuracy keeping the technique lightweight (our
methodology reliably identifies about 150 seedboxes), but also uncovers seeding behaviors that were not previously noticed (e.g., as multi-port and multi-host
seeding). Finally, we correlate the popularity of seedbox hosting in our dataset
to criteria (e.g., cost, storage space, Web popularity) that can bias the selection
process of BitTorrent content providers.

}, url = {http://www.enst.fr/~drossi/paper/rossi14tma-c.pdf}, author = {Dario Rossi and Guilhem Pujol and Xiao Wang and Fabien Mathieu} } @inproceedings {DR:TRAC-14, title = {A per-Application Account of Bufferbloat: Causes and Impact on Users}, booktitle = {5th International Workshop on TRaffic Analysis and Characterization (TRAC), Best Paper Award}, year = {2014}, abstract = {

We propose a methodology to gauge the extent of queueing delay (aka bufferbloat) in the Internet, based on purely passive measurement of TCP traffic. We implement our methodology in Tstat and make it available as open source software. We leverage Deep Packet Inspection (DPI) and behavioral classification of Tstat to breakdown the queueing delay across different applications, in order to evaluate the impact of bufferbloat on user experience. We show that there is no correlation between the ISP traffic load and the queueing delay, thus confirming that bufferbloat is related only to the traffic of each single user (or household). Finally, we use frequent itemset mining techniques to associate the amount of queueing delay seen by each host with the set of its active applications, with the goal of investigating the root cause of bufferbloat.

}, url = {http://www.enst.fr/drossi/paper/rossi14trac.pdf}, author = {Andrea Araldo and Dario Rossi} } @inproceedings {Col2014, title = {Scalable accurate consolidation of passively measured statistical data}, booktitle = {Passive and Active Measurement (PAM), Extended Abstract}, year = {2014}, month = {March}, address = {Los Angeles, USA}, abstract = {

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.

}, url = {http://perso.telecom-paristech.fr/~drossi/paper/rossi14pam-a.pdf}, author = {S. Colabrese and D Rossi and Marco Mellia} } @inproceedings {DR:PAM-14c, title = {Violation of Interdomain Routing Assumptions}, booktitle = {Passive and Active Measurement (PAM)}, year = {2014}, month = {03/2014}, address = {Los Angeles, USA}, url = {http://www.enst.fr/~drossi/paper/rossi14pam-c.pdf}, author = {R. Mazloum and M.-O. Buob and J. Auge and B. Baynat and T. Friedman and D. Rossi} } @article {Mic2013, title = {Basic Network Data Analysis}, number = {D3.1}, year = {2013}, month = {05/2013}, institution = {mPlane Consortium}, type = {Public Deliverable}, address = {Torino}, abstract = {

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.
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.
For each algorithm and use case, the input data and the initial state, the computation to run and the output produced are described.

}, keywords = {algorithms, big data, storage}, issn = {D3.1}, author = {Pietro Michiardi and Antonio Barbuzzi and Alessandro Finamore and Stefano Traverso and Daniele Apiletti and Elena Baralis and Tania Cerquitelli and Silvia Chiusano and Luigi Grimaudo and A. Rufini and Francesco Matera and A. Valentii and Maurizio Dusi and Mohamed Ahmed and Tivadar Szemethy and L. N{\'e}meth and R. Szalay and Ilias Leontiadis and Yan Grunenberger and P. Casas and Alessandro D{\textquoteright}Alconzo and A B{\"a}r and D Rossi and YiXi Gong} } @inproceedings {Tes2013, title = {Data Plane Throughput vs Control Plane Delay: Experimental Study of BitTorrent Performance}, booktitle = {IEEE P2P{\textquoteright}XIII}, year = {2013}, month = {09/2013}, abstract = {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.}, url = {http://www.enst.fr/~drossi/paper/rossi13p2p-a.pdf}, author = {C. Testa and D Rossi and A. Rao and A. Legout} } @article {Bar2013a, title = {Database Layer Design}, number = {D3.2}, year = {2013}, month = {11/2013}, institution = {mPlane Consortium}, type = {Public Deliverable}, address = {Torino}, keywords = {big data, databases, repositories, storage}, issn = {D3.2}, author = {A B{\"a}r and P. Casas and Alessandro D{\textquoteright}Alconzo and Alessandro Finamore and Antonio Barbuzzi and Maurizio Dusi and Gianni De Rosa and Tivadar Szemethy and Ilias Leontiadis and D Rossi and Jordan Aug{\'e} and Marc-Oliver Buob} } @article {Pap2013, title = {Design of Analysis Modules}, number = {D4.1}, year = {2013}, month = {11/2013}, institution = {mPlane Consortium}, type = {Public Deliverable}, address = {Torino}, keywords = {algorithms, analysis}, isbn = {D4.1}, issn = {D4.1}, author = {Dimitri Papadimitriou and Zied Ben-Houidi and Samir Ghamri-Doudane and D Rossi and M. Milanesio and P. Casas and Alessandro D{\textquoteright}Alconzo and Edion Tego and Francesco Matera and Maurizio Dusi and Tivadar Szemethy and L. M{\'a}th{\'e} and Alessandro Finamore and Stefano Traverso and Ilias Leontiadis and Yan Grunenberger and L. Baltrunas and Benoit Donnet and Guy Leduc and Y. Liao} } @inproceedings {Ara2013, title = {Dissecting Bufferbloat: Measurement and Per-Application Breakdown of Queueing Delay}, booktitle = {ACM CoNEXT{\textquoteright}13, Student Workshop}, year = {2013}, abstract = {

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.

}, doi = {10.1145/2537148.2537785}, url = {http://www.enst.fr/~drossi/paper/rossi13conext.pdf}, author = {A. Araldo and D Rossi} } @inproceedings {Gon2013, title = {Fighting the bufferbloat: on the coexistence of AQM and low priority congestion control}, booktitle = {IEEE INFOCOM Workshop on Traffic Monitoring and Analysis (TMA{\textquoteright}13)}, year = {2013}, keywords = {Bufferbloat}, doi = {10.1109/INFCOM.2013.6567153}, url = {http://www.enst.fr/~drossi/paper/rossi13tma-b.pdf}, author = {YiXi Gong and D Rossi and C. Testa and S. Valenti and D. Taht} } @article {Cap2013, title = {First Data Collection Track Record}, number = {D5.1}, year = {2013}, month = {11/2013}, institution = {mPlane Consortium}, type = {Private Deliverable}, address = {Torino}, keywords = {data sets, integration, measurement systems, scenarios, use cases}, author = {Alessandro Capello and Fabrizio Invernizzi and Omar Jabr and Dimitri Papadimitriou and Dario Rossi and YiXi Gong and Brian Trammell and Marco Milanesio and Ernst Biersack and Rolf Winter and Francesco Matera and Arianna Rufini and Edion Tego and Maurizio Dusi and Balazs Szabo and Tivadar Szemethy and Alessandro Finamore and Marco Mellia and Ilias Leontiadis and Benoit Donnet} } @inproceedings {Ros2013, title = {I tube, YouTube, P2PTube: assessing ISP benefits of peer-assisted caching of YouTube content}, booktitle = {IEEE P2P{\textquoteright}XIII}, year = {2013}, month = {09/2013}, abstract = {

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 {\textendash} which is tied to the presence of advertisement prior that the actual video requested by the user.

}, url = {http://www.enst.fr/~drossi/paper/rossi13p2p-b.pdf}, author = {D Rossi and Y. Nicolas and D. Wolff and Alessandro Finamore} } @inproceedings {Gon2013a, title = {Modeling the interdependency of low-priority congestion control and active queue management}, booktitle = { 25th International Teletraffic Congress (ITC{\textquoteright}25), Runner up for best-paper award}, year = {2013}, abstract = {

Recently, a negative interplay has been shown to
arise when scheduling/AQM techniques and low-priority conges-
tion control protocols are used together: namely, AQM resets
the relative level of priority among congestion control protocols.
This work explores this issue by (i) studying a fluid model that
describes system dynamics of heterogeneous congestion control
protocols competing on a bottleneck link governed by AQM and
(ii) proposing a system level solution able to reinstate priorities
among protocols.

}, doi = {10.1109/ITC.2013.6662942}, author = {YiXi Gong and D Rossi and Emilio Leonardi} } @article {Tra2013d, title = {mPlane Architecture Specification}, number = {D1.3}, year = {2013}, month = {11/2013}, institution = {mPlane Consortium}, type = {Public Deliverable}, address = {Torino}, keywords = {architecture, measurement, platform, scenario, use case}, author = {Brian Trammell and Marco Mellia and Alessandro Finamore and Stefano Traverso and Tivadar Szemethy and Balazs Szabo and D Rossi and Benoit Donnet and Fabrizio Invernizzi and Dimitri Papadimitriou} } @inproceedings {Bel2013, title = {On Netflix catalog dynamics and caching performance}, booktitle = {IEEE CAMAD}, year = {2013}, month = {09/2013}, abstract = {

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.

}, url = {http://www.enst.fr/~drossi/paper/rossi13camad.pdf}, author = {Walter Bellante and Rosa Vilardi and D Rossi} } @inproceedings {Chi2013, title = {Passive bufferbloat measurement exploiting transport layer information}, booktitle = {IEEE GLOBECOM}, year = {2013}, month = {12/2013}, url = {http://www.enst.fr/~drossi/paper/rossi13globecom.pdf}, author = {C. Chirichella and D Rossi and C. Testa and T. Friedman and A. Pescape} } @inproceedings {Chi2013c, title = {Remotely Gauging Upstream Bufferbloat Delays}, booktitle = {Passive and Active Measurement (PAM)}, year = {2013}, abstract = { {\textquoteleft}{\textquoteleft}Bufferbloat{\textquoteright}{\textquoteright} 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{\textquoteright} limited bandwidth with TCP{\textquoteright}s tendency to saturate that bandwidth results in excessive queuing delays. In response, new congestion control protocols such as BitTorrent{\textquoteright}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{\textquoteright}s native one-way delay measurements, and those using TCP (via the Time-stamp Option). }, doi = {10.1007/978-3-642-36516-4_25}, url = {http://www.enst.fr/~drossi/paper/rossi13pam.pdf}, author = {C. Chirichella and D Rossi and C. Testa and T. Friedman and A. Pescape} } @article {Pap2013c, title = {Selection of Existing Probes and Datasets}, number = {D2.1}, year = {2013}, month = {08/2013}, institution = {mPlane Consortium}, type = {Public Deliverable}, address = {Torino}, abstract = {The mPlane architecture has been designed to include the possibility to interface with existing systems and platforms. While most measurement platforms in existence target a very specific measurement use case (e.g., the discovery of the Internet{\textquoteright}s router-level topology, the continuous measurement of the RTT among host pairs, the exporting via SNMP of network state, etc.), there are platforms that have a large deployed base, with lot of data being at disposal, and/or continuously collecting data. It would be a waste of resources to merely reproduce this effort within mPlane. Instead, mPlane aims at directly interfacing with existing systems and re-using their capabilities and data to feed measurement results to the mPlane intelligence. This document lists selected existing systems that are important for mPlane either for theoretical, conceptual or practical reasons, and that are part of the background of mPlane partners. A sub-set of these systems will be eventually incorporated into mPlane by developing the necessary interfaces. Others could be integrated by the means of proxy probes, i.e., the conceptual component responsible for such interfacing. The main focus of this document is to elaborate the concept of proxy probes, enumerate the systems that will be possibly considered for interface (proxy probe) development, and to give high level descriptions of the proxy probe design for these systems. The following list enumerates the systems that the consortium has chosen to include: - QoF - a TCP-aware IPFIX flow meter  Cisco Ping and SLA Agents - commercial availability and basic network parameter agents  - Tracebox - a tool for middlebox detection and identification - Scamper - a sophisticated active probing tool - MERLIN - a router-level topology discovery tool - TopHat - a configurable measurement system on top of PlanetLab - Tstat - a passive network monitoring tool - BlockMon - a flexible network monitoring and analysis tool - MisuraInternet - a QoS measurement system - Firelog - a Firefox plugin to measure HTTP QoE - Pytomo - an end-host-based video OoE measurement tool - DATI - a high performance deep packet inspector - MobiPerf - a tool for monitoring smartphone performance}, keywords = {active probes, existing probes, passive probes, probes, proxy probes}, author = {Dimitri Papadimitriou and Dario Rossi and YiXi Gong and Brian Trammell and Marco Milanesio and Ernst Biersack and Rolf Winter and Francesco Matera and Maurizio Dusi and Balazs Szabo and Tivadar Szemethy and Alessandro Finamore and Marco Mellia and Alessandro Capello and Fabio Invernizzi and Omar Jabr and Ilias Leontiadis and Benoit Donnet} } @inproceedings {Chi2013a, title = {To the Moon and back: are Internet bufferbloat delays really that large}, booktitle = {IEEE INFOCOM Workshop on Traffic Monitoring and Analysis (TMA{\textquoteright}13)}, year = {2013}, doi = {10.1109/INFCOMW.2013.6562886}, url = {http://www.enst.fr/~drossi/paper/rossi13tma-a.pdf}, author = {C. Chirichella and D Rossi} } @article {Tra2013a, title = {Use Case Elaboration and Requirements Specification}, number = {D1.1}, year = {2013}, month = {01/2013}, institution = {mPlane Consortium}, type = {Public Deliverable}, address = {Torino}, abstract = {

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{\textquoteright}s experience.\ 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{\textquoteright}s integrated trial.\ 

}, keywords = {architecture, measurement, platform, scenario, use case}, issn = {D1.1}, author = {Brian Trammell and Stephan Neuhaus and Francesco Matera and Ernst Biersack and Antonio Barbuzzi and Saverio Niccolini and Mohamed Ahmed and Maurizio Dusi and Tivadar Szemethy and Balazs Szabo and P. Casas and A B{\"a}r and Konstantina Papagiannaki and Yan Grunenberger and Ilias Leontiadis and Rolf Winter and Zied Ben-Houidi and Giovanna Carofiglio and Samir Ghamri-Doudane and Diego Perino and D Rossi} } @inproceedings {Gon2012, title = {Interaction or Interference: can AQM and Low Priority Congestion Control Successfully Collaborate}, booktitle = {ACM CoNEXT, Extended Abstract}, year = {2012}, month = {12/2012}, abstract = {

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 {\textquoteleft}{\textquoteleft}bufferbloat{\textquoteright}{\textquoteright} 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.

}, doi = {10.1145/2413247.2413263}, url = {http://www.enst.fr/drossi/paper/rossi12conext.pdf}, author = {YiXi Gong and D Rossi and C. Testa and S. Valenti and D. Taht} } @inproceedings {Rio2012, title = {Wire-speed statistical classification of network traffic on commodity hardware}, booktitle = {ACM Internet Measurement Conference (IMC)}, year = {2012}, month = {11/2012}, abstract = {

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.

}, doi = {10.1145/2398776.2398784}, author = {Pedro Maria Santiago del Rio and D Rossi and Francesco Gringoli and Lorenzo Nava and Luca Salgarelli and Javier Aracil} }