Sciweavers

SIGMETRICS
2008
ACM

Network distance estimation with dynamic landmark triangles

13 years 4 months ago
Network distance estimation with dynamic landmark triangles
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 [3] while producing more accurate estimates. Categories and Subject Descriptors C.2.m [Computer Systems Organization]: COMPUTERCOMMUNICATION NETWORKSMiscellaneous General Terms Algorithms, Experimentation, Measurement Keywords network distance estimation
Zhihua Wen, Michael Rabinovich
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where SIGMETRICS
Authors Zhihua Wen, Michael Rabinovich
Comments (0)