Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10339552 | Computer Networks | 2011 | 17 Pages |
Abstract
In this paper, we develop a framework for predicting long-term availability of prefixes, given short-duration prefix information from publicly available BGP routing databases like RouteViews, and prediction models constructed from information about other Internet prefixes. We compare three prediction models and find that machine learning-based prediction methods outperform a baseline model that predicts the future availability of a prefix to be the same as its past availability. Our results show that mean time to failure is the most important attribute for predicting availability. We also quantify how prefix availability is related to prefix length and update frequency. Our prediction models achieve 82% accuracy and 0.7 ranking quality when predicting for a future duration equal to the learning duration. We can also predict for a longer future duration, with graceful performance reduction. Our models allow ISPs to adjust BGP routing policies if predicted availability is low, and are generally useful for cloud computing systems, content distribution networks, P2P, and VoIP applications.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Ravish Khosla, Sonia Fahmy, Y. Charlie Hu, Jennifer Neville,