A reliable multicast framework for light-weight sessions and application level framing
IEEE/ACM Transactions on Networking (TON)
Epidemic live streaming: optimal performance trade-offs
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Is Random Scheduling Sufficient in P2P Video Streaming?
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
PRIME: peer-to-peer receiver-driven mesh-based streaming
IEEE/ACM Transactions on Networking (TON)
BiCo: Network operator-friendly P2P traffic control through bilateral cooperation with peers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exploring interest correlation for peer-to-peer socialized video sharing
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Peer-assisted network operator-friendly P2P traffic control technique
Proceedings of the 7th International Conference on Network and Services Management
The state of peer-to-peer network simulators
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In Swarm-based Peer-to-Peer Streaming (SPS) mechanisms, participating peers form a randomly connected mesh over which they incorporate swarm-like content delivery. In practice, a subset of participating peers may form clusters in the overlay due to various reasons such as localization of connectivity within edge ISPs. Despite the commonly held assumptions, the appearance of such clusters could significantly degrade the delivered quality to participating peers in SPS mechanisms. This paper examines the effect of overlay clustering on the performance of SPS mechanisms for live content. Leveraging the notion of two-phase content delivery in SPS mechanisms, we illustrate the effect of overlay clustering on content delivery. We propose the Overlay Monitoring and Repair (OMR) mechanism as a distributed and scalable approach to maintain proper overlay connectivity in SPS mechanisms. The key idea is to use delivered quality to individual peers as an indication of poor connectivity from other regions of the overlay. OMR employs a probabilistic approach to ensure an adequate number of properly-positioned peers reacts to detected clustering in the overlay without any coordination. Reacting peers rewire a small number of carefully-selected connections in the overlay to significantly improve the performance of content delivery. Our preliminary evaluations demonstrate that OMR mechanism can achieve its goals.