Advertisement

An Adaptive Restart Mechanism for Continuous Epidemic Systems

  • Mosab M. Ayiad
  • Giuseppe Di FattaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11874)

Abstract

Software services based on large-scale distributed systems demand continuous and decentralised solutions for achieving system consistency and providing operational monitoring. Epidemic data aggregation algorithms provide decentralised, scalable and fault-tolerant solutions that can be used for system-wide tasks such as global state determination, monitoring and consensus. Existing continuous epidemic algorithms either periodically restart at fixed epochs or apply changes in the system state instantly producing less accurate approximation. This work introduces an innovative mechanism without fixed epochs that monitors the system state and restarts upon the detection of the system convergence or divergence. The mechanism makes correct aggregation with an approximation error as small as desired. The proposed solution is validated and analysed by means of simulations under static and dynamic network conditions.

Keywords

Distributed computing Continuous systems Decentralised aggregation Epidemic protocols Node churn 

References

  1. 1.
    Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219–252 (2005)CrossRefGoogle Scholar
  2. 2.
    Cao, Y., et al.: An overview of recent progress in the study of distributed multi-agent coordination. IEEE Trans. Ind. Inf. 9(1), 427–38 (2013)CrossRefGoogle Scholar
  3. 3.
    Rapp, V., Graffi, K.: Continuous gossip-based aggregation through dynamic information aging. In: 2013 22nd International Conference on Computer Communication and Networks (ICCCN), July 2013Google Scholar
  4. 4.
    Costa, P., Leito, J.: Practical continuous aggregation in wireless edge environments. In: 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS), October 2018Google Scholar
  5. 5.
    Litke, A., Anagnostopoulos, D., Varvarigou, T.: Blockchains for supply chain management: architectural elements and challenges towards a global scale deployment. Logistics 3(1), 5 (2019)CrossRefGoogle Scholar
  6. 6.
    Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 (2003)Google Scholar
  7. 7.
    Ayiad, M.M., Di Fatta, G.: Agreement in epidemic data aggregation. In: 2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS), December 2017Google Scholar
  8. 8.
    Katti, A., Lilja, D.J.: Efficient and fast approximate consensus with epidemic failure detection at extreme scale. In: 2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), March 2018Google Scholar
  9. 9.
    Di Fatta, G., et al.: Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks. J. Parallel Distrib. Comput. 73(3), 317–329 (2013). Models and Algorithms for High-Performance Distributed Data MiningCrossRefGoogle Scholar
  10. 10.
    Poonpakdee, P., Di Fatta, G.: Robust and efficient membership management in large-scale dynamic networks. Future Gener. Comput. Syst. 75, 85–93 (2017)CrossRefGoogle Scholar
  11. 11.
    Ayiad, M.M., Di Fatta, G.: Robust epidemic aggregation under churn. In: Fortino, G., Ali, A.B.M.S., Pathan, M., Guerrieri, A., Di Fatta, G. (eds.) IDCS 2017. LNCS, vol. 10794, pp. 173–185. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-97795-9_16CrossRefGoogle Scholar
  12. 12.
    Roh, H.-G., Ignat, C.L.: Rapid and Round-free Multi-pair Asynchronous Push-Pull Aggregation. Research report RR-8044. INRIA (2012)Google Scholar
  13. 13.
    Jesus, P., Baquero, C., Almeida, P.S.: Flow updating: fault-tolerant aggregation for dynamic networks. J. Parallel Distrib. Comput. 78, 53–64 (2015)CrossRefGoogle Scholar
  14. 14.
    Blasa, F.,et al.: Symmetric push-sum protocol for decentralised aggregation. In: Proceedings of AP2PS 2011, the Third International Conference on Advances in P2P Systems. IARIA (2011)Google Scholar
  15. 15.
    Bahi, J.M., Contassot-Vivier, S., Couturier, R.: An efficient and robust decentralized algorithm for detecting the global convergence in asynchronous iterative algorithms. In: Palma, J.M.L.M., Amestoy, P.R., Daydé, M., Mattoso, M., Lopes, J.C. (eds.) VECPAR 2008. LNCS, vol. 5336, pp. 240–254. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-92859-1_22CrossRefGoogle Scholar
  16. 16.
    Poonpakdee, P., Orhon, N.G., Di Fatta, G.: Convergence detection in epidemic aggregation. In: an Mey, D., et al. (eds.) Euro-Par 2013. LNCS, vol. 8374, pp. 292–300. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-642-54420-0_29CrossRefGoogle Scholar
  17. 17.
    Montresor, A., Jelasity, M.: PeerSim: a scalable P2P simulator. In: 2009 IEEE 9th International Conference on Peer-to-Peer Computing, September 2009Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of ReadingReadingUK

Personalised recommendations