Abstract
Gossip protocols are well known to provide reliable and robust dissemination protocols in highly dynamic systems. Yet, they suffer from high redundancy in the last phase of the dissemination. In this paper, we combine fountain codes (rateless erasure-correcting codes) together with gossip protocols for a robust and fast content dissemination in large-scale dynamic systems. The use of fountain enables to eliminate the unnecessary redundancy of gossip protocols. We propose the design of FoG, which fully exploits the first exponential growth phase (where the data is disseminated exponentially fast) of gossip protocols while avoiding the need for the shrinking phase by using fountain codes. FoG voluntarily increases the number of disseminations but limits those disseminations to the exponential growth phase. In addition, FoG creates a split-graph overlay that splits the peers between encoders and forwarders. Forwarder peers become encoders as soon as they have received the whole content. In order to benefit even further and quicker from encoders, FoG biases the dissemination towards the most advanced peers to make them complete earlier.
We assess FoG through simulation. We show that FoG outperforms by 50% a simple push protocol with respect to overhead and improves by 30% the termination time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized rumor spreading. In: FOCS (2000)
Li, H.C., Clement, A., Wong, E.L., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: Bar gossip. In: OSDI (2006)
Zhang, X., Liu, J., Li, B., Yum, T.S.P.: Coolstreaming/donet: A data-driven overlay network for efficient live media streaming. In: INFOCOMM (2005)
Byers, J.W., Luby, M., Mitzenmacher, M.: A digital fountain approach to asynchronous reliable multicast. IEEE JSAC, Special Issue on Network Support for Multicast Communication 20(8), 1528–1540 (2002)
Mitzenmacher, M.: Digital fountains: A survey and look forward. In: ITW (2004)
Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Transactions On Information Theory 46(4), 1204–1216 (2000)
Luby, M.: LT Codes. In: FOCS (2002)
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. ACM Transactions on Computer Systems 25 (2007)
Byers, J., Considine, J., Mitzenmacher, M., Rost, S.: Informed content delivery across adaptive overlay networks. IEEE/ACM Transactions on Networking 12, 767–780 (2004)
MacKay, D.J.: Information Theory, Inference, and Learning Algorithms. Cambridge University Press, Cambridge (2002)
Shokrollahi, A.: Raptor codes. IEEE/ACM Transactions on Networking 14, 2551–2567 (2006)
Jelasity, M., Babaoglu, O.: T-man: Gossip-based overlay topology management. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS (LNAI), vol. 3910, pp. 1–15. Springer, Heidelberg (2006)
Jelasity, M., Montresor, A., Jesi, G.P., Voulgaris, S.: The peersim simulator, http://peersim.sourceforge.net/
Gkantsidis, C., Rodriguez, P.R.: Network coding for large scale content distribution. In: INFOCOMM (2005)
Gkantsidis, C., Miller, J., Rodriguez, P.: Anatomy of a p2p content distribution system with network coding. In: IPTPS (2006)
Cohen, B.: Incentives build robustness in bittorrent. In: P2PEcon (June 2003)
Wang, M., Li, B.: How practical is network coding? In: IWQoS (2006)
Ma, G., Xu, Y., Lin, M., Xuan, Y.: A content distribution system based on sparse network coding. In: NetCod (2007)
Locher, T., Schmid, S., Wattenhofer, R.: Rescuing tit-for-tat with source coding. In: P2P (2007)
Picconi, F., Massoulié, L.: Is there a future for mesh-based live-video streaming? In: P2P (2008)
Massoulié, L., Twigg, A., Gkantsidis, C., Rodriguez, P.: Randomized decentralised broadcasting algorithms. In: INFOCOMM (2007)
Bonald, T., Massoulié, L., Mathieu, F., Perino, D., Twigg, A.: Epidemic live streaming: Optimal performance trade-offs. In: SIGMETRICS (2008)
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
Champel, ML., Kermarrec, AM., Le Scouarnec, N. (2009). FoG: Fighting the Achilles’ Heel of Gossip Protocols with Fountain Codes. In: Guerraoui, R., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2009. Lecture Notes in Computer Science, vol 5873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05118-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-05118-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05117-3
Online ISBN: 978-3-642-05118-0
eBook Packages: Computer ScienceComputer Science (R0)