<?xml version="1.0" standalone="no"?>
                    <!DOCTYPE div SYSTEM "/www/backend/www-xml-443/dtd/caidaML.dtd">
                    <!-- do NOT ERASE the DOCTYPE declaration! --><div>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>URL:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
<a href="http://www.cs.cornell.edu/People/egs/papers/octant-nsdi.pdf">http://www.cs.cornell.edu/People/egs/papers/octant-nsdi.pdf</a>
</font>
  </td>
</tr>


<tr bgcolor="#e9e9e9">
  <td>
<font face="helvetica,arial" size="2">
<b>Entry Date:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
2010-10-22


</font>
  </td>
</tr>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>Abstract:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
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 mi., a factor of three better than previous approaches, with little error.


</font>
  </td>
</tr>
</div>

