TY - CONF
T1 - Decentralized, accurate, and low-cost network bandwidth prediction
T2 - 2011 Proceedings IEEE INFOCOM
Y1 - 2011
A1 - Sukhyun Song
A1 - Keleher,P.
A1 - Bhattacharjee, Bobby
A1 - Sussman, Alan
KW - accuracy
KW - approximate tree metric space
KW - Bandwidth
KW - bandwidth allocation
KW - bandwidth measurement
KW - decentralized low cost system
KW - distributed tree
KW - end-to-end prediction
KW - Extraterrestrial measurements
KW - Internet
KW - low-cost network bandwidth prediction
KW - Measurement uncertainty
KW - pairwise bandwidth
KW - Peer to peer computing
KW - Prediction algorithms
KW - trees (mathematics)
AB - 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.
JA - 2011 Proceedings IEEE INFOCOM
PB - IEEE
SN - 978-1-4244-9919-9
M3 - 10.1109/INFCOM.2011.5935251
ER -