Advertisement

Gossip Membership Management with Social Graphs for Byzantine Fault Tolerance in Clouds

  • JongBeom Lim
  • Joon-Min Gil
  • Kwang-Sik Chung
  • Jihun Kang
  • Daewon Lee
  • Heonchang Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8707)

Abstract

As computer systems have become more complex and dynamic, unstructured and decentralized techniques serve as basic building blocks in large-scale systems such as cloud computing systems. In particular, we consider a gossip-based algorithm, one of the unstructured overlay construction techniques. In this paper, we propose a membership management mechanism using the gossip-based algorithm with social graphs for the Byzantine fault tolerance problem. Experimental results show that our membership management mechanism copes with Byzantine nodes effectively in a scalable way without a bottleneck in dynamic computing environments, requiring only n ≥ 2f + 1 nodes.

Keywords

Overlay Network Cloud Computing Environment Local View Social Graph Cloud Computing System 
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

  1. 1.
    Lim, J., Lee, J., Chin, S., Yu, H.: Group-based gossip multicast protocol for efficient and fault tolerant message dissemination in clouds. In: Riekki, J., Ylianttila, M., Guo, M. (eds.) GPC 2011. LNCS, vol. 6646, pp. 13–22. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  2. 2.
    Antulov-Fantulin, N., Lancic, A., Stefancic, H., Sikic, M.: Fastsir algorithm: A fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible–infected–recovered compartment model. Information Sciences 239, 226–240 (2013)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Iwanicki, K., van Steen, M., Voulgaris, S.: Gossip-based clock synchronization for large decentralized systems. In: Keller, A., Martin-Flatin, J.-P. (eds.) SelfMan 2006. LNCS, vol. 3996, pp. 28–42. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Lim, J., Chung, K.-S., Chin, S.-H., Yu, H.-C.: A gossip-based mutual exclusion algorithm for cloud environments. In: Li, R., Cao, J., Bourgeois, J. (eds.) GPC 2012. LNCS, vol. 7296, pp. 31–45. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    Lim, J., Suh, T., Yu, H.: A deadlock detection algorithm using gossip in cloud computing environments. In: Han, Y.H., Park, D.S., Jia, W., Yeo, S.S. (eds.) Ubiquitous Information Technologies and Applications. Lecture Notes in Electrical Engineering, vol. 214, pp. 781–789. Springer, Netherlands (2013)CrossRefGoogle Scholar
  6. 6.
    Lim, J., Chung, K.S., Gil, J.M., Suh, T., Yu, H.: An unstructured termination detection algorithm using gossip in cloud computing environments. In: Kubátová, H., Hochberger, C., Daněk, M., Sick, B. (eds.) ARCS 2013. LNCS, vol. 7767, pp. 1–12. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  7. 7.
    Chu, Y.H., Ganjam, A., Ng, T.S.E., Rao, S.G., Sripanidkulchai, K., Zhan, J., Zhang, H.: Early experience with an internet broadcast system based on overlay multicast. In: Proceedings of the Annual Conference on USENIX Annual Technical Conference, ATEC 2004, p. 12. USENIX Association, Berkeley (2004)Google Scholar
  8. 8.
    Zeilemaker, N., Capotă, M., Bakker, A., Pouwelse, J.: Tribler: P2p media search and sharing. In: Proceedings of the 19th ACM International Conference on Multimedia, MM 2011, pp. 739–742. ACM, New York (2011)Google Scholar
  9. 9.
    Mahajan, K., Makroo, A., Dahiya, D.: Round robin with server affinity: A vm load balancing algorithm for cloud based infrastructure. Journal of Information Processing Systems 9(3), 379–394 (2013)CrossRefGoogle Scholar
  10. 10.
    Matos, M., Sousa, A., Pereira, J., Oliveira, R., Deliot, E., Murray, P.: Clon: Overlay networks and gossip protocols for cloud environments. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2009, Part I. LNCS, vol. 5870, pp. 549–566. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Wuhib, F., Stadler, R., Spreitzer, M.: A gossip protocol for dynamic resource management in large cloud environments. IEEE Transactions on Network and Service Management 9(2), 213–225 (2012)CrossRefGoogle Scholar
  12. 12.
    Stavrou, A., Rubenstein, D., Sahu, S.: A lightweight, robust p2p system to handle flash crowds. IEEE Journal on Selected Areas in Communications 22(1), 6–17 (2004)CrossRefGoogle Scholar
  13. 13.
    Voulgaris, S., Gavidia, D., Steen, M.: Cyclon: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management 13(2), 197–217 (2005)CrossRefGoogle Scholar
  14. 14.
    Tölgyesi, N., Jelasity, M.: Adaptive peer sampling with newscast. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009. LNCS, vol. 5704, pp. 523–534. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  15. 15.
    Ganesh, A., Kermarrec, A.M., Massoulie, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers 52(2), 139–149 (2003)CrossRefGoogle Scholar
  16. 16.
    Allavena, A., Demers, A., Hopcroft, J.E.: Correctness of a gossip based membership protocol. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, pp. 292–301. ACM, New York (2005)Google Scholar
  17. 17.
    Gurevich, M., Keidar, I.: Correctness of gossip-based membership under message loss. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC 2009, pp. 151–160. ACM, New York (2009)Google Scholar
  18. 18.
    Newman, M.: Networks: An Introduction. Oxford University Press, Inc., New York (2010)Google Scholar
  19. 19.
    Busnel, Y., Beraldi, R., Baldoni, R.: On the uniformity of peer sampling based on view shuffling. Journal of Parallel and Distributed Computing 71(8), 1165–1176 (2011)CrossRefzbMATHGoogle Scholar
  20. 20.
    Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: Byzantine resilient random membership sampling. Comput. Netw. 53(13), 2340–2359 (2009)CrossRefzbMATHGoogle Scholar
  21. 21.
    Schiavoni, V., Riviére, E., Felber, P.: Whisper: Middleware for confidential communication in large-scale networks. In: 2011 31st International Conference on Distributed Computing Systems (ICDCS), pp. 456–466 (2011)Google Scholar
  22. 22.
    Singh, A., Urdaneta, G., van Steen, M., Vitenberg, R.: Robust overlays for privacy-preserving data dissemination over a social graph. In: 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS), pp. 234–244 (2012)Google Scholar
  23. 23.
    Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228–234 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  24. 24.
    Bertier, M., Frey, D., Guerraoui, R., Kermarrec, A.-M., Leroy, V.: The gossple anonymous social network. In: Gupta, I., Mascolo, C. (eds.) Middleware 2010. LNCS, vol. 6452, pp. 191–211. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2014

Authors and Affiliations

  • JongBeom Lim
    • 1
  • Joon-Min Gil
    • 2
  • Kwang-Sik Chung
    • 3
  • Jihun Kang
    • 1
  • Daewon Lee
    • 4
  • Heonchang Yu
    • 1
  1. 1.Department of Computer Science EducationKorea UniversitySeoulKorea
  2. 2.School of Computer & Information Communications EngineeringCatholic University of DaeguDaeguKorea
  3. 3.Department of Computer ScienceKorea National Open UniversitySeoulKorea
  4. 4.Department of General EducationSeoKyeong UniversitySeoulKorea

Personalised recommendations