Enabling Quick Overlay Topology Construction Using Adaptive Cycle Gossip: Enabling Quick Overlay Topology Construction Using Adaptive Cycle Gossip

Based on previous observation, a dynamic adaptive cycle into gossip-based topology management is introduced to replace the traditional fixed cycle and a quick topology convergence method based on adaptive cycle is also proposed . In this method, those nodes featured with local topology stability send fewer gossip packets, while nodes in frequently changing environment send more packets. This dynamic adaptive method improves data exchange efficiency, saves network resources, enables faster local data exchange, and consequently speeds up the overall topology convergence. In detail, by using logistic curve as the basic control function of the adaptive cycle, rules for accidental events is defined accordingly. Simulation is presented to show the validity of this approach and

[1]  Robbert van Renesse,et al.  Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining , 2003, TOCS.

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

[3]  Márk Jelasity,et al.  Chord on demand , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

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

[5]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

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

[7]  A. Rowstron,et al.  Scalable, decentralized object location and routing for large-scale peer-to-peer systems , 2001 .

[8]  Li Xiao,et al.  A distributed approach to solving overlay mismatching problem , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

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

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

[11]  Divyakant Agrawal,et al.  Epidemic Algorithms for Replicated Databases , 2003, IEEE Trans. Knowl. Data Eng..

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

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

[14]  Ramesh Govindan,et al.  Using the small-world model to improve Freenet performance , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

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

[17]  Krishna P. Gummadi,et al.  Measuring and analyzing the characteristics of Napster and Gnutella hosts , 2003, Multimedia Systems.

[18]  Roberto Montemanni,et al.  Design patterns from biology for distributed computing , 2006, TAAS.