![[CAIDA - Center for Applied Internet Data Analysis logo]](/images/caida_globe_faded.png "Go to CAIDA home page")
T.~S.~E. Ng and H. Zhang, "Predicting Internet Network Distance with Coordinates-Based Approaches", in IEEE Conference on Computer Communications (INFOCOM), 2001, pp. 170-179.
| Predicting Internet Network Distance with Coordinates-Based Approaches | |
| Authors: |
T. S. E. Ng H. Zhang |
| Published: | IEEE Conference on Computer Communications (INFOCOM), 2001 |
| URL: | http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1019258 |
| Entry Date: | 2010-10-22 |
| Abstract: | In this paper, we propose to use coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is based on relative coordinates that are simply the distances from a host to some special network nodes. We propose the second mechanism, called Global Network Positioning (GNP), which is based on absolute coordinates computed from modeling the Internet as a geometric space. Since end hosts maintain their own coordinates, these approaches allow end hosts to compute their inter-host distances as soon as they discover each other. Moreover coordinates are very efficient in summarizing inter-host distances, making these approaches very scalable. By performing experiments using measured Internet distance data, we show that both coordinates-based schemes are more accurate than the existing state of the art system IDMaps, and the GNP approach achieves the highest accuracy and robustness among them. |