IP-Geolocation
Mapping for Moderately Connected Internet Regions
ABSTRACT:
Most IP-geolocation mapping schemes 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.
EXISTING SYSTEM:
Traditional IP-geolocation mapping
schemes are primarily delay-measurement based. In these schemes, there are a
number of landmarks with known geolocations. The delays from a targeted client
to the landmarks are measured, and the targeted client is mapped to a
geolocation inferred from the measured delays. However, most of the schemes are
based on the assumption of a linear correlation between networking delay and
the physical distance between targeted client and landmark.
DISADVANTAGES OF EXISTING SYSTEM:
The strong correlation has been verified
in some regions of the Internet, such as North America and Western Europe. But
as pointed out in the literature, the Internet connectivity around the world is
very complex, and such strong correlation may not hold for the Internet everywhere.
PROPOSED SYSTEM:
In this paper, we investigate the
delay-distance relationship in a particular large region of the Internet
(China), where the Internet connectivity is moderate. The data set contains
hundreds of thousands of (delay, distance) pairs collected from thousands of
widely spread hosts. We have two observations from the data set. First, the
linearity between the delay and distance in this region of Internet is positive
but very weak. Second, with high probability the shortest delay comes from the
closest distance, and we call this phenomenon the “closest-shortest” rule.
Based on the observations, we develop a
simple yet novel IP-geolocation mapping scheme for moderately connected
Internet regions, called GeoGet. In GeoGet, we map the targeted client to the
geolocation of the landmark that has the shortest delay. We take a large number
of webservers with wide coverage and known geolocations as passive landmarks,
which eliminates the deploying cost of active landmarks. We further use
JavaScript at targeted clients to generate HTTP/Get probing for delay
measurement, eliminating the need to install client-side software. To control
the measurement cost, we step-by-step refine the geolocation of a targeted
client, down to city level. In practice, GeoGet can be deployed in combination
with a certain locality-aware application such that the application can easily
obtain the geolocations of their clients.
ADVANTAGES
OF PROPOSED SYSTEM:
The contributions of this paper are
twofold. First, by studying a large data set, we show that most of the traditional
IP-Geolocation mapping schemes cannot work well for moderately connected
Internet regions, since the linear delay-distance correlation is weak in this
kind of Internet regions. Second, based on the measurement results (MR), we
develop and implement GeoGet, which uses the closest-shortest rule and works
much better than traditional schemes in moderately connected Internet regions.
We acknowledge that we are not the first to apply the closest shortest rule and
the mapping accuracy of GeoGet is still not very high. However, we go a large
step toward developing a better IP-Geolocation system for moderately connected
Internet regions. We believe the accuracy will improve significantly if probing
more landmarks.
SYSTEM
ARCHITECTURE:
ALGORITHM
: LANDMARK SELECTION ALGORITHM
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
ü Processor -Pentium –IV
ü RAM - 256 MB(min)
ü Hard
Disk - 20 GB
ü Key
Board - Standard Windows Keyboard
ü Mouse - Two or Three Button Mouse
ü Monitor - SVGA
SOFTWARE CONFIGURATION:-
ü Operating System : Windows XP
ü Programming Language : JAVA
ü Java Version : JDK 1.6 & above.
REFERENCE:
Dan Li, Jiong Chen, Chuanxiong Guo,
Yunxin Liu, Jinyu Zhang, Zhili Zhang, and Yongguang Zhang, “IP-Geolocation Mapping for Moderately Connected
Internet Regions”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
VOL. 24, NO. 2, FEBRUARY 2013.