Spanning Tree or Gossip for Aggregation: A Comparative Study

  • Lehel Nyers
  • Márk Jelasity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8632)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems 23(3), 219–252 (2005)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Dam, M., Stadler, R.: A generic protocol for network state aggregation. In: Proc. Radiovetenskap och Kommunikation, RVK 2005 (2005)Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Chitnis, L., Dobra, A., Ranka, S.: Aggregation methods for large-scale sensor networks. ACM Trans. Sen. Netw. 4(2), 9:1–9:36 (2008)Google Scholar
  15. 15.
    Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing 7(1), 3–16 (1993)CrossRefMATHGoogle Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    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 abstractGoogle Scholar
  18. 18.
    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)CrossRefGoogle Scholar
  19. 19.
    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)Google Scholar
  20. 20.
    Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74(1), 47–97 (2002)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Roozenburg, J.: Secure decentralized swarm discovery in Tribler. Master’s thesis, Parallel and Distributed Systems Group, Delft University of Technology (2006)Google Scholar
  22. 22.
    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)Google Scholar
  23. 23.
    Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Transactions on Information Theory 52(6), 2508–2530 (2006)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS (2008)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Lehel Nyers
    • 1
    • 2
  • Márk Jelasity
    • 3
  1. 1.University of SzegedHungary
  2. 2.Subotica TechSuboticaSerbia
  3. 3.MTA-SZTE Research Group on Artificial IntelligenceUniversity of SzegedHungary

Personalised recommendations