Advertisement

Group-Based Gossip Multicast Protocol for Efficient and Fault Tolerant Message Dissemination in Clouds

  • JongBeom Lim
  • JongHyuk Lee
  • SungHo Chin
  • HeonChang Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6646)

Abstract

Cloud computing is an Internet-based computing paradigm that provides services in a virtualized form composed of plenty of sharable resources. In cloud computing environments, gossip protocols are engaged as a method to rapidly disseminate the state information for innumerable resources. Although the gossip protocols provide a robust and scalable multicast, there is a drawback that requires redundant messages in satisfying 100% of reliability. In our study, we propose a Group-based Gossip Multicast Protocol to reduce the message overhead while delivering the state information efficiently and fault tolerantly. Furthermore, we verified the performance of the proposed protocol through experiments.

Keywords

Gossip Protocols Cloud Computing Multicast 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Buyya, R., Yeo, C.S., Venugopal, S.: Market-Oriented Cloud Computing: Vision, Hype, and Reality for Delivering IT Services as Computing Utilities. IEEE Computer Soc., Los Alamitos (2008)Google Scholar
  2. 2.
    DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazon’s highly available key-value store. SIGOPS Oper. Syst. Rev. 41, 205–220 (2007)CrossRefGoogle Scholar
  3. 3.
    Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79–98. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Ganesh, A.J., Kermarrec, A.-M., Massoulié, L.: SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, p. 44. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Ganesh, A.J., Kermarrec, A.-M., Massoulié, L.: HiScamp: self-organizing hierarchical membership protocol. In: Proceedings of the 10th Workshop on ACM SIGOPS European Workshop. ACM, Saint-Emilion (2002)Google Scholar
  6. 6.
    Voulgaris, S., Gavidia, D., van Steen, M.: CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays. Journal of Network and Systems Management 13, 197–217 (2005)CrossRefGoogle Scholar
  7. 7.
    Leitao, J., Pereira, J., Rodrigues, L.: HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast. In: 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2007, pp. 419–429 (2007)Google Scholar
  8. 8.
    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. LNCS, vol. 5870, pp. 549–566. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    The PeerSimSimulator, http://peersim.sourceforge.net
  10. 10.
    Leitao, J., Pereira, J., Rodrigues, L.: Epidemic Broadcast Trees. In: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems. IEEE Computer Society, Los Alamitos (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • JongBeom Lim
    • 1
  • JongHyuk Lee
    • 1
  • SungHo Chin
    • 1
  • HeonChang Yu
    • 1
  1. 1.Dept. of Computer Science EducationKorea UniversityKorea

Personalised recommendations