Results 1 - 10
of
17
A Measurement Study of a Large-Scale P2P IPTV System
"... ... to flood Internet access and backbone ISPs with massive amounts of new traffic. We recently measured 200,000 IPTV users for a single program, receiving at an aggregate simultaneous rate of 100 gigabits/second. Although many architectures are possible for IPTV video distribution, several chunkdri ..."
Abstract
-
Cited by 176 (20 self)
- Add to MetaCart
(Show Context)
... to flood Internet access and backbone ISPs with massive amounts of new traffic. We recently measured 200,000 IPTV users for a single program, receiving at an aggregate simultaneous rate of 100 gigabits/second. Although many architectures are possible for IPTV video distribution, several chunkdriven P2P architectures have been successfully deployed in the Internet. In order to gain insight into chunk-driven P2P IPTV systems and the traffic loads they place on ISPs, we have undertaken an in-depth measurement study of one of the most popular IPTV systems, namely, PPLive. We have developed a dedicated PPLive crawler, which enables us to study the global characteristics of the chunk-driven PPLive system. We have also collected extensive packet traces for various different measurement scenarios, including both campus access network and residential access networks. The measurement results obtained through these platforms bring important insights into IPTV user behavior, P2P IPTV traffic overhead and redundancy, peer partnership characteristics, P2P IPTV viewing quality, and P2P IPTV design principles.
Measurement and modeling a large-scale overlay for multimedia streaming
- in Proc. QShine
, 2007
"... This paper presents results from our measurement and modeling efforts on the large-scale peer-to-peer (p2p) overlay graphs spanned by the PPLive system which is arguably the most popular and largest multimedia streaming p2p system today. We believe that our findings can be used to understand large-s ..."
Abstract
-
Cited by 25 (3 self)
- Add to MetaCart
(Show Context)
This paper presents results from our measurement and modeling efforts on the large-scale peer-to-peer (p2p) overlay graphs spanned by the PPLive system which is arguably the most popular and largest multimedia streaming p2p system today. We believe that our findings can be used to understand large-scale p2p streaming systems for future planning of resource usage, and to provide useful and practical hints for future design of large-scale p2p streaming systems. Unlike other previous studies on PPLive, which focused on either network-centric or user-centric measurements of the system, our study is unique in (a) focusing on PPLive overlay-specific characteristics, and (b) being the first to derive mathematical models for its distributions of channel population size and session length. Our studies also reveal characteristics of multimedia streaming p2p overlays that are markedly different from existing file-sharing p2p overlays. Specifically, we find that: (1) Small PPLive overlays (as many as 500 nodes) are similar to random graphs in structure, (2) Average degree of a peer in the overlay (i.e., its out-degree) is independent of channel population size, (3) The availability correlation between PPLive peer pairs is bimodal, i.e., some pairs have highly correlated availability, while others have no correlation, (4) Unlike p2p file-sharing users, PPLive peers are impatient, (5) Session lengths (discretized, per channel) are typically geometrically distributed, (6) Channel Population Size variations are larger than in p2p file-sharing networks, yet they can be fitted with polynomial mathematical models. We conclude with a series of suggestions on how our findings can improve IPTV future design. 1.
An empirical study of the coolstreaming+ system
- IEEE Journal on Selected Areas in Communications, Special Issue on Advances in Peer-to-Peer Streaming Systems
, 2007
"... Abstract—In recent years, there has been significant interest ..."
Abstract
-
Cited by 24 (4 self)
- Add to MetaCart
Abstract—In recent years, there has been significant interest
Understanding overlay characteristics of a large-scale peer-to-peer IPTV system
- ACM Trans. Multim. Comp. Comm. Appl
"... This paper presents results from our measurement and modeling efforts on the large-scale peerto-peer (p2p) overlay graphs spanned by the PPLive system, the most popular and largest p2p IPTV (Internet Protocol Television) system today. Unlike other previous studies on PPLive, which focused on either ..."
Abstract
-
Cited by 18 (1 self)
- Add to MetaCart
(Show Context)
This paper presents results from our measurement and modeling efforts on the large-scale peerto-peer (p2p) overlay graphs spanned by the PPLive system, the most popular and largest p2p IPTV (Internet Protocol Television) system today. Unlike other previous studies on PPLive, which focused on either network-centric or user-centric measurements of the system, our study is unique in (a) focusing on PPLive overlay-specific characteristics, and (b) being the first to derive mathematical models for its distributions of node degree, session length, and peer participation in simultaneous overlays. Our studies reveal characteristics of multimedia streaming p2p overlays that are markedly different from existing file-sharing p2p overlays. Specifically, we find that: (1) PPLive overlays are similar to random graphs in structure and thus more robust and resilient to the massive failure of nodes, (2) Average degree of a peer in the overlay is independent of the channel population size and the node degree distribution can be fitted by a piecewise function, (3) The availability correlation between PPLive peer pairs is bimodal, i.e., some pairs have highly correlated availability, while others have no correlation, (4) Unlike p2p file-sharing peers, PPLive peers are impatient and session lengths (discretized, per channel) are typically geometrically distributed, (5) Channel
Broadcasting on large scale heterogeneous platforms under the bounded multi-port model
- in Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium on. IEEE, 2010
"... Abstract—We consider the classical problem of broadcasting a large message at an optimal rate in a large scale distributed network. The main novelty of our approach is that we consider that the set of participating nodes can be split into two parts: ”green ” nodes that stay in the open-Internet and ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
(Show Context)
Abstract—We consider the classical problem of broadcasting a large message at an optimal rate in a large scale distributed network. The main novelty of our approach is that we consider that the set of participating nodes can be split into two parts: ”green ” nodes that stay in the open-Internet and ”red ” nodes that lie behind firewalls or NATs. Two red nodes cannot communicate directly, but rather need to use a green node as a gateway for transmitting a message. In this context, we are interested in both maximizing the throughput (i.e. the rate at which nodes receive the message) and minimizing the degree at the participating nodes, i.e. the number of TCP connections they must handle simultaneously. We both consider cyclic and acyclic solutions for the flow graph. In the cyclic case, our main contributions are a closed form formula for the optimal cyclic throughput and the proof that the optimal solution may require arbitrarily large degrees. In the acyclic case, we prove that it is possible to achieve the optimal throughput with low degree. Then, we prove a worst case ratio between the optimal acyclic and cyclic throughput and show through simulations that this ratio is on average very close to 1, which makes acyclic solutions efficient both in terms of the throughput and the number of connections.
Fast Packet Recovery for PULL-Based P2P Live Streaming Systems
"... Abstract — Nowadays, Peer-to-Peer (P2P) networks play an essential role in large scale live video transmission. Though many algorithms have been proposed to deal with packet loss in P2P networks, there is still a lack of mechanisms dealing with the delay and loss constraints of live video streaming. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract — Nowadays, Peer-to-Peer (P2P) networks play an essential role in large scale live video transmission. Though many algorithms have been proposed to deal with packet loss in P2P networks, there is still a lack of mechanisms dealing with the delay and loss constraints of live video streaming. In this paper, we propose a new loss recovery mechanism allowing the quality optimization of live video transmitted on P2P networks. Its principal feature consists in request retransmission of lost packets from a peer different of the original packet sender. This mechanism increases the probability of choosing the best available peer to make the retransmission and hence, improves the received video quality before its display time. We show by simulations that the proposed solution is efficient in comparison with the current retransmission mechanisms. This solution is independent from the sender peer selection used algorithm. Keywords: Peer-to-peer network; video streaming; packet loss; packet recovery; efficient; retransmission mechanism. I.
Collabrium: Active Traffic Pattern Prediction for Boosting P2P Collaboration
"... Emerging large scale Internet applications such as IPTV, VOD and File Sharing base their infrastructure on P2P technology. Yet, the characteristic fluctuational throughput of source peers affect the QOS of such applications which might be reflected by a reduced download rate in file sharing or even ..."
Abstract
- Add to MetaCart
(Show Context)
Emerging large scale Internet applications such as IPTV, VOD and File Sharing base their infrastructure on P2P technology. Yet, the characteristic fluctuational throughput of source peers affect the QOS of such applications which might be reflected by a reduced download rate in file sharing or even worse- annoying freezes in a streaming service. A significant factor for the unstable supply of source peers is the behavior of other processes running on the source peer that consume bandwidth resources. In this paper we present Collabrium- a collaborative solution that employs a machine learning approach to actively predict load in the uplink of source peers and alert their clients to replace their source. Experiments on home machines demonstrated successful predictions of upcoming loads and Collabrium learned the behavior of popular heavy bandwidth consuming protocols such as eMule & BitTorrent correctly with no prior knowledge. 1.
Maxtream: Stabilizing P2P Streaming by Active Prediction of Behavior Patterns
"... In theory, peer-to-peer (P2P) based streaming designs and simulations provide a promising alternative to serverbased streaming systems both in cost and scalability. In practice however, implementations of P2P based IPTV and VOD failed to provide a satisfying QoS as the characteristic fluctuational t ..."
Abstract
- Add to MetaCart
(Show Context)
In theory, peer-to-peer (P2P) based streaming designs and simulations provide a promising alternative to serverbased streaming systems both in cost and scalability. In practice however, implementations of P2P based IPTV and VOD failed to provide a satisfying QoS as the characteristic fluctuational throughput of a peer’s uplink leads to frequent annoying hiccups, substantial delays and latency for those who download from it. A significant factor for the unstable throughput of peers ’ uplink is the behavior of other processes running on the source peer that consume bandwidth resources. In this paper we propose Maxtream- a machine learning based solution that actively predicts load in the uplink of streaming peers and coordinates source peers exchanges between peers that suffer from buffer underrun and peers that enjoy satisfactory buffer size for coping with future problems. Simulation and experiments have shown that the solution successfully predicts upcoming load in popular protocols and can improve the QoS in existing P2P streaming networks. 1.
Optimisation de la retransmission des paquets perdus en streaming P2P
"... Résumé — Les réseaux pair-à-pair (P2P) jouent aujourd'hui un rôle primordial dans la livraison de la vidéo à grande échelle. La perte des paquets sur les réseaux IP, peut affecter défavorablement la qualité de la vidéo reçue. Différents mécanismes de réparation de perte sont utilisés aujourd&ap ..."
Abstract
- Add to MetaCart
(Show Context)
Résumé — Les réseaux pair-à-pair (P2P) jouent aujourd'hui un rôle primordial dans la livraison de la vidéo à grande échelle. La perte des paquets sur les réseaux IP, peut affecter défavorablement la qualité de la vidéo reçue. Différents mécanismes de réparation de perte sont utilisés aujourd'hui. Ces mécanismes ont été proposés initialement pour des applications n'ayant pas de contraintes de délai de réparation. Ils ne peuvent pas, donc, garantir la qualité de la vidéo en cas de perte. Nous proposons dans ce papier un nouveau mécanisme de réparation de perte. Il permet d'optimiser la qualité de la vidéo transmise sur les réseaux P2P. Son principe consiste à demander les paquets perdus à un pair sélectionné aléatoirement parmi les pairs du réseau ayant ces paquets. Ce pair ne sera pas systématiquement leur fournisseur initial. Ce mécanisme vise à augmenter la probabilité de choisir un pair disponible pour faire la retransmission. Ceci peut augmenter la probabilité de recevoir les paquets retransmis avant leur temps de visualisation. Ce qui améliore la qualité de la vidéo reçue. Nos études par simulations ont montré l'efficacité de ce mécanisme par rapport aux mécanismes actuels de retransmission. Mots-clès: réseau pair-à-pair, transmission vidéo, perte des paquets, retransmission de paquets. I.
Examiner
, 2008
"... Daedalus: A media agnostic peer-to-peer architecture for IPTV distribution ..."
Abstract
- Add to MetaCart
(Show Context)
Daedalus: A media agnostic peer-to-peer architecture for IPTV distribution
