<?xml version="1.0" encoding="UTF-8"?><xml><records><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%">Brian Trammell</style></author><author><style face="normal" font="default" size="100%">Mirja Kuehlewind</style></author><author><style face="normal" font="default" size="100%">Elio Gubser</style></author><author><style face="normal" font="default" size="100%">Joe Hildebrand</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A New Transport Encapsulation for Middlebox Cooperation</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2015 IEEE Conference on Standards for Communications and Networking</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Oct</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Tokyo, Japan</style></pub-location><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>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dimitri Papadimitriou</style></author><author><style face="normal" font="default" size="100%">Davide Careglio</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Nonparametric Statistical Methods to Analyze the Internet Connectivity Reliability</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE International Conference on Communications Quality and Reliability (CQR 2015)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><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>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Walter Bellante</style></author><author><style face="normal" font="default" size="100%">Rosa Vilardi</style></author><author><style face="normal" font="default" size="100%">D Rossi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On Netflix catalog dynamics and caching performance</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE CAMAD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">09/2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.enst.fr/ drossi/paper/rossi13camad.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yves Vanaubel</style></author><author><style face="normal" font="default" size="100%">Jean-Jacques Pansiot</style></author><author><style face="normal" font="default" size="100%">Pascal Mérindol</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%">Network Fingerprinting: TTL-Based Router Signature</style></title><secondary-title><style face="normal" font="default" size="100%">ACM/USENIX Internet Measurement Conference (IMC)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">fingerprinting</style></keyword><keyword><style  face="normal" font="default" size="100%">initial TTL</style></keyword><keyword><style  face="normal" font="default" size="100%">MPLS router signature</style></keyword><keyword><style  face="normal" font="default" size="100%">network discovery</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%">10/2013</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Barcelona, Spain</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;Fingerprinting networking equipment has many potential applications and benefits&amp;nbsp;in network management and security. More generally, it is useful for the&amp;nbsp;understanding of network structures and their behaviors. In this paper, we&amp;nbsp;describe a simple fingerprinting mechanism based on the initial TTL values used&amp;nbsp;by routers to reply to various probing messages. We show that main classes&lt;br /&gt;obtained using this simple mechanism are meaningful to distinguish routers&amp;nbsp;platforms. Besides, it comes at a very low additional cost compared to standard&amp;nbsp;active topology discovery measurements. As a proof of concept, we apply our&amp;nbsp;method to gain more insight on the behavior of MPLS routers and to, thus, more&amp;nbsp;accurately quantify their visible/invisible deployment.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yves Vanaubel</style></author><author><style face="normal" font="default" size="100%">Jean-Jacques Pansiot</style></author><author><style face="normal" font="default" size="100%">Pascal Mérindol</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%">Network Fingerprinting: TTL-Based Router Signatures</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Internet Measurement Conference (IMC)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">fingerprinting</style></keyword><keyword><style  face="normal" font="default" size="100%">initial TTL</style></keyword><keyword><style  face="normal" font="default" size="100%">MPLS</style></keyword><keyword><style  face="normal" font="default" size="100%">network discovery</style></keyword><keyword><style  face="normal" font="default" size="100%">router signatures</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%">10/2013</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Barcelona, Spain</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;Fingerprinting networking equipment has many potential applications and benefits&amp;nbsp;in network management and security. More generally, it is useful for the&amp;nbsp;understanding of network structures and their behaviors. In this paper, we&amp;nbsp;describe a simple fingerprinting mechanism based on the initial TTL values used&amp;nbsp;by routers to reply to various probing messages. We show that main classes&amp;nbsp;obtained using this simple mechanism are meaningful to distinguish routers&lt;br /&gt;platforms. Besides, it comes at a very low additional cost compared to standard&amp;nbsp;active topology discovery measurements. As a proof of concept, we apply our&amp;nbsp;method to gain more insight on the behavior of MPLS routers and to, thus, more&amp;nbsp;accurately quantify their visible/invisible deployment.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alessandro Finamore</style></author><author><style face="normal" font="default" size="100%">Vinicius Gehlen</style></author><author><style face="normal" font="default" size="100%">Marco Mellia</style></author><author><style face="normal" font="default" size="100%">Maurizio M Munafo'</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The need for an intelligent measurement plane: The example of time-variant CDN policies</style></title><secondary-title><style face="normal" font="default" size="100%">Telecommunications Network Strategy and Planning Symposium (NETWORKS), 2012 XVth International </style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Facebook</style></keyword><keyword><style  face="normal" font="default" size="100%">Google</style></keyword><keyword><style  face="normal" font="default" size="100%">Monitoring</style></keyword><keyword><style  face="normal" font="default" size="100%">Organizations</style></keyword><keyword><style  face="normal" font="default" size="100%">Servers</style></keyword><keyword><style  face="normal" font="default" size="100%">Streaming media</style></keyword><keyword><style  face="normal" font="default" size="100%">Throughput</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/2012</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%">1 - 6 </style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we characterize how web-based services are delivered by large organizations in today's Internet. Taking advantage oftwo week-long data sets separated in time by 10 months and reporting the web activity of more than 10,000 ADSL residential customers, we identify the services offered by large organizations like Google, Akamai and Amazon. We then compare theevolution of both policies used to serve requests, and the infrastructure they use to match the users' demand. Results depict anovercrowded scenario in constant evolution. Big-players are more and more responsible for the majority of the volume and a plethora of other organizations offering similar or more specific services through different CDNs and traffic policies. Unfortunately, no standard tools and methodologies are available to capture and expose the hidden properties of this in constant evolution picture. A deeper understanding of such dynamics is however fundamental to improve the performance of current and future Internet. To this extend, we claim the need for a Internet-wide, standard, flexible and intelligent measurement plane to be added tothe current Internet infrastructure.</style></abstract></record></records></xml>