On Adding Structure to Unstructured Overlay Networks

Unstructured peer-to-peer overlay networks are very resilient to churn and topology changes, while requiring little maintenance cost. Therefore, they are an infrastructure to build highly scalable large-scale services in dynamic networks. Typically, the overlay topology is defined by a peer sampling service that aims at maintaining, in each process, a random partial view of peers in the system. The resulting random unstructured topology is suboptimal when a specific performance metric is considered. On the other hand, structured approaches (for instance, a spanning tree) may optimize a given target performance metric but are highly fragile. In fact, the cost for maintaining structures with strong constraints may easily become prohibitive in highly dynamic networks. This chapter discusses different techniques that aim at combining the advantages of unstructured and structured networks. Namely we focus on two distinct approaches, one based on optimizing the overlay and another based on optimizing the gossip mechanism itself.

[1]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[2]  Anne-Marie Kermarrec,et al.  Network awareness and failure resilience in self-organizing overlay networks , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[3]  Anne-Marie Kermarrec,et al.  SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication , 2001, Networked Group Communication.

[4]  Anne-Marie Kermarrec,et al.  NEEM: network-friendly epidemic multicast , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[5]  Anne-Marie Kermarrec,et al.  From Epidemics to Distributed Computing , 2004 .

[6]  L. Rodrigues,et al.  Topology Aware Gossip Overlays , 2007 .

[7]  Anne-Marie Kermarrec,et al.  Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[8]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[9]  Michael Dahlin,et al.  BAR gossip , 2006, OSDI '06.

[10]  Chunqiang Tang,et al.  GoCast: gossip-enhanced overlay multicast for fast and dependable group communication , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[11]  Boris Koldehofe,et al.  Buffer management in probabilistic peer-to-peer communication protocols , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[12]  Li Xiao,et al.  Building Efficient Overlays , 2004, Journal of Grid Computing.

[13]  J. Leitao Gossip-based broadcast protocols , 2007 .

[14]  Keith Marzullo,et al.  Directional Gossip: Gossip in a Wide Area Network , 1999, EDCC.

[15]  Idit Keidar,et al.  Araneola: a scalable reliable multicast system for dynamic environments , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

[16]  Piotr Karwaczynski,et al.  Dual proximity neighbour selection method for peer-to-peer-based discovery service , 2007, SAC '07.

[17]  Sugih Jamin,et al.  Inet-3.0: Internet Topology Generator , 2002 .

[18]  Kenneth P. Birman,et al.  Probabilistic Broadcast , 1996 .

[19]  João Leitão,et al.  Epidemic Broadcast Trees , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).

[20]  Patrick Th. Eugster,et al.  Probabilistic multicast , 2002, Proceedings International Conference on Dependable Systems and Networks.

[21]  Luís E. T. Rodrigues,et al.  Emergent Structure in Unstructured Epidemic Multicast , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[22]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[23]  Márk Jelasity,et al.  T-Man: Gossip-Based Overlay Topology Management , 2005, Engineering Self-Organising Systems.

[24]  Anne-Marie Kermarrec,et al.  Epidemic information dissemination in distributed systems , 2004, Computer.

[25]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[26]  Márk Jelasity,et al.  Epidemic-style proactive aggregation in large overlay networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[27]  M. Jelasity,et al.  T-Man : Fast Gossip-based Construction of Large-Scale Overlay Topologies 1 , 2004 .

[28]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[29]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

[30]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.

[31]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[32]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[33]  Robbert van Renesse,et al.  A Gossip-Style Failure Detection Service , 2009 .

[34]  Mark Handley,et al.  Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.

[35]  P. Karwaczyriski Fabric: Synergistic Proximity Neighbour Selection Method , 2007, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007).

[36]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

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

[38]  Maarten van Steen,et al.  CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.

[39]  David E. Culler,et al.  PlanetLab: an overlay testbed for broad-coverage services , 2003, CCRV.

[40]  João Leitão,et al.  HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[41]  Luís E. T. Rodrigues,et al.  Efficient Epidemic Multicast in Heterogeneous Networks , 2006, OTM Workshops.