...
Constraint Based Geolocation (CBG) is an algorithm that is used for calculating geographical location (geolocation) of IP hosts (each host is called a target). This technique takes multiple landmarks (hosts whose lat/lon coordinates are known) as input to plot circles and identify possible regions of intersection of these circles. Each landmark is a center of a circle and the radius of a circle is the distance from a landmark to the target. Distance The raidal distance of each circle is calculated from Round the minimum Round Trip Time (RTT) between a landmark and a and the target. RTTs are gathered from pings.
...
CBG algorithm is currently implemented in Matlab code. However due to licensing, deployment, programmatic and compatibility issues, CBG needs to be re-implemented. TULIP and Apollonius deployment at SLAC is Java based.
SLAC maintains a database for more than 540 landmarks from three different international infrastructures (PlanetLab, PingER and PerfSONAR), which cover over 99% of the world's population. Re-implementation of CBG will enable us to display more accurate results for targets and consequently use this infrastructure to the best of its ability. Furthermore this will provide an amalgamation of best known geolocation techniques for research and education purposes. This can also be a very useful tool for pursuing future projects in locating IP hosts. The world is already into a transition from computers to hand-held relatively fixed computers to mobile devices. This can potentially open a gateway for accurate locating services that can have multiple uses. A particular interesting case can be found here.
...
- Install Matlab
- Run cbg_soi.m for constraint based on Speed of Internet (SOI), which is 2here defined as the speed of optical signals in fibre or ~2/3 the Speed of Light in vacuum (c).
- Run bestline.m for constraint based on bestline approach. The bestline is defined in the Constraint-Based Geolocation paper, but basically is the tightest fit over all the (delay, distance) pairs meant to never underestimate the distance for a delay.
- Rest can be found in README.txt file provided with the package.