Abstract
Although epidemic or gossip-based multicast is a robust and scalable approach to reliable data dissemination, its inherent redundancy results in high resource consumption on both links and nodes. This problem is aggravated in settings that have costlier or resource constrained links as happens in Cloud Computing infrastructures composed by several interconnected data centers across the globe.
The goal of this work is therefore to improve the efficiency of gossip-based reliable multicast by reducing the load imposed on those constrained links. In detail, the proposed clon protocol combines an overlay that gives preference to local links and a dissemination strategy that takes into account locality. Extensive experimental evaluation using a very large number of simulated nodes shows that this results in a reduction of traffic in constrained links by an order of magnitude, while at the same time preserving the resilience properties that make gossip-based protocols so attractive.
This work is supported by HP Labs Innovation Research Award, project DC2MS (IRA/CW118736).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
DC2MS: Dependable Cloud Computing Management Services (2008), http://gsd.di.uminho.pt/projects/projects/DC2MS
Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. SIGCOMM Computer Communication Review 38(4), 63–74 (2008)
Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R.H., Konwinski, A., Lee, G., Patterson, D.A., Rabkin, A., Stoica, I., Zaharia, M.: Above the clouds: A berkeley view of cloud computing. Technical Report UCB/EECS-2009-28, EECS Department, University of California, Berkeley (February 2009)
Bailey, N.: The Mathematical Theory of Infectious Diseases and its Applications, 2nd edn. Hafner Press (1975)
Carvalho, N., Pereira, J., Oliveira, R., Rodrigues, L.: Emergent structure in unstructured epidemic multicast. In: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, pp. 481–490. IEEE Computer Society, Washington (2007)
Eugster, P., Guerraoui, R.: Hierarchical probabilistic multicast. Technical Report LPD-REPORT-2001-005, Ecole Polytechnique Fédérale de Lausanne (2001)
Eugster, P., Guerraoui, R., Handurukande, S., Kouznetsov, P., Kermarrec, A.-M.: Lightweight probabilistic broadcast. ACM Transactions on Computer Systems 21(4), 341–374 (2003)
Ganesh, A., Kermarrec, A.-M., Massoulié, L.: Scamp: Peer-to-peer lightweight membership service for large-scale group communication. Networked Group Communication, 44–55 (2001)
Ganesh, A., Kermarrec, A.-M., Massoulié, L.: Hiscamp: self-organizing hierarchical membership protocol. In: Proceedings of the 10th workshop on ACM SIGOPS European workshop, pp. 133–139. ACM, New York (2002)
Hopkinson, K., Jenkins, K., Birman, K., Thorp, J., Toussaint, G., Parashar, M.: Adaptive gravitational gossip: A gossip-based communication protocol with user-selectable rates. IEEE Transactions on Parallel and Distributed Systems 99(1) (2009)
Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The peer sampling service: experimental evaluation of unstructured gossip-based implementations. In: Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware, pp. 79–98. Springer-Verlag New York, Inc., New York (2004)
Kaldehofe, B.: Buffer management in probabilistic peer-to-peer communication protocols. In: Proceedings of the 22nd International Symposium on Reliable Distributed Systems, October 2003, pp. 76–85 (2003)
Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p. 565. IEEE Computer Society, Washington (2000)
Leitão, J., Pereira, J., Rodrigues, L.: Hyparview: A membership protocol for reliable gossip-based broadcast. In: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, pp. 419–428. IEEE Computer Society, Los Alamitos (2007)
Lin, M., Marzullo, K.: Directional gossip: Gossip in a wide area network. In: Hlavicka, J., Maehle, E., Pataricza, A. (eds.) EDDC 1999. LNCS, vol. 1667, pp. 364–379. Springer, Heidelberg (1999)
Massoulié, L., Kermarrec, A.-M., Ganesh, A.: Network awareness and failure resilience in self-organising overlay networks. In: Proceedings of the 22nd Symposium on Reliable Distributed Systems, pp. 47–55 (2003)
Melamed, R., Keidar, I.: Araneola: A scalable reliable multicast system for dynamic environments. In: IEEE International Symposium on Network Computing and Applications, pp. 5–14 (2004)
Pereira, J., Rodrigues, L., Oliveira, R., Kermarrec, A.-M.: Neem: Network-friendly epidemic multicast. In: Proceedings of the 22nd Symposium on Reliable Distributed Systems, pp. 15–24. IEEE, Los Alamitos (2003)
Schroeder, B., Gibson, G.A.: Disk failures in the real world: what does an mttf of 1,000,000 hours mean to you? In: Proceedings of the 5th USENIX conference on File and Storage Technologies, pp. 1–16. USENIX Association, Berkeley (2007)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matos, M., Sousa, A., Pereira, J., Oliveira, R., Deliot, E., Murray, P. (2009). CLON: Overlay Networks and Gossip Protocols for Cloud Environments. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2009. OTM 2009. Lecture Notes in Computer Science, vol 5870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05148-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-05148-7_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05147-0
Online ISBN: 978-3-642-05148-7
eBook Packages: Computer ScienceComputer Science (R0)