The Community for Technology Leaders
Green Image
Issue No. 02 - Feb. (2013 vol. 24)
ISSN: 1045-9219
pp: 381-391
Dan Li , Tsinghua University, Beijing
Jiong Chen , Peking University, Beijing
Chuanxiong Guo , Microsoft Research Asia, Beijing
Yunxin Liu , Microsoft Research Asia, Beijing
Jinyu Zhang , Peking University, Beijing
Zhili Zhang , University of Minnesota, Minnapolis
Yongguang Zhang , Microsoft Research Asia, Beijing
Most IP-geolocation mapping schemes [14], [16], [17], [18] take delay-measurement approach, based on the assumption of a strong correlation between networking delay and geographical distance between the targeted client and the landmarks. In this paper, however, we investigate a large region of moderately connected Internet and find the delay-distance correlation is weak. But we discover a more probable rule—with high probability the shortest delay comes from the closest distance. Based on this closest-shortest rule, we develop a simple and novel IP-geolocation mapping scheme for moderately connected Internet regions, called GeoGet. In GeoGet, we take a large number of webservers as passive landmarks and map a targeted client to the geolocation of the landmark that has the shortest delay. We further use JavaScript at targeted clients to generate HTTP/Get probing for delay measurement. To control the measurement cost, we adopt a multistep probing method to refine the geolocation of a targeted client, finally to city level. The evaluation results show that when probing about 100 landmarks, GeoGet correctly maps 35.4 percent clients to city level, which outperforms current schemes such as GeoLim [16] and GeoPing [14] by 270 and 239 percent, respectively, and the median error distance in GeoGet is around 120 km, outperforming GeoLim and GeoPing by 37 and 70 percent, respectively.
Delay, Geology, Internet, Correlation, IP networks, Accuracy, Databases, moderately connected Internet, IP geolocation, GeoGet

J. Zhang et al., "IP-Geolocation Mapping for Moderately Connected Internet Regions," in IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 381-391, 2013.
166 ms
(Ver 3.3 (11022016))