@inproceedings {Van2016, title = {A Brief History of MPLS Usage in IPv6}, booktitle = {Passive and Active Measurement Conference (PAM)}, year = {2016}, month = {03/2016}, abstract = {

Recent researches have stated the fast deployment of IPv6. It\ has been demonstrated that IPv6 grows much faster, being so more and more\ adopted by both Internet service providers but also by servers and end-hosts.\ In parallel, researches have been conducted to discover and assess the usage of\ MPLS tunnels. Indeed, recent developments in the ICMP protocol make certain
categories of MPLS tunnels transparent to traceroute probing. However, these\ studies focus only on IPv4, where MPLS is strongly deployed.

In this paper, we provide a first look at how MPLS is used under IPv6\ networks using traceroute data collected by CAIDA.\ We have observed, at the first glance, that the MPLS deployment and usage seem to greatly differ between IPv4 and IPv6,\ in particular in the way MPLS label stacks are used. While label stacks are not that frequent\ in IPv4 (and mostly correspond to a VPN usage), they are prevalent in IPv6. \ However, after a deeper look at the label stack typical content in IPv6, we understand that 2-label stack tunnels are mainly used for dual stack 6PE tunnels and ECMP load sharing purpose. \ The technical deployment of such tunnels is really similar to VPN in practice but the objective is not the same (they are standard tunnels made with the IPv4 LDP for carrying IPv6 traffic).

}, keywords = {6PE tunnels, IPv6, LSE Stack, MPLS}, author = {Yves Vanaubel and Pascal M{\'e}rindol and Jean-Jacques Pansiot and Benoit Donnet} } @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 {Van2015, title = {MPLS Under the Microscope: Revealing Actual Transit Path Diversity}, booktitle = {Internet Measurement Conference (IMC)}, year = {2015}, month = {10/2015}, abstract = {

Traffic Engineering (TE) is one of the keys for improving packet forwarding in\ the Internet. It allows IP network operators to finely tune their forwarding\ paths according to various customer needs. One of the most popular tool\ available today for optimizing the use of networking resources is MPLS. On the\ one hand, operators may use MPLS and label distribution mechanisms such as RSVP-TE\ in conjunction with BGP to define multiple transit paths (for a given edge pair)
verifying different constraints on their network. On the other hand, when\ operators simply enable LDP for distributing MPLS labels in order to improve the\ scalability of their network, another kind of path diversity may appear thanks\ to the ECMP feature of IGP routing.

In this paper, using an MPLS labels analysis, we demonstrate that it is possible\ to better understand the transit path diversity deployed within a given ISP.\ More specifically, we introduce the Label Pattern Recognition (LPR) algorithm, a\ method for analyzing traceroute data including MPLS information. LPR reveals\ the actual usage of MPLS according to the inferred label distribution protocol and\ is able to make the distinction between ECMP and TE multi-path forwarding.\ Based on an extensive and longitudinal traceroute dataset obtained from CAIDA,
we apply LPR and find that each ISP behavior is really specific in regard to its\ MPLS usage. In particular, we are able to observe independently for each ISP\ the MPLS path diversity and usage, and its evolution over time.\ Globally speaking, the main outcomes of our study are that (i) the usage of\ MPLS has been increasing over the the last five years with basic encapsulation\ being predominant, (ii) path diversity is mainly provided thanks to ECMP and\ LDP, and, (iii), TE using MPLS is as common as MPLS without path diversity.

}, keywords = {ECMP, LDP, MPLS, multipath, network discovery, RSVP-TE, traceroute, traffic engineering}, author = {Yves Vanaubel and Pascal M{\'e}rindol and Jean-Jacques Pansiot and Benoit Donnet} } @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 {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} } @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-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} } @inproceedings {Cit2014, title = {On the Quality of BGP Route Collectors for iBGP Policy Inference}, booktitle = {IFIP Networking}, year = {2014}, month = {June 2014}, abstract = {

A significant portion of what is known about Internet routing stems out from\ public BGP datasets. For this reason, numerous research efforts were devoted to\ (i) assessing the (in)completeness of the datasets, (ii) identifying biases\ in the dataset, and (iii) augmenting data quality by optimally placing new\ collectors. However, those studies focused on techniques to extract information\ about the AS-level Internet topology.

In this paper, we show that considering different metrics influences the\ conclusions about biases and collector placement. Namely, we compare AS-level\ topology discovery with \iac inference. We find that the same datasets exhibit\ significantly diverse biases for these two metrics. For example, the sensitivity\ to the number and position of collectors is noticeably different. Moreover, for\ both metrics, the marginal utility of adding a new collector is strongly\ localized with respect to the proximity of the collector. Our results suggest\ that the {\textquoteleft}{\textquoteleft}optimal{\textquoteright}{\textquoteright} position for new collectors can only be defined with\ respect to a specific metric, hence posing a fundamental trade-off for\ maximizing the utility of extensions to the BGP data collection infrastructure.

}, keywords = {bias, iBGP policies, measurement, network topology}, author = {Luca Cittadini and Stefano Vissichio and Benoit Donnet} } @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 {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} } @inbook {Pap2013b, title = {Measurement-based Experimental Research Methodology}, booktitle = {Measurement Methodology and Tools}, series = {Lecture Notes in Computer Science Series}, volume = {7586}, year = {2013}, pages = {pp 5-22}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, issn = {978-3-642-41295-0}, doi = {10.1007/978-3-642-41296-7_2}, author = {D. Papadimitriou and L. F{\`a}brega and P. Vil{\`a} and D. Careglio and P. Demeester} } @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 {Van2013, title = {Network Fingerprinting: TTL-Based Router Signature}, booktitle = {ACM/USENIX Internet Measurement Conference (IMC)}, year = {2013}, month = {10/2013}, address = {Barcelona, Spain}, abstract = {

Fingerprinting networking equipment has many potential applications and benefits\ in network management and security. More generally, it is useful for the\ understanding of network structures and their behaviors. In this paper, we\ describe a simple fingerprinting mechanism based on the initial TTL values used\ by routers to reply to various probing messages. We show that main classes
obtained using this simple mechanism are meaningful to distinguish routers\ platforms. Besides, it comes at a very low additional cost compared to standard\ active topology discovery measurements. As a proof of concept, we apply our\ method to gain more insight on the behavior of MPLS routers and to, thus, more\ accurately quantify their visible/invisible deployment.

}, keywords = {fingerprinting, initial TTL, MPLS router signature, network discovery}, doi = {10.1145/2504730.2504761}, author = {Yves Vanaubel and Jean-Jacques Pansiot and Pascal M{\'e}rindol and Benoit Donnet} } @inproceedings {Van2013a, title = {Network Fingerprinting: TTL-Based Router Signatures}, booktitle = {ACM Internet Measurement Conference (IMC)}, year = {2013}, month = {10/2013}, address = {Barcelona, Spain}, abstract = {

Fingerprinting networking equipment has many potential applications and benefits\ in network management and security. More generally, it is useful for the\ understanding of network structures and their behaviors. In this paper, we\ describe a simple fingerprinting mechanism based on the initial TTL values used\ by routers to reply to various probing messages. We show that main classes\ obtained using this simple mechanism are meaningful to distinguish routers
platforms. Besides, it comes at a very low additional cost compared to standard\ active topology discovery measurements. As a proof of concept, we apply our\ method to gain more insight on the behavior of MPLS routers and to, thus, more\ accurately quantify their visible/invisible deployment.

}, keywords = {fingerprinting, initial TTL, MPLS, network discovery, router signatures}, author = {Yves Vanaubel and Jean-Jacques Pansiot and Pascal M{\'e}rindol and Benoit Donnet} } @inproceedings {Det2013, title = {Revealing Middlebox Interference with Tracebox}, booktitle = {ACM/USENIX Internet Measurement Conference (IMC)}, year = {2013}, month = {10/2013}, abstract = {

Middleboxes such as firewalls, NAT, proxies, or Deep Pack-et Inspection play an\ increasingly important role in various types of IP networks, including\ enterprise and cellular networks. Recent studies have shed the light on their\ impact on real traffic and the complexity of managing them. Network operators\ and researchers have few tools to understand the impact of those boxes on any
path. In this paper, we propose tracebox, an extension to the widely used\ traceroute tool, that is capable of detecting various types of middlebox\ interference over almost any path. \ tracebox sends IP packets containing TCP\ segments with different TTL values and analyses the packet encapsulated in the\ returned ICMP messages. Further, as recent routers quote, in the ICMP message,\ the entire IP packet that they received, tracebox is able to detect any\ modification performed by upstream middleboxes. In addition, tracebox can often\ pinpoint the network hop where the middlebox interference occurs. We evaluate\ tracebox with measurements performed on PlanetLab nodes. Our analysis reveals\ various types of middleboxes that were not expected on such an experimental\ testbed supposed to be connected to the Internet without any restriction.

}, keywords = {middlebox, network discovery, tracebox}, doi = {10.1145/2504730.2504757}, author = {Gregory Detal and Benjamin Hesmans and Olivier Bonaventure and Yves Vanaubel and Benoit Donnet} } @inproceedings {Val2013, title = {RILAnalyzer: a Comprehensive 3G Monitor on Your Phone}, booktitle = {Internet Measurement Conference (IMC)}, year = {2013}, doi = {10.1145/2504730.2504764}, author = {Narseo Vallina-Rodriguez and A. Aucinas and M. Almeida and Yan Grunenberger and Konstantina Papagiannaki and Jon Crowcroft} } @inproceedings {Val2012, title = {Breaking for commercials: characterizing mobile advertising}, booktitle = {Proceedings of the 2012 ACM conference on Internet measurement conference}, year = {2012}, publisher = {ACM}, organization = {ACM}, address = {Boston, MA}, abstract = {

Mobile phones and tablets can be considered as the first incarnation of the post-PC era. Their explosive adoption rate has been driven by a number of factors, with the most signifcant influence being applications (apps) and app markets. Individuals and organizations are able to develop and publish apps, and the most popular form of monetization is mobile advertising.

The mobile advertisement (ad) ecosystem has been the target of prior research, but these works typically focused on a small set of apps or are from a user privacy perspective. In this work we make use of a unique, anonymized data set corresponding to one day of traffic for a major European mobile carrier with more than 3 million subscribers. We further take a principled approach to characterize mobile ad traffic along a number of dimensions, such as overall traffic, frequency, as well as possible implications in terms of en- ergy on a mobile device.

Our analysis demonstrates a number of inefficiencies in today{\textquoteright}s ad delivery. We discuss the benefits of well-known techniques, such as pre-fetching and caching, to limit the energy and network signalling overhead caused by current systems. A prototype im- plementation on Android devices demonstrates an improvement of 50\% in terms of energy consumption for offline ad-sponsored apps while limiting the amount of ad related traffic.\ 

}, keywords = {advertisement, caching, cellular, energy, smartphones, traffic}, isbn = {978-1-4503-1705-4}, doi = {10.1145/2398776.2398812}, url = {http://doi.acm.org/10.1145/2398776.2398812}, author = {Narseo Vallina-Rodriguez and Jay Shah and Alessandro Finamore and Yan Grunenberger and Konstantina Papagiannaki and Hamed Haddadi and Jon Crowcroft} } @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} }