Constraint-based geolocation of internet hosts
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Operating system support for planetary-scale network services
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
How much anonymity does network latency leak?
Proceedings of the 14th ACM conference on Computer and communications security
How much anonymity does network latency leak?
ACM Transactions on Information and System Security (TISSEC)
Assessing the geographic resolution of exhaustive tabulation for geolocating internet hosts
PAM'08 Proceedings of the 9th international conference on Passive and active network measurement
IP geolocation databases: unreliable?
ACM SIGCOMM Computer Communication Review
IP geolocation in metropolitan areas
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
IP geolocation in metropolitan areas
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
| Hi-index | 0.00 |
This paper outlines a novel, comprehensive framework for geolocalization, that is, determining the physical location of Internet hosts based on network measurements. The core insight behind this framework is to pose the geolocalization problem formally as one of error-minimizing constraint satisfaction, to create a system of constraints by deriving them aggressively from network measurements, and to solve the system using cheap and accurate geometric methods. The framework is general and accommodates both positive and negative constraints, that is, constraints on where the node can or cannot be, respectively. It can reason in the presence of uncertainty, enabling it to gracefully cope with aggressively derived constraints that may contain errors. Since the solution space is represented geometrically as a region bounded by Bezier curves, the framework yields an accurate set of all points where the target may be located. Preliminary results on PlanetLab show promise; the framework can localize the median node to within 22 miles, a factor of three better than previous approaches, with little error.