Embeddable Overlay Networks

Internet round-trip-times (RTTs) exhibit widespread and persistent Triangle Inequality Violations (TIVs). It has been shown that TIVs are a natural consequence of the Internet's routing structure and they degrade the embedding accuracy of any Internet coordinate systems based on RTTs. In this paper, we simulate a coordinate system in a hypothetical overlay environment where RTTs are measured with respect to overlay forwarding that has eliminated all the TIVs. The resulting coordinate system is much more accurate and the embedding accuracy is predictable and stable (under simulated node churn) than the existing techniques based on RTTs along paths chosen by native IP forwarding. We believe that this work helps to illustrate the detrimental effects of TIVs on Internet coordinate systems, and it suggests that high quality coordinate systems in the global Internet may be possible only with overlay forwarding.

[1]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

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

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

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[6]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[7]  Piet Van Mieghem,et al.  Hierarchical Geometric Overlay Multicast Network , 2006 .

[8]  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.

[9]  Hyuk Lim,et al.  Constructing Internet coordinate system based on delay measurement , 2003, IEEE/ACM Transactions on Networking.

[10]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[11]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

[12]  Lawrence K. Saul,et al.  Modeling Distances in Large-Scale Networks by , 2004 .

[13]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[14]  Jon Crowcroft,et al.  Lighthouses for Scalable Distributed Location , 2003, IPTPS.

[15]  Miguel Castro,et al.  PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[16]  Zhi-Li Zhang,et al.  On suitability of Euclidean embedding of internet hosts , 2006, SIGMETRICS '06/Performance '06.

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

[18]  Yuval Shavitt,et al.  Big-Bang simulation for embedding network distances in Euclidean space , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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