ACM Home Page
Please provide us with feedback. Feedback
A framework for architecting peer-to-peer receiver-driven overlays
Full text PdfPdf (142 KB)
Source International Workshop on Network and Operating System Support for Digital Audio and Video archive
Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video table of contents
Cork, Ireland
SESSION: Overlay networking table of contents
Pages: 42 - 47  
Year of Publication: 2004
ISBN:1-58113-801-6
Authors
Reza Rejaie  University of Oregon
Shad Stafford  University of Oregon
Sponsors
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 33,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1005847.1005858
What is a DOI?

ABSTRACT

This paper presents a simple and scalable framework for architecting peer-to-peer overlays called Peer-to-peer Receiver-driven Overlay (or PRO). PRO is designed for non-interactive streaming applications and its primary design goal is to maximize delivered bandwidth (and thus delivered quality) to peers with heterogeneous and asymmetric bandwidth. To achieve this goal, PRO adopts a receiver-driven approach where each receiver (or participating peer) (i) independently discovers other peers in the overlay through gossiping, and (ii) selfishly determines the best subset of parent peers through which to connect to the overlay to maximize its own delivered bandwidth. Participating peers form an unstructured overlay which is inherently robust to high churn rate. than structured overlay networks. Furthermore, each receiver leverages congestion controlled bandwidth from its parents as implicit signal to detect and react to long-term changes in network or overlay condition without any explicit coordination with other participating peers. Independent parent selection by individual peers dynamically converge to an efficient overlay structure.


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
3
4
5
6
 
7
Y. hu, S. G. Rao, and H. Zhang. A case for end-system multicast. In ACM SIGMETRICS, 2000.
 
8
9
 
10
S. Hedetniemi, S. Hedetniemi, and A. Liestman. A Survey of Gossiping and Broadcasting in Communication Networks. In Networks, 1988.
11
12
13
 
14
T. S. E. Ng, Y. Chu, S. G. Rao, K. Sripanidkulchai, and H. Zhang. Measurement-based optimization techniques for bandwidth-demanding peer-to-peer systems. In IEEE INFOCOM, 2003.
 
15
T. S. E. Ng and H. Zhang. Predicting internet network distance with coordinates-based approaches. In IEEE INFOCOM, 2002.
 
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 IEEE INFOCOM, 1999.
18
 
19
S. Saroiu, P. K. Gummadi, and S. D. Gribble. Measurement study of peer-to-peer file system sharing. In SPIE MMCN, 2002.
 
20
D. A. Tran, K. A. Hua, and T. Do. Zigzag: An efficient peer-to-peer scheme for media streaming. In IEEE INFOCOM, 2003.

CITED BY  6

Collaborative Colleagues:
Reza Rejaie: colleagues
Shad Stafford: colleagues