Estimation of Internet Node Location by Latency Measurements - The Underestimation Problem

Abstract

In this paper we deal with discovering a geographic location of a node in the Internet. Knowledge of location if fundamental element for many location based applications and web services. We focus on location finding without any assistance of the node being located -client-independent estimation. We estimate a location using communication latency measurements between nodes in the Internet. The latency measured is converted into a geographic distance which is used to derive a location by the multilateration (triangulation) principle. We analyse the latency-to-distance conversion with a consideration of location underestimation which is a product of multilateration failure. We demonstrate that location underestimations do not appear in experimental conditions. However with a real-world scenario, a number of devices cannot be located due to underestimations. Finally, we propose a modification to reduce the number of underestimations in real-world scenarios.

The Use of European Internet Communication Properties for IP Geolocation

“…The targets we used were outside PlanetLab since we did not want to measure targets from the same network as the landmarks. In our related work [22] we noticed that using both the targets and landmarks from the same network shifts the location accuracy to better values. The reason is that communication properties are of better values when measured within the same network.…”

Location Accuracy of Commercial IP Address Geolocation Databases

“…There are several known methods that use this approach, such as Constraint-Based Geolocation [9], Octant [29], Spotter [20], or Topology-based Geolocation [13]. A disadvantage of measurement-based geolocation is the latency instability which leads to false location estimations [18,28]. Other known problems are long location times [22,21].…”

Macroscopic Geographical Speed of Data Transmission in European Internet

“…It is a common problem that the great-circles might not intersect. This is caused by incorrect latency-to-distance conversion [14]. The delimited area is further processed to re-…”