%0 Conference Paper
%B 2011 Proceedings IEEE INFOCOM
%D 2011
%T Decentralized, accurate, and low-cost network bandwidth prediction
%A Sukhyun Song
%A Keleher,P.
%A Bhattacharjee, Bobby
%A Sussman, Alan
%K accuracy
%K approximate tree metric space
%K Bandwidth
%K bandwidth allocation
%K bandwidth measurement
%K decentralized low cost system
%K distributed tree
%K end-to-end prediction
%K Extraterrestrial measurements
%K Internet
%K low-cost network bandwidth prediction
%K Measurement uncertainty
%K pairwise bandwidth
%K Peer to peer computing
%K Prediction algorithms
%K trees (mathematics)
%X The distributed nature of modern computing makes end-to-end prediction of network bandwidth increasingly important. Our work is inspired by prior work that treats the Internet and bandwidth as an approximate tree metric space. This paper presents a decentralized, accurate, and low cost system that predicts pairwise bandwidth between hosts. We describe an algorithm to construct a distributed tree that embeds bandwidth measurements. The correctness of the algorithm is provable when driven by precise measurements. We then describe three novel heuristics that achieve high accuracy for predicting bandwidth even with imprecise input data. Simulation experiments with a real-world dataset confirm that our approach shows high accuracy with low cost.
%B 2011 Proceedings IEEE INFOCOM
%I IEEE
%P 6 - 10
%8 2011/04/10/15
%@ 978-1-4244-9919-9
%G eng
%R 10.1109/INFCOM.2011.5935251