Abstract
Distributed aggregation queries like average and sum can be implemented in several different paradigms including gossip and hierarchical approaches. In the literature, these two paradigms are routinely associated with stereotypes such as “trees are fragile and complicated” and “gossip is slow and expensive”. However, a closer look reveals that these statements are not backed up by thorough studies. A fair and informative comparison is clearly needed. However, it is a very hard task, because the performance of protocols from the two paradigms depends on different subtleties of the environment and the implementation of the protocols. We tackle this problem by carefully designing the comparison study. We use state-of-the-art algorithms and propose the problem of monitoring the network size in the presence of churn as the ideal problem for comparing very different paradigms for global aggregation. Our experiments help us identify the most important factors that differentiate between gossip and spanning tree aggregation: the time needed to compute a truly global output, the properties of the underlying topology, and the sensitivity to dynamism. We demonstrate the effect of these factors in different practically interesting topologies and scenarios. Our results help us to choose the right protocol in the knowledge of the topology and dynamism patterns.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems 23(3), 219–252 (2005)
Eyal, I., Keidar, I., Rom, R.: Limosense – live monitoring in dynamic sensor networks. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds.) ALGOSENSORS 2011. LNCS, vol. 7111, pp. 72–85. Springer, Heidelberg (2012)
Jesus, P., Baquero, C., Almeida, P.S.: Fault-tolerant aggregation by flow updating. In: Senivongse, T., Oliveira, R. (eds.) DAIS 2009. LNCS, vol. 5523, pp. 73–86. Springer, Heidelberg (2009)
Mehyar, M., Spanos, D., Pongsajapan, J., Low, S.H., Murray, R.M.: Asynchronous distributed averaging on communication networks. IEEE/ACM Trans. Netw. 15(3), 512–520 (2007)
Wuhib, F., Dam, M., Stadler, R., Clemm, A.: Robust monitoring of network-wide aggregates through gossiping. In: Proc. 10th IFIP/IEEE Intl. Symp. on Integrated Management (IM 2007), pp. 21–25 (May 2007)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: A tiny aggregation service for ad-hoc sensor networks. In: Proc. 5th Symp. on Operating Systems Design and Implementation (OSDI 2002), pp. 131–146 (2002)
Gupta, I., van Renesse, R., Birman, K.P.: Scalable fault-tolerant aggregation in large process groups. In: Proc. Intl. Conf. on Dependable Systems and Networks (DSN 2001). IEEE Computer Society Press (2001)
Birman, K.P., van Renesse, R., Vogels, W.: Scalable data fusion using astrolabe. In: Proc. Fifth Intl. Conf. on Information Fusion (FUSION 2002), vol. 2, pp. 1434–1441 (2002)
Dam, M., Stadler, R.: A generic protocol for network state aggregation. In: Proc. Radiovetenskap och Kommunikation, RVK 2005 (2005)
Prieto, A.G., Stadler, R.: A-gap: An adaptive protocol for continuous network monitoring with accuracy objectives. IEEE Trans. on Netw. and Serv. Manag. 4(1), 2–12 (2007)
Krishnamurthy, S., Ardelius, J., Aurell, E., Dam, M., Stadler, R., Wuhib, F.Z.: Brief announcement: the accuracy of tree-based counting in dynamic networks. In: ACM Symp. on Principles of Distr. Comp. (PODC), pp. 291–292. ACM (2010)
Jain, N., Mahajan, P., Kit, D., Yalagandula, P., Dahlin, M., Zhang, Y.: Network imprecision: A new consistency metric for scalable monitoring. In: Proc. 8th USENIX Conf. on Operating Systems Design and Implementation (OSDI 2008), pp. 87–102. USENIX Association (2008)
Le Merrer, E., Kermarrec, A.M., Massoulie, L.: Peer to peer size estimation in large and dynamic networks: A comparative study. In: Proc. 15th IEEE Intl. Symp. on High Performance Distr. Comp. (HPDC 2006), pp. 7–17 (2006)
Chitnis, L., Dobra, A., Ranka, S.: Aggregation methods for large-scale sensor networks. ACM Trans. Sen. Netw. 4(2), 9:1–9:36 (2008)
Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing 7(1), 3–16 (1993)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS 2003), pp. 482–491. IEEE Computer Society (2003)
Montresor, A., Jelasity, M.: Peersim: A scalable P2P simulator. In: Proc. 9th IEEE Intl. Conf. on P2P Comp. (P2P 2009), pp. 99–100. IEEE (September 2009), extended abstract
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. ACM Transactions on Computer Systems 25(3), 8 (2007)
Roverso, R., Dowling, J., Jelasity, M.: Through the wormhole: Low cost, fresh peer sampling for the internet. In: Proc. 13th IEEE Intl. Conf. on P2P Comp. (P2P 2013). IEEE (2013)
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74(1), 47–97 (2002)
Roozenburg, J.: Secure decentralized swarm discovery in Tribler. Master’s thesis, Parallel and Distributed Systems Group, Delft University of Technology (2006)
Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: Proc. 6th ACM SIGCOMM Conf. on Internet Measurement (IMC 2006), pp. 189–202. ACM (2006)
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Transactions on Information Theory 52(6), 2508–2530 (2006)
Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Nyers, L., Jelasity, M. (2014). Spanning Tree or Gossip for Aggregation: A Comparative Study. In: Silva, F., Dutra, I., Santos Costa, V. (eds) Euro-Par 2014 Parallel Processing. Euro-Par 2014. Lecture Notes in Computer Science, vol 8632. Springer, Cham. https://doi.org/10.1007/978-3-319-09873-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-09873-9_32
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09872-2
Online ISBN: 978-3-319-09873-9
eBook Packages: Computer ScienceComputer Science (R0)