A Hierarchical Approach to Internet Distance Prediction

  • Authors:
  • Rongmei Zhang;Charlie Hu;Xiaojun Lin;Sonia Fahmy

  • Affiliations:
  • Purdue University,West Lafayette, IN;Purdue University,West Lafayette, IN;Purdue University,West Lafayette, IN;Purdue University,West Lafayette, IN

  • Venue:
  • ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Internet distance prediction gives pair-wise latency information with limited measurements. Recent studies have revealed that the quality of existing prediction mechanisms from the application perspective is short of satisfactory. In this paper, we explore the root causes and remedies for this problem. Our experience with different landmark selection schemes shows that although selecting nearby landmarks can increase the prediction accuracy for short distances, it can cause the prediction accuracy for longer distances to degrade. Such uneven prediction quality significantly impacts application performance. Instead of trying to select the landmark nodes in some "intelligent" fashion, we propose a hierarchical prediction approach with straightforward landmark selection. Hierarchical prediction utilizes multiple coordinate sets at multiple distance scales, with the "right" scale being chosen for prediction each time. Experiments with Internet measurement datasets show that this hierarchical approach is extremely promising for increasing the accuracy of network distance prediction.