Dynamic landmark triangles: A simple and efficient mechanism for inter-host latency estimation

Abstract

This paper describes a simple and efficient approach to estimate the network latency 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. Experiments using several data sets of measured host-pair latencies, as well as a live Internet study, demonstrate the accuracy and efficiency of our approach.

Conditional clustered matrix factorization based network coordinate system

“…Researchers have done significant work on network clustering and its applications (Wen and Rabinovich 2011;van Dongen 1998;Ramaswamy et al, 2005). However, most of the existing networks clustering algorithms assume that the complete network topology is available at a central point.…”

Internet Distance Prediction Using Node-Pair Geography

“…In this paper, we take an approach to IDP that is different from the coordinates-based approach that prevails in the research community today [1]. Specifically, in coordinatebased approaches, Internet transmission delay is embedded into a low-dimensional geometric space such that the Internet distance between two nodes can be predicted as the distance between the coordinates of those nodes in the modeled space.…”