Skip to main content

An Adaptive Mechanism for Epidemic Communication

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3141))

Abstract

Reliable group communication is essential for building applications in distributed computing systems. Epidemic-style algorithms for group communication have attracted increasing interest. They emulate the spread of an infection; each computing node communicates with its randomly selected partners and information is disseminated by multiple rounds of such communication. Previous research has revealed that they are highly scalable and easy to deploy. In this paper we propose an adaptive mechanism with the aim of enhancing resiliency of these algorithms to perturbations, such as node failures. The mechanism dynamically adjusts the fanout, the number of receiver partners each node selects, to changes in the environment. Two metrics are used for this purpose, which reflect the status local to the node itself and the behavior of the whole system. This mechanism is analogous to those that can be seen in many biological systems, where each constituent part behaves mainly independently but is controlled indirectly by the whole system.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birman, K., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Transactions on Computer Systems 17, 41–88 (1999)

    Article  Google Scholar 

  2. Eugster, P., Guerraoui, R., Handurukande, S., Kermarrec, A.M., Kouznetsov, P.: Lightweight probabilistic broadcast. In: Proceedings of the 2001 International Conference on Dependable Systems and Networks (DSN 2001), Gothenberg, Sweden, pp. 443–452 (2001)

    Google Scholar 

  3. Sun, Q., Sturman, D.: A gossip-based reliable multicast for large-scale highthroughput applications. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN 2000), New York, NY, pp. 347–358 (2000)

    Google Scholar 

  4. Vogels, W., van Renesse, R., Birman, K.: The power of epidemics: robust communication for large-scale distributed systems. ACM SIGCOMM Computer Communication Review 33, 131–135 (2003)

    Article  Google Scholar 

  5. Agrawal, D., El Abbadi, A., Steinke, R.: Epidemic algorithms in replicated databases. In: Proceedings of the Sixteenth ACM Symposium on Principles of Database Systems, Tucson, Arizona, pp. 161–172 (1997)

    Google Scholar 

  6. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proc. Sixth Ann. ACM Symp. Principles of Distributed Computing (PODC), pp. 1–12 (1987)

    Google Scholar 

  7. Golding, R.A., Long, D.D.E., Wilkes, J.: The REFDBMS distributed bibliographic database system. In: Proceedings of the USENIX Winter 1994 Technical Conference, San Francisco, CA, USA, pp. 47–62 (1994)

    Google Scholar 

  8. Holliday, J., Steinke, R., Agrawal, D., El Abbadi, A.: Epidemic algorithms for replicated databases. IEEE Transactions on Knowledge and Data Engineering 15, 1218–1238 (2003)

    Article  Google Scholar 

  9. Ranganathan, S., George, A.D., Todd, R.W., Chidester, M.C.: Gossip-style failure detection and distributed consensus for scalable heterogeneous clusters. Cluster Computing 4, 197–209 (2001)

    Article  Google Scholar 

  10. van Renesse, R., Minsky, Y., Hayden, M.: A gossip-style failure detection service. In: Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing (Middleware 1998), pp. 55–70 (1998)

    Google Scholar 

  11. Kermarrec, A.M., Massoulié, L., Ganesh, A.J.: Probabilistic reliability dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems 14, 248–258 (2003)

    Article  Google Scholar 

  12. Rodrigues, L., Handurukande, S., Pereira, J., Guerraoui, R., Kermarrec, A.M.: Adaptive gossip-based broadcast. In: Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), San Francisco, CA, pp. 47–56 (2003)

    Google Scholar 

  13. Ganesh, A.J., Kermarrec, A.M., Massoulié, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers 52, 139–149 (2003)

    Article  Google Scholar 

  14. Lin, M.J., Marzullo, K., Masini, S.: Gossip versus deterministic flooding: Low message overhead and high reliability for broadcasting on small networks. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 253–267. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Stryer, L.: Biochemistry. W H Freeman and Co., New York (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsuchiya, T., Kikuno, T. (2004). An Adaptive Mechanism for Epidemic Communication. In: Ijspeert, A.J., Murata, M., Wakamiya, N. (eds) Biologically Inspired Approaches to Advanced Information Technology. BioADIT 2004. Lecture Notes in Computer Science, vol 3141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27835-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27835-1_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23339-8

  • Online ISBN: 978-3-540-27835-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics