<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pietro Michiardi</style></author><author><style face="normal" font="default" size="100%">Antonio Barbuzzi</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Stefano Traverso</style></author><author><style face="normal" font="default" size="100%">Daniele Apiletti</style></author><author><style face="normal" font="default" size="100%">Elena Baralis</style></author><author><style face="normal" font="default" size="100%">Tania Cerquitelli</style></author><author><style face="normal" font="default" size="100%">Silvia Chiusano</style></author><author><style face="normal" font="default" size="100%">Luigi Grimaudo</style></author><author><style face="normal" font="default" size="100%">A. Rufini</style></author><author><style face="normal" font="default" size="100%">Francesco Matera</style></author><author><style face="normal" font="default" size="100%">A. Valentii</style></author><author><style face="normal" font="default" size="100%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Mohamed Ahmed</style></author><author><style face="normal" font="default" size="100%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">L. Németh</style></author><author><style face="normal" font="default" size="100%">R. Szalay</style></author><author><style face="normal" font="default" size="100%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">Yan Grunenberger</style></author><author><style face="normal" font="default" size="100%">P. Casas</style></author><author><style face="normal" font="default" size="100%">Alessandro D’Alconzo</style></author><author><style face="normal" font="default" size="100%">A Bär</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">YiXi Gong</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Basic Network Data Analysis</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">big data</style></keyword><keyword><style  face="normal" font="default" size="100%">storage</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">D3.1</style></number><publisher><style face="normal" font="default" size="100%">mPlane Consortium</style></publisher><pub-location><style face="normal" font="default" size="100%">Torino</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This document describes the requirements, input, output for the algorithms needed to perform analytic tasks on a large amount of data, in the context of WP3. Starting from the use cases defined in WP1, we identify the algorithms needed to address the various scenario requirements. Operating on a large amount of data, these algorithms strive for parallel and scalable approaches; the designing and implementation of the algorithm itself can be a challenging research task since today very little is known concerning how to develop efficient and scalable algorithms that runs on parallel processing frameworks.&lt;br /&gt;The algorithm in the storage layer are characterized by the fact that they operate on a large amount of data, and produce a concise representation of it, extracting features and aggregating it, so that the produced output is easier to handle and understand. Depending on the amount of data produced, on the scenario characteristics and on the time constraints, algorithms can require a real time (or near real time) or a batch processing.&lt;br /&gt;For each algorithm and use case, the input data and the initial state, the computation to run and the output produced are described.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Public Deliverable</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">YiXi Gong</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">C. Testa</style></author><author><style face="normal" font="default" size="100%">S. Valenti</style></author><author><style face="normal" font="default" size="100%">D. Taht</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Fighting the bufferbloat: on the coexistence of AQM and low priority congestion control</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE INFOCOM Workshop on Traffic Monitoring and Analysis  (TMA'13)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Bufferbloat</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.enst.fr/ drossi/paper/rossi13tma-b.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alessandro Capello</style></author><author><style face="normal" font="default" size="100%">Fabrizio Invernizzi</style></author><author><style face="normal" font="default" size="100%">Omar Jabr</style></author><author><style face="normal" font="default" size="100%">Dimitri Papadimitriou</style></author><author><style face="normal" font="default" size="100%">Dario Rossi</style></author><author><style face="normal" font="default" size="100%">YiXi Gong</style></author><author><style face="normal" font="default" size="100%">Brian Trammell</style></author><author><style face="normal" font="default" size="100%">Marco Milanesio</style></author><author><style face="normal" font="default" size="100%">Ernst Biersack</style></author><author><style face="normal" font="default" size="100%">Rolf Winter</style></author><author><style face="normal" font="default" size="100%">Francesco Matera</style></author><author><style face="normal" font="default" size="100%">Arianna Rufini</style></author><author><style face="normal" font="default" size="100%">Edion Tego</style></author><author><style face="normal" font="default" size="100%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Balazs Szabo</style></author><author><style face="normal" font="default" size="100%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Marco Mellia</style></author><author><style face="normal" font="default" size="100%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">Benoit Donnet</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">First Data Collection Track Record</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">data sets</style></keyword><keyword><style  face="normal" font="default" size="100%">integration</style></keyword><keyword><style  face="normal" font="default" size="100%">measurement systems</style></keyword><keyword><style  face="normal" font="default" size="100%">scenarios</style></keyword><keyword><style  face="normal" font="default" size="100%">use cases</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">11/2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">D5.1</style></number><publisher><style face="normal" font="default" size="100%">mPlane Consortium</style></publisher><pub-location><style face="normal" font="default" size="100%">Torino</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Private Deliverable</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">YiXi Gong</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author><author><style face="normal" font="default" size="100%">Emilio Leonardi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modeling the interdependency of low-priority congestion control and active queue management</style></title><secondary-title><style face="normal" font="default" size="100%"> 25th International Teletraffic Congress (ITC'25), Runner up for best-paper award</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Recently, a negative interplay has been shown to&lt;br /&gt;arise when scheduling/AQM techniques and low-priority conges-&lt;br /&gt;tion control protocols are used together: namely, AQM resets&lt;br /&gt;the relative level of priority among congestion control protocols.&lt;br /&gt;This work explores this issue by (i) studying a fluid model that&lt;br /&gt;describes system dynamics of heterogeneous congestion control&lt;br /&gt;protocols competing on a bottleneck link governed by AQM and&lt;br /&gt;(ii) proposing a system level solution able to reinstate priorities&lt;br /&gt;among protocols.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dimitri Papadimitriou</style></author><author><style face="normal" font="default" size="100%">Dario Rossi</style></author><author><style face="normal" font="default" size="100%">YiXi Gong</style></author><author><style face="normal" font="default" size="100%">Brian Trammell</style></author><author><style face="normal" font="default" size="100%">Marco Milanesio</style></author><author><style face="normal" font="default" size="100%">Ernst Biersack</style></author><author><style face="normal" font="default" size="100%">Rolf Winter</style></author><author><style face="normal" font="default" size="100%">Francesco Matera</style></author><author><style face="normal" font="default" size="100%">Maurizio Dusi</style></author><author><style face="normal" font="default" size="100%">Balazs Szabo</style></author><author><style face="normal" font="default" size="100%">Tivadar Szemethy</style></author><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Marco Mellia</style></author><author><style face="normal" font="default" size="100%">Alessandro Capello</style></author><author><style face="normal" font="default" size="100%">Fabio Invernizzi</style></author><author><style face="normal" font="default" size="100%">Omar Jabr</style></author><author><style face="normal" font="default" size="100%">Ilias Leontiadis</style></author><author><style face="normal" font="default" size="100%">Benoit Donnet</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Selection of Existing Probes and Datasets</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">active probes</style></keyword><keyword><style  face="normal" font="default" size="100%">existing probes</style></keyword><keyword><style  face="normal" font="default" size="100%">passive probes</style></keyword><keyword><style  face="normal" font="default" size="100%">probes</style></keyword><keyword><style  face="normal" font="default" size="100%">proxy probes</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08/2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">D2.1</style></number><publisher><style face="normal" font="default" size="100%">mPlane Consortium</style></publisher><pub-location><style face="normal" font="default" size="100%">Torino</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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'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</style></abstract><work-type><style face="normal" font="default" size="100%">Public Deliverable</style></work-type></record></records></xml>