We define and study the bandwidth determination problem in adhoc 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. Categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems; F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity General Terms Algorithms, Measurement, Theory Keywords Bandwidth estimation, P2P systems, lower bounds
John R. Douceur, James W. Mickens, Thomas Moscibro