@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 {TrKu15, title = {Enabling Internet-Wide Deployment of Explicit Congestion Notification}, booktitle = {Proceedings of the 2015 Passive and Active Measurement Conference}, year = {2015}, month = {03/2015}, address = {New York}, abstract = {

\ac{ECN} is an TCP/IP extension to signal network congestion without packet loss, which has barely seen deployment though it was standardized and implemented more than a decade ago. On-going activities in research and standardization aim to make the usage of \ac{ECN} more beneficial. This measurement study provides an update on deployment status and newly assesses the marginal risk of enabling \ac{ECN} negotiation by default on client end-systems. Additionally, we dig deeper into causes of connectivity and negotiation issues linked to \ac{ECN}. We find that about five websites per thousand suffer additional connection setup latency when fallback per RFC 3168 is correctly implemented; we provide a patch for Linux to properly perform this fallback. Moreover, we detect and explore a number of cases in which \ac{ECN} brokenness is clearly path-dependent, i.e. on middleboxes beyond the access or content provider network. Further analysis of these cases can guide their elimination, further reducing the risk of enabling \ac{ECN} by default.

}, author = {Brian Trammell and Mirja K{\"u}hlewind and Damiano Boppart and Iain Learmonth and Gorry Fairhurst and Richard Scheffenegger} } @inproceedings {TrKuPAM15, title = {Enabling Internet-Wide Deployment of Explicit Congestion Notification}, booktitle = {Proceedings of the 2015 Passive and Active Measurement Conference}, year = {2015}, month = {Mar}, address = {New York}, url = {http://ecn.ethz.ch/ecn-pam15.pdf}, author = {Brian Trammell and Mirja K{\"u}hlewind and Damiano Boppart and Iain Learmonth and Gorry Fairhurst and Richard Scheffenegger} } @inproceedings {Dim2015, title = {Identifying the Root Cause of Video Streaming Issues on Mobile Devices}, booktitle = {CoNext}, year = {2015}, author = {G. Dimopoulos and I. Leontiadis and P. Barlet-Ros and K. Papagiannaki and P. Steenkiste} } @inproceedings {Yon2015, title = {A Lightweight Network Proximity Service Based On Neighborhood Models}, booktitle = {22nd IEEE Symposium on Communications and Vehicular Technology in the Benelux (SCVT)}, year = {2015}, month = {11/2015}, publisher = {IEEE}, organization = {IEEE}, address = {Luxembourg}, abstract = {

This paper proposes a network proximity service\ based on the neighborhood models used in recommender systems.\ Unlike previous approaches, our service infers network proximity\ without trying to recover the latency between network nodes. By\ asking each node to probe a number of landmark nodes which\ can be servers at Google, Yahoo and Facebook, etc., a simple\ proximity measure is computed and allows the direct ranking\ and rating of network nodes by their proximity to a target node.\ The service is thus lightweight and can be easily deployed in\ e.g. P2P and CDN applications. Simulations on existing datasets\ and experiments with a deployment over PlanetLab showed\ that our service achieves an accurate proximity inference that\ is comparable to state-of-the-art latency prediction approaches,\ while being much simpler.

}, author = {Liao, Yongjun and Du, Wei and Leduc, Guy} } @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 {Wei2014, title = {Rating Network Paths for Locality-Aware Overlay Construction and Routing}, journal = {IEEE/ACM Transactions on Networking}, volume = {23}, year = {2015}, month = {10/2015}, chapter = {1661}, abstract = {

This paper investigates the rating of network paths,\ i.e. acquiring quantized measures of path properties such as\ round-trip time and available bandwidth. Comparing to finegrained\ measurements, coarse-grained ratings are appealing in\ that they are not only informative but also cheap to obtain.

Motivated by this insight, we firstly address the scalable\ acquisition of path ratings by statistical inference. By observing\ similarities to recommender systems, we examine the applicability\ of solutions to recommender system and show that our\ inference problem can be solved by a class of matrix factorization\ techniques. A technical contribution is an active and progressive\ inference framework that not only improves the accuracy by\ selectively measuring more informative paths but also speeds\ up the convergence for available bandwidth by incorporating its\ measurement methodology.

Then, we investigate the usability of rating-based network\ measurement and inference in applications. A case study is\ performed on whether locality awareness can be achieved for\ overlay networks of Pastry and BitTorrent using inferred ratings.

We show that such coarse-grained knowledge can improve the\ performance of peer selection and that finer granularities do not\ always lead to larger improvements.

}, keywords = {matrix factorization, network inference, rating-based network measurement, recommender system}, author = {Du, Wei and Liao, Yongjun and Tao, Narisu and Geurts, Pierre and Fu, Xiaoming and Leduc, Guy} } @inproceedings {Hou2015, title = {A Study of the Impact of DNS Resolvers on Performance Using a Causal Approach}, booktitle = {Internet Teletraffic Congress}, year = {2015}, month = {08/2015}, address = {Ghent, Belgium}, abstract = {For a user to access any resource on the Internet, it is necessary to first locate a server hosting the requested resource. The Domain Name System service (DNS) represents the first step in this process, translating a human readable name, the resource host name, into an IP address. With the expansion of Content Distribution Networks (CDNs), the DNS service has seen its importance increase. In a CDN, objects are replicated on different servers to decrease the distance from the client to a server hosting the object that needs to be accessed. The DNS service should improve user experience by directing its demand to the optimal CDN server. While most of the Internet Service Providers (ISPs) offer a DNS service to their customers, it is now common to see clients using a public DNS service instead. This choice may have an impact on Web browsing performance. In this paper we study the impact of choosing one DNS server instead of another and we compare the performance of a large European ISP DNS service with the one of a public DNS service, Google DNS. We propose a causal approach to expose the structural dependencies of the different parameters impacted by the DNS service used and we show how to model these dependencies with a Bayesian network. This model allows us to explain and quantify the benefits obtained by clients using their ISP DNS service and to propose a solution to further improve their performance.}, keywords = {DNS, reasoner}, author = {Hadrien Hours and Ernst Biersack and Patrick Loiseau and Alessandro Finamore and Marco Mellia} } @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 {Nay2014, title = {The Cost of the {\textquotedblleft}S{\textquotedblright} in HTTPS}, booktitle = {ACM Conference on emerging Networking EXperiments and Technologies (CoNEXT)}, year = {2014}, month = {12/2014}, author = {David Naylor and Alessandro Finamore and Ilias Leontiadis and Yan Grunenberger and Marco Mellia and Kostantina Papagiannaki and Peter Steenkiste} } @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 {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 {Leo2014, title = {From Cells to Streets: Estimating Mobile Paths with Cellular-Side Data}, booktitle = {CoNEXT}, year = {2014}, publisher = {ACM}, organization = {ACM}, address = {Sydney, Australia}, author = {Ilias Leontiadis and Antonio Lima and Haewoon Kwak and Rade Stanojevic and David Wetherall and Konstantina Papagiannaki} } @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 {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} } @article {Lia2013, title = {DMFSGD: A decentralized matrix factorization algorithm for network distance prediction}, journal = {IEEE/ACM Transactions on Networking}, volume = {21}, year = {2013}, month = {10/2013}, chapter = {1511}, abstract = {

The knowledge of end-to-end network distances is\ essential to many Internet applications. As active probing of all\ pairwise distances is infeasible in large-scale networks, a natural\ idea is to measure a few pairs and to predict the other ones\ without actually measuring them. This paper formulates the\ prediction problem as matrix completion where the unknown\ entries in a pairwise distance matrix constructed from a network\ are to be predicted. By assuming that the distance matrix has\ a low-rank characteristics, the problem is solvable by lowrank\ approximation based on matrix factorization. The new\ formulation circumvents the well-known drawbacks of existing\ approaches based on Euclidean embedding.

A new algorithm, so-called Decentralized Matrix Factorization\ by Stochastic Gradient Descent (DMFSGD), is proposed. By\ letting network nodes exchange messages with each other, the\ algorithm is fully decentralized and only requires each node\ to collect and to process local measurements, with neither\ explicit matrix constructions nor special nodes such as landmarks\ and central servers. In addition, we compared comprehensively\ matrix factorization and Euclidean embedding to demonstrate\ the suitability of the former on network distance prediction. We\ further studied the incorporation of a robust loss function and\ of non-negativity constraints. Extensive experiments on various\ publicly-available datasets of network delays show not only the\ scalability and the accuracy of our approach, but also its usability\ in real Internet applications.

}, keywords = {matrix completion, matrix factorization, network distance prediction, stochastic gradient descent}, author = {Yongjun Liao and Wei Du and Pierre Geurts and Guy Leduc} } @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 {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 {Dus2013, title = {Plans for Using and Disseminating mPlane Knowledge}, number = {D7.2}, year = {2013}, month = {11/2013}, institution = {mPlane Consortium}, type = {Public Deliverable}, address = {Torino}, keywords = {dissemination, exploitation, open-source software, publications, standardization}, issn = {D7.2}, author = {Maurizio Dusi and Saverio Niccolini and Antonio Barbuzzi and M. Milanesio and Alessandro Finamore and Brian Trammell and Edion Tego and Francesco Matera and Tivadar Szemethy and Rolf Winter and Zied Ben-Houidi and Andrea Fregosi and Benoit Donnet and Fabrizio Invernizzi and Dimitri Papadimitriou and Ilias Leontiadis and Yan Grunenberger and P. Casas} } @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} } @article {Tra2013, title = {Temporal locality in today{\textquoteright}s content caching: why it matters and how to model it}, journal = {ACM SIGCOMM Computer Communication Review}, volume = {43}, year = {2013}, month = {10/2013}, chapter = {5}, abstract = {

The dimensioning of caching systems represents a difficult task in the design of infrastructures for content distribution in the current Internet. This paper addresses the problem of defining a realistic arrival process for the content requests generated by users, due its critical importance for both analytical and simulative evaluations of the performance of caching systems. First, with the aid of YouTube traces collected inside operational residential networks, we identify the characteristics of real traffic that need to be considered or can be safely neglected in order to accurately predict the performance of a cache. Second, we propose a new parsimonious traffic model, named the Shot Noise Model (SNM), that enables users to natively capture the dynamics of content popularity, whilst still being suf- ficiently simple to be employed effectively for both analytical and scalable simulative studies of caching systems. Finally, our results show that the SNM presents a much better solution to account for the temporal locality observed in real traffic compared to existing approaches.

}, doi = {10.1145/2541468.2541470}, author = {Stefano Traverso and Mohamed Ahmed and Michele Garetto and Paolo Giaccone and Emilio Leonardi and Saverio Niccolini} } @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} }