• DocumentCode
    1947183
  • Title

    Decentralized, accurate, and low-cost network bandwidth prediction

  • Author

    Song, Sukhyun ; Keleher, Pete ; Bhattacharjee, Bobby ; Sussman, Alan

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA
  • fYear
    2011
  • fDate
    10-15 April 2011
  • Firstpage
    6
  • Lastpage
    10
  • Abstract
    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.
  • Keywords
    Internet; bandwidth allocation; trees (mathematics); Internet; approximate tree metric space; bandwidth measurement; decentralized low cost system; distributed tree; end-to-end prediction; low-cost network bandwidth prediction; pairwise bandwidth; Accuracy; Bandwidth; Extraterrestrial measurements; Measurement uncertainty; Peer to peer computing; Prediction algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2011 Proceedings IEEE
  • Conference_Location
    Shanghai
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-9919-9
  • Type

    conf

  • DOI
    10.1109/INFCOM.2011.5935251
  • Filename
    5935251