P2P IPTV Measurement: A Comparison Study

With the success of P2P file sharing, new emerging P2P applications arise on the Internet for streaming content like voice (VoIP) or live video (IPTV). Nowadays, there are lots of works measuring P2P file sharing or P2P telephony systems, but there is still no comprehensive study about P2P IPTV, whereas it should be massively used in the future. During the last FIFA world cup, we measured network traffic generated by P2P IPTV applications like PPlive, PPstream, TVants and Sopcast. In this paper we analyze some of our results during the same games for the applications. We focus on traffic statistics and churn of peers within these P2P networks. Our objectives are threefold: we point out the traffic generated to understand the impact they will have on the network, we try to infer the mechanisms of such applications and highlight differences, and we give some insights about the users' behavior.Comment: 10 page

Characterization of P2P IPTV Traffic: Scaling Analysis

P2P IPTV applications arise on the Internet and will be massively used in the future. It is expected that P2P IPTV will contribute to increase the overall Internet traffic. In this context, it is important to measure the impact of P2P IPTV on the networks and to characterize this traffic. Dur- ing the 2006 FIFA World Cup, we performed an extensive measurement campaign. We measured network traffic generated by broadcasting soc- cer games by the most popular P2P IPTV applications, namely PPLive, PPStream, SOPCast and TVAnts. From the collected data, we charac- terized the P2P IPTV traffic structure at different time scales by using wavelet based transform method. To the best of our knowledge, this is the first work, which presents a complete multiscale analysis of the P2P IPTV traffic. Our results show that the scaling properties of the TCP traffic present periodic behavior whereas the UDP traffic is stationary and lead to long- range depedency characteristics. For all the applications, the download traffic has different characteristics than the upload traffic. The signaling traffic has a significant impact on the download traffic but it has negligible impact on the upload. Both sides of the traffic and its granularity has to be taken into account to design accurate P2P IPTV traffic models.Comment: 27p, submitted to a conferenc

Using Social Network Information into ICN

It was presented at NOMEN 2013 as a poster. NOMEN 2013 was a workshop held in IEEE INFOCOM 2013Online Social Networks carry extremely valuable information about their users and their relationships. We argue that this knowledge can help to drastically improve the efficiency of Information Centric Networks. In this paper, we propose a first step to include social infor- mation into ICN architectures. We conjecture a small number of users dominate the activity and receive most attention of others users in the social networks and we argue they produce content that will be more likely to be consumed, and in consequence their content must be replicated. We then propose a caching strategy based on prioritizing their content. We simulate a social network model where the proposed caching strategy is evaluated against common ICN caching strategies. Finally, we show that inclusion of social information into ICN networks may help to improve cache performances

SRSC: SDN-based Routing Scheme for CCN

International audienceContent delivery such as P2P or video streaming generates the main part of the Internet traffic and Content Centric Network (CCN) appears as an appropriate architecture to satisfy the user needs. However, the lack of scalable routing scheme is one of the main obstacles that slows down a large deployment of CCN at an Internet-scale. In this paper we propose to use the Software-Defined Networking (SDN) paradigm to decouple data plane and control plane and present SRSC, a new routing scheme for CCN. Our solution is a clean-slate approach using only CCN messages and the SDN paradigm. We implemented our solution into the NS-3 simulator and perform simulations of our proposal. SRSC shows better performances than the flooding scheme used by default in CCN: it reduces the number of messages, while still improves CCN caching performances

A Comparison of Caching Strategies for Content Centric Networking

International audienceContent Centric Networking (CCN) is a new architecture for a future Internet. CCN relies on in-network caching capabilities of nodes and the efficiency of this architecture depends drastically on performances of caching strategies. Thus, there have been a lot of studies proposing new caching strategies to improve the performances of CCN. However, among all these strategies, it is still unclear which one performs better as there is a lack of common environment to compare these strategies. In this paper, we compare the performances of CCN caching strategies within the same simulation environment. We build a common evaluation scenario and we compare via simulation five relevant caching strategies: Leave Copy Everywhere (LCE), Leave Copy Down (LCD), ProbCache, Cache " Less " For More and MAGIC. We analyze the performances of all the strategies in terms of Cache Hit, Stretch, Diversity and Complexity, and determine the cache strategy that fits the best with every scenario

MPC: Popularity-based Caching Strategy for Content Centric Networks

International audienceContent Centric Networking (CCN) has recently emerged as a promising architecture to deliver content at large- scale. It is based on named-data where a packet address names content and not its location. Then, the premise is to cache content on the network nodes along the delivery path. An important feature for CCN is therefore to manage the cache of the nodes. In this paper, we present Most-Popular Content (MPC), a new caching strategy adapted to CCN networks. By caching only popular content, we show through extensive simulation experiments that MPC is able to cache less content while, at the same time, it still achieves a higher Cache Hit and outperforms existing default caching strategy in CCN

Croissance Verte dans NDN: Déploiement des Content Stores

International audienceL'architecture Named-Data Networking (NDN) consiste en un réseau de caches, o` u les noeuds peuvent stocker les données qui transitent pour satisfaire les futures requêtes. La mémoire requisè a chaque noeud, appelée Content Store, représente ainsi la majeure partie du coût de l'infrastructure. Cet article se propose d'´ etudier s'il est utile que tous les noeuds soient equipés de Content Stores pour améliorer les performances de l'architecture NDN. Pour cela, nous etudions l'impact du nombre de Content Stores dans un réseau NDN et evaluons ses performances. Nous montrons a travers d'importantes expériences de simulations avec NS-3 et son module ndnSIM que les performances de NDN sont optimales avec seulement 50% de noeuds equipés de Content Stores. C'est un résultat important pour les opérateurs réseaux car cela montre que l'architecture NDN peut etre déployéè a un coût d'infrastructure réduit

Green Growth in NDN: Deployment of Content Stores

International audienceNamed-Data Networking architecture relies on cache networks, where nodes store the data for further requests. However, the memory needed at each node called Content Store represents the most significant part of the entire cost of the infrastructure that has to be supported by network providers, making difficult the change from the current Internet infrastructure to a Future Internet based on NDN. Thus, a legitimate question would be: "are all these Content Stores useful in a large-scale NDN network?" In this paper, we investigate theimpact of Content Stores in NDN network, and we evaluate the performances of the NDN architecture according to the number of Content Stores effectively deployed in the network. We show through extensive simulation experiments in NS-3 that only about 50% of nodes with Content Stores is enough to achieve higher level of performances than a fully-deployed NDN network. This result is very important for the deployment of NDN architecture as it shows that the infrastructure cost can be drastically reduced and it is an incentive for network providers that benefits directly from this result

Implementation and Evaluation of a Controller-Based Forwarding Scheme for NDN

International audienceNamed-Data Networking (NDN) is a novel clean-slate architecture for Future Internet. It has been designed to take into account a new use of the Internet and especially accessing content for a large number of users, and it integrates several features such as in-network caching, security or multipath. As NDN relies on content names instead of host address, it cannot rely on traditional Internet routing, and it is therefore essential to propose a routing scheme adapted for NDN. To this end, in this paper, we present SRSC, our SDN-based Routing Scheme for CCN/NDN and its implementation. SRSC relies on the SDN paradigm.A controller is responsible to forward decisions and to set up rules into NDN nodes. We implement SRSC into NDNx and we also deploy an NDN testbed within a virtual environment and real ISP topology in order to evaluate the performances of our proposal with real-world experiments. We demonstrate the feasibility of SRSC and its ability to forward Interest messages in a fully deployed NDN environment, while keeping low overhead and computation time and high caching performances