Network distance estimation with dynamic landmark triangles

Authors:
Zhihua Wen;Michael Rabinovich
Affiliations:
Case Western Reserve University, Cleveland, OH, USA;Case Western Reserve University, Cleveland, OH, USA
Venue:
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2008

Citing 0
Cited 3

Content delivery networks: how big is big enough?

ACM SIGMETRICS Performance Evaluation Review
Measuring a commercial content delivery network

Proceedings of the 20th international conference on World wide web
Dynamic landmark triangles: A simple and efficient mechanism for inter-host latency estimation

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an efficient and accurate approach to estimate the network distance between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-dimensional space to estimate the distance between arbitrary hosts with simple trigonometrical calculations. To improve the accuracy of estimation, we dynamically choose the "best" triangle for a given pair of hosts using a heuristic algorithm. Our experiments show that this approach achieves both lower computational and network probing cost over the classic landmarks-based approach while producing more accurate estimates.