ACM Home Page
Please provide us with feedback. Feedback
PRIME: peer-to-peer receiver-driven mesh-based streaming
Full text PdfPdf (664 KB)
Source IEEE/ACM Transactions on Networking (TON) archive
Volume 17 ,  Issue 4  (August 2009) table of contents
Pages 1052-1065  
Year of Publication: 2009
ISSN:1063-6692
Authors
Nazanin Magharei  Department of Computer and Information Science, University of Oregon, Eugene, OR
Reza Rejaie  Department of Computer and Information Science, University of Oregon, Eugene, OR
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 100,   Downloads (12 Months): 100,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: 10.1109/TNET.2008.2007434

ABSTRACT

The success of file swarming mechanisms such as BitTorrent has motivated a new approach for scalable streaming of live content that we call mesh-based Peer-to-Peer (P2P) streaming. In this approach, participating end-systems (or peers) form a randomly connected mesh and incorporate swarming content delivery to stream live content. Despite the growing popularity of this approach, neither the fundamental design tradeoffs nor the basic performance bottlenecks in mesh-based P2P streaming are well understood.

In this paper, we follow a performance-driven approach to design PRIME, a scalable mesh-based P2P streaming mechanism for live content. The main design goal of PRIME is to minimize two performance bottlenecks, namely bandwidth bottleneck and content bottleneck. We show that the global pattern of delivery for each segment of live content should consist of a diffusion phase which is followed by a swarming phase. This leads to effective utilization of available resources to accommodate scalability and also minimizes content bottleneck. Using packet level simulations, we carefully examine the impact of overlay connectivity, packet scheduling scheme at individual peers and source behavior on the overall performance of the system. Our results reveal fundamental design tradeoffs of mesh-based P2P streaming for live content.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
N. Magharei, R. Rejaie, and Y. Guo, "Mesh or multiple-tree: A comparative study of P2P live streaming services," in INFOCOM, 2007.
 
3
B. Cohen, Bittorrent. [Online]. Available: http://www.bittorrent.com
4
 
5
V. Pai, K. Kumar, K. Tamilmani, V. Sambamurthy, and A. Mohr, "Chainsaw: Eliminating trees from overlay multicast," in IPTPS, 2005.
 
6
A. Vlavianos, M. Iliofotou, and M. Faloutsos, "Bitos; Enhancing bit-torrent for supporting streaming applications," in GI, 2006.
 
7
W. T. Ooi, "Dagster: Contributor aware end-host multicast for media streaming in heterogeneous environment," in SPIE MMCN, Jan. 2005.
 
8
C. Dana, D. Li, D. Harrison, and C. Chuah, "Bass: Bittorrent assisted streaming system for video-on-demand," in IEEE MMSP, 2005.
 
9
F. Pianese, J. Keller, and E. W. Biersack, "Pulse, a flexible P2P live streaming system," in GI, 2006.
 
10
X. Liao et al., "Anysee: Scalable live streaming service based on interoverlay optimization," in INFOCOM, 2006.
11
 
12
 
13
X. Zhang, J. Liu, B. Li, and T.-S. P. Yum, "Coolstreaming: A data-driven overlay network for live media streaming," in INFOCOM, 2005.
 
14
 
15
S. Xie, B. Li, G. Keung, and X. Zhang, "Large Scale Peer-to-Peer Live Video Streaming: Theory and Practice," 2006, Tech. Rep.
16
 
17
R. Rejaie, M. Handley, and D. Estrin, "RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the internet," in INFOCOM, 1999.
18
19
 
20
 
21
N. Magharei, Y. Guo, and R. Rejaie, "Issues in offering live P2P streaming service to residential users," in IEEE CCNC, 2007.