Impacts of Asynchrony on Epidemic-Style Aggregation Protocols

The large scale and dynamic nature of a distributed system makes it difficult to collect the attributes of the individual nodes in the network. In these systems, often an aggregate (e.g. AVG, COUNT, MIN, MAX, SUM etc) of these attributes is adequate. Epidemic-style protocols are one of the popular approaches to estimate aggregates in such systems. In existing epidemic-style aggregation protocols the accuracy of the estimated aggregate at local nodes heavily depends upon synchronization of aggregation rounds. To enforce synchronization in these protocols, length of aggregation round should be long enough so that all the nodes in the system complete their aggregation information exchange. In this paper, we study the impacts of asynchrony in epidemic-style aggregation protocols. We present a simple asynchronous technique to estimate system aggregates in a distributed system. Based upon this technique, we analyze two popular existing epidemic-style aggregation protocols, Push-Pull and Push-Sum. Through detailed simulations, we evaluate accuracy and cost of asynchronous version of these protocols. We found that to obtain an estimate of the true system aggregate, aggregation protocols do not need to be synchronized and hence an efficient estimate can be obtained in lesser time.

[1]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[3]  Robbert van Renesse,et al.  Gossip-based distribution estimation in peer-to-peer networks , 2008, IPTPS.

[4]  Anne-Marie Kermarrec,et al.  Gossip-based Unstructured Overlay Networks: An Experimental Evaluation , 2003 .

[5]  Robbert van Renesse.  The importance of aggregation , 2003 .

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

[7]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[8]  R.M. Murray,et al.  Asynchronous Distributed Averaging on Communication Networks , 2007, IEEE/ACM Transactions on Networking.

[9]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[10]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[12]  Rajeev Rastogi,et al.  Efficient gossip-based aggregate computation , 2006, PODS.

[13]  Christian Schindelhauer,et al.  Epidemic Algorithms , 2004 .

[14]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[15]  Weidong Liu,et al.  A loosely synchronized gossip-based algorithm for aggregate information computation , 2008, 2008 33rd IEEE Conference on Local Computer Networks (LCN).

[16]  Anand D. Sarwate,et al.  Broadcast Gossip Algorithms for Consensus , 2009, IEEE Transactions on Signal Processing.

[17]  Rolf Stadler,et al.  Robust monitoring of network-wide aggregates through gossiping , 2009, IEEE Trans. Netw. Serv. Manag..

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

[19]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[20]  Shanika Karunasekera,et al.  A gossip-based asynchronous aggregation protocol for P2P systems , 2010, IEEE Local Computer Network Conference.

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

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