A Structural Approach to Latency Prediction Harsha V. MadhyasthaThomas AndersonArvind KrishnamurthyNeil Spring

Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models are simple, they can often fail systematically; for example, the most widely used models use metric embeddings that predict no benefit to detour routes even though half of all Internet routes can benefit from detours. In this paper, we adopt a structural approach that predicts path latency based on measurements of the Internet’s routing topology, PoP connectivity, and routing policy. We find that our approach outperforms Vivaldi, the most widely used black-box model. Furthermore, unlikemetricembeddings, ourapproachsuccessfullypredicts 65% of detour routes in the Internet. The number of measurements used in our approach is comparable with that required by black box techniques, but using traceroutes instead of pings.

[1]  Vern Paxson,et al.  End-to-end routing behavior in the Internet , 1996, TNET.

[2]  Eng Keong Lua,et al.  Internet Routing Policies and Round-Trip-Times , 2005, PAM.

[3]  Paul Francis,et al.  IDMaps: a global internet host distance estimation service , 2001, TNET.

[4]  Yuval Shavitt,et al.  On the curvature of the Internet and its usage for overlay construction and distance estimation , 2004, IEEE INFOCOM 2004.

[5]  Yin Zhang,et al.  On AS-level path inference , 2005, SIGMETRICS '05.

[6]  Ratul Mahajan,et al.  Colt ? ? ? ? ? ? ◦ DTAG ? ◦ • ◦ ? ? ? ? ! ◦ ? ? ? ◦ ◦ ? ? Eqip ? ? ? ? ? ? , 2003 .

[7]  Jon Crowcroft,et al.  On the accuracy of embeddings for internet coordinate systems , 2005, IMC '05.

[8]  Lixin Gao.  On inferring autonomous system relationships in the internet , 2001, TNET.

[9]  Emin Gün Sirer,et al.  Meridian: a lightweight network location service without virtual coordinates , 2005, SIGCOMM '05.

[10]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[12]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[13]  Yuval Shavitt,et al.  DIMES: let the internet measure itself , 2005, CCRV.

[14]  Amin Vahdat,et al.  Detour: a Case for Informed Internet Routing and Transport , 2007 .

[15]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  Arun Venkataramani,et al.  iPlane: an information plane for distributed services , 2006, OSDI '06.

[17]  M. Frans Kaashoek,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM 2004.

[18]  Lawrence K. Saul,et al.  Modeling distances in large-scale networks by matrix factorization , 2004, IMC '04.

[19]  Peter Steenkiste,et al.  Quantifying Internet End-to-End Route Similarity , 2006 .