A Survey on Network Coordinates Systems, Design, and Security

During the last decade, a new class of large-scale globally-distributed network services and applications have emerged. Those systems are flexible in the sense that they can select their communication path among a set of available ones. However, ceaselessly gathering network information such as latency to select a path is infeasible due to the large amount of measurement traffic it would generate. To overcome this issue, Network Coordinates Systems (NCS) have been proposed. An NCS allows hosts to predict latencies without performing direct measurements and, consequently, reduce the network resources consumption. During these last years, NCS opened new research fields in which the networking community has produced an impressive amount of work. We believe it is now time to stop and take stock of what has been achieved so far. In this paper, we survey the various NCS proposed as well as their intrinsic limits. In particular, we focus on security issues and solutions proposed to fix them. We also discuss potential future NCS developments, in particular how to use NCS for predicting bandwidth.

[1]  R. E. Kalman,et al.  A New Approach to Linear Filtering and Prediction Problems , 2002 .

[2]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

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

[4]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[5]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[6]  Paul Francis,et al.  An architecture for a global Internet host distance estimation service , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[7]  H. Sebastian Seung,et al.  Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[8]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[9]  Jörg Liebeherr,et al.  Application-layer multicast with Delaunay triangulations , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

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

[12]  Miguel Castro,et al.  SCRIBE: The Design of a Large-Scale Event Notification Infrastructure , 2001, Networked Group Communication.

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

[14]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

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

[16]  Lakshminarayanan Subramanian,et al.  An investigation of geographic mapping techniques for internet hosts , 2001, SIGCOMM 2001.

[17]  I. Jolliffe Principal Component Analysis , 2002 .

[18]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[19]  M. Kayton,et al.  Global positioning system: signals, measurements, and performance [Book Review] , 2002, IEEE Aerospace and Electronic Systems Magazine.

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

[21]  Roger A. Freedman,et al.  Sears and Zemansky's University Physics With Modern Physics , 2003 .

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

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

[24]  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).

[25]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[26]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[27]  David E. Culler,et al.  A blueprint for introducing disruptive technology into the Internet , 2003, CCRV.

[28]  Hui Zhang,et al.  A Network Positioning System for the Internet , 2004, USENIX Annual Technical Conference, General Track.

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

[30]  Jasleen Kaur,et al.  Testing the Scalability of Overlay Routing Infrastructures , 2004, PAM.

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

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

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

[34]  Nathan Linial,et al.  On metric Ramsey-type phenomena , 2004 .

[35]  Steven Lerman,et al.  PCoord: network position estimation using peer-to-peer measurements , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

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

[37]  David A. Patterson,et al.  A Case for Informed Service Placement on PlanetLab , 2005 .

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

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

[40]  Olivier Bonaventure,et al.  Scalable Route Selection for IPv6 Multihomed Sites , 2005, NETWORKING.

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

[42]  Sujata Banerjee,et al.  Measuring Bandwidth Between PlanetLab Nodes , 2005, PAM.

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

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

[45]  Walid Dabbous,et al.  Virtual networks under attack: disrupting internet coordinate systems , 2006, CoNEXT '06.

[46]  Playing Vivaldi in Hyperbolic Space , 2006 .

[47]  P. V. Oorschot,et al.  Internet Geolocation and Evasion , 2006 .

[48]  David Mazières,et al.  OASIS: Anycast for Any Service , 2006, NSDI.

[49]  Walid Dabbous,et al.  Real attacks on virtual networks: Vivaldi out of tune , 2006, LSAD '06.

[50]  Jonathan M. Smith,et al.  IDES: An Internet Distance Estimation Service for Large Networks , 2006, IEEE Journal on Selected Areas in Communications.

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

[52]  Margo I. Seltzer,et al.  Stable and Accurate Network Coordinates , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[53]  Serge Fdida,et al.  Constraint-Based Geolocation of Internet Hosts , 2004, IEEE/ACM Transactions on Networking.

[54]  Yang Chen,et al.  Pharos: A Decentralized and Hierarchical Network Coordinate System for Internet Distance Prediction , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[55]  Zhi-Li Zhang,et al.  Fundamental Effects of Clustering on the Euclidean Embedding of Internet Hosts , 2007, Networking.

[56]  Olivier Bonaventure,et al.  A Reputation-Based Approach for Securing Vivaldi Embedding System , 2007, EUNICE.

[57]  Margo I. Seltzer,et al.  Network Coordinates in the Wild , 2007, NSDI.

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

[59]  Anne-Marie Kermarrec,et al.  Gossiping in distributed systems , 2007, OPSR.

[60]  Cristina Nita-Rotaru,et al.  On the accuracy of decentralized virtual coordinate systems in adversarial networks , 2007, CCS '07.

[61]  Ken Birman,et al.  The promise, and limitations, of gossip protocols , 2007, OPSR.

[62]  Walid Dabbous,et al.  Securing internet coordinate embedding systems , 2007, SIGCOMM '07.

[63]  Rachid Guerraoui,et al.  How robust are gossip-based communication protocols? , 2007, OPSR.

[64]  Michal Szymaniak,et al.  Practical large-scale latency estimation , 2008, Comput. Networks.

[65]  T. S. Eugene Ng,et al.  Distributed algorithms for stable and secure network coordinates , 2008, IMC '08.

[66]  Micah Sherr,et al.  Veracity: a fully decentralized service for securing network coordinate systems , 2008, IPTPS.

[67]  Ittai Abraham,et al.  A Unified Network Coordinate System for Bandwidth and Latency , 2008 .

[68]  Neil Spring,et al.  Measurement Manipulation and Space Selection in Network Coordinates , 2008, 2008 The 28th International Conference on Distributed Computing Systems.

[69]  Mohamed Ali Kâafar,et al.  Towards a Two-Tier Internet Coordinate System to Mitigate the Impact of Triangle Inequality Violations , 2008, Networking.

[70]  Ning Wang,et al.  An overview of routing optimization for internet traffic engineering , 2008, IEEE Communications Surveys & Tutorials.

[71]  Yang Chen,et al.  Pharos: accurate and decentralised network coordinate system , 2009, IET Commun..

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

[73]  Ian T. Jolliffe,et al.  Principal Component Analysis , 2002, International Encyclopedia of Statistical Science.