Randomized algorithms
Measuring bottleneck link speed in packet-switched networks
Performance Evaluation
MST construction in O(log log n) communication rounds
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Bandwidth estimation in broadband access networks
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
SelectCast: a scalable and self-repairing multicast overlay routing facility
Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
Packet-dispersion techniques and a capacity-estimation methodology
IEEE/ACM Transactions on Networking (TON)
Using PlanetLab for network research: myths, realities, and best practices
ACM SIGOPS Operating Systems Review
High-bandwidth mesh-based overlay multicast in heterogeneous environments
AAA-IDEA '06 Proceedings of the 2nd international workshop on Advanced architectures and algorithms for internet delivery and applications
Maximizing total upload in latency-sensitive P2P applications
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Exploiting internet route sharing for large scale available bandwidth estimation
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Nettimer: a tool for measuring bottleneck link, bandwidth
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Satellitelab: adding heterogeneity to planetary-scale network testbeds
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Donnybrook: enabling large-scale, high-speed, peer-to-peer games
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
ThunderDome: discovering upload constraints using decentralized bandwidth tournaments
Proceedings of the 5th international conference on Emerging networking experiments and technologies
On Maximizing Tree Bandwidth for Topology-Aware Peer-to-Peer Streaming
IEEE Transactions on Multimedia
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
Future Generation Computer Systems
| Hi-index | 0.00 |
In this paper, we study the theory of collaborative upload bandwidth measurement in peer-to-peer environments. A host can use a bandwidth estimation probe to determine the bandwidth between itself and any other host in the system. The problem is that the result of such a measurement may not necessarily be the sender's upload bandwidth, since the most bandwidth restricted link on the path could also be the receiver's download bandwidth. In this paper, we formally define the bandwidth determination problem and devise efficient distributed algorithms. We consider two models, the free-departure and no-departure model, respectively, depending on whether hosts keep participating in the algorithm even after their bandwidth has been determined. We present lower bounds on the timecomplexity of any collaborative bandwidth measurement algorithm in both models. We then show how, for realistic bandwidth distributions, the lower bounds can be overcome. Specifically, we present O(1) and O(log log n)-time algorithms for the two models. We corroborate these theoretical findings with practical measurements on a implementation on PlanetLab.