Exploiting Internet Delay Space Properties for Selecting Distinct Network Locations

Recent studies have discovered that the Internet delay space has many interesting properties such as triangle inequality violations (TIV), clustering structures and constrained growth. Understanding these properties has so far benefited the design of network models and network-performance-aware systems. In this paper, we consider an interesting, previously unexplored connection between Internet delay space properties and network locations. We show that this connection can be exploited to select nodes from distinct network locations for applications such as replica placement in overlay networks even when an adversary is trying to mis-guide the selection process.

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

[2]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[3]  Farnam Jahanian,et al.  The Zombie Roundup: Understanding, Detecting, and Disrupting Botnets , 2005, SRUTI.

[4]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[5]  Peter Druschel,et al.  Measurement-based analysis, modeling, and synthesis of the internet delay space , 2010, TNET.

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

[7]  Taoufik En-Najjary,et al.  Exploiting KAD: possible uses and misuses , 2007, CCRV.

[8]  D. Saha,et al.  On Suitability of Euclidean Embedding for Host-Based Network Coordinate Systems , 2010, IEEE/ACM Transactions on Networking.

[9]  Marcel Dischinger,et al.  Characterizing residential broadband networks , 2007, IMC '07.

[10]  Xin Liu,et al.  To filter or to authorize: network-layer DoS defense against multimillion-node botnets , 2008, SIGCOMM '08.

[11]  Dave Levin,et al.  PeerWise Discovery and Negotiation of Faster Paths , 2007, HotNets.

[12]  Zhuoqing Morley Mao,et al.  Accurate Real-time Identification of IP Prefix Hijacking , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).

[13]  Bo Zhang,et al.  Towards network triangle inequality violation aware distributed systems , 2007, IMC '07.

[14]  Ben Y. Zhao,et al.  An Empirical Study of Collusion Behavior in the Maze P2P File-Sharing System , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[15]  Mao Yang,et al.  An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System , 2005, IPTPS.

[16]  Dan Pei,et al.  A light-weight distributed scheme for detecting ip prefix hijacks in real-time , 2007, SIGCOMM '07.

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

[18]  Emin Gün Sirer,et al.  Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays , 2004, NSDI.

[19]  Bo Zhang,et al.  Measurement-Based Analysis, Modeling, and Synthesis of the Internet Delay Space , 2006, IEEE/ACM Transactions on Networking.

[20]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[21]  Andreas Terzis,et al.  A multifaceted approach to understanding the botnet phenomenon , 2006, IMC '06.

[22]  Emin Gün Sirer,et al.  Octant: A Comprehensive Framework for the Geolocalization of Internet Hosts , 2007, NSDI.

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

[24]  Paul Francis,et al.  A study of prefix hijacking and interception in the internet , 2007, SIGCOMM 2007.

[25]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[26]  Robert Tappan Morris,et al.  Tarzan: a peer-to-peer anonymizing network layer , 2002, CCS '02.

[27]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[28]  Rida A. Bazzi,et al.  On the establishment of distinct identities in overlay networks , 2005, PODC '05.

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