Fuzzynet: Zero-maintenance Ringless Overlay

Many structured overlay networks rely on a ring invariant as a core network connectivity element. The responsibility ranges of the participating peers and navigability principles (greedy routing) heavily depend on the ring structure. For correctness guarantees, each node needs to eagerly maintain its immediate neighboring links - the ring invariant. However, the ring maintenance is an expensive task and it may not even be possible to maintain the ring invariant continuously under high churn, particularly as the network size grows. Furthermore, routing anomalies in the network, peers behind firewalls and Network Address Translators (NATs) create non-transitivity effects, which inevitably lead to the violation of the ring invariant. We argue that reliance on the ring structure is a serious impediment for real life deployment and scalability of structured overlays. In this paper we propose an overlay called Fuzzynet, which does not rely on the ring invariant, yet have all the functionalities of structured overlays. Fuzzynet takes the idea of lazy overlay maintenance further by dropping any explicit connectivity and data maintenance requirement, relying merely on the actions performed when new Fuzzynet peers join the network. We show that with sufficient amount of neighbors (O(logN), comparable to traditional structured overlays), even under high churn, data can be retrieved in Fuzzynet w.h.p. We validate our novel design principles by simulations as well as PlanetLab experiments and compare it with ring based overlays.

[1]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

[2]  Wenjie Wang,et al.  Characterizing guarded hosts in peer-to-peer file sharing systems , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[3]  Hector Garcia-Molina,et al.  Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems , 2004, VLDB.

[4]  Ion Stoica,et al.  Non-Transitive Connectivity and DHTs , 2005, WORLDS.

[5]  Scott Shenker,et al.  Fixing the Embarrassing Slowness of OpenDHT on PlanetLab , 2005, WORLDS.

[6]  Karl Aberer,et al.  P-Grid: A Self-Organizing Access Structure for P2P Information Systems , 2001, CoopIS.

[7]  Karl Aberer,et al.  Generic Emergent Overlays in Arbitrary Peer Identifier Spaces , 2007, IWSOS.

[8]  Vwani P. Roychowdhury,et al.  Price of Structured Routing and Its Mitigation in P2P Systems under Churn , 2007, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007).

[9]  Mario T. Schlosser,et al.  HyperCuP – Hypercubes , Ontologies and Efficient Search on P 2 P Networks , 2002 .

[10]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[11]  Stefan Decker,et al.  Ontologies and efficient search on p2p networks , 2002 .

[12]  Karl Aberer,et al.  On Small World Graphs in Non-uniformly Distributed Key Spaces , 2005, 21st International Conference on Data Engineering Workshops (ICDEW'05).

[13]  James Aspnes,et al.  Fast construction of overlay networks , 2005, SPAA '05.

[14]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[15]  Jussi Kangasharju,et al.  Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search , 2007, SIGCOMM '07.

[16]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[17]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[18]  Karl Aberer,et al.  Oscar: Small-World Overlay for Realistic Key Distributions , 2005, DBISP2P.

[19]  Hector Garcia-Molina,et al.  YAPPERS: a peer-to-peer lookup service over arbitrary topology , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

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

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

[23]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[24]  Karl Aberer,et al.  On Routing in Distributed Hash Tables , 2007, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007).

[25]  Jonathan Kirsch,et al.  Load balancing and locality in range-queriable data structures , 2004, PODC '04.

[26]  Karl Aberer,et al.  Oscar: A Data-Oriented Overlay For Heterogeneous Environments , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[27]  Xiaozhou Li,et al.  Active and Concurrent Topology Maintenance , 2004, DISC.

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

[29]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[30]  Douglas S. Reeves,et al.  Self-stabilizing structured ring topology P2P systems , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[31]  Andreas Haeberlen,et al.  Experiences in building and operating ePOST, a reliable peer-to-peer application , 2006, EuroSys '06.

[32]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[33]  Dhiraj K. Pradhan,et al.  Wormhole routing in de Bruijn networks and hyper-de Bruijn networks , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[34]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.