ACM Home Page
Please provide us with feedback. Feedback
Brief announcement: collaborative measurement of upload speeds in P2P systems
Full text PdfPdf (472 KB)
Source
Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the 28th ACM symposium on Principles of distributed computing table of contents
Calgary, AB, Canada
SESSION: B3-2 table of contents
Pages 338-339  
Year of Publication: 2009
ISBN:978-1-60558-396-9
Authors
John Douceur  Microsoft, Redmond, USA
Thomas Moscibroda  Microsoft, Redmond, USA
Debmalya Panigrahi  MIT, Cambridge, USA
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 32,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

We define and study the bandwidth determination problem in ad-hoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload and download bandwidth. We present matching upper and lower bounds on the number of probing rounds required by any algorithm. We also devise algorithms which, for realistic bandwidth distributions, beat the lower bounds.



Collaborative Colleagues:
John Douceur: colleagues
Thomas Moscibroda: colleagues
Debmalya Panigrahi: colleagues