Abstract
We consider peer-to-peer anti-entropy paradigms for epidemic information diffusion, namely pull, push and hybrid cases, and provide exact performance measures for them. Major benefits of the proposed epidemic algorithms are that they are fully distributed, utilize local information only via pair-wise interactions, and provide eventual consistency, scalability and communication topology-independence. Our contribution is the derivation of exact expressions for infection probabilities through elaborated counting techniques on a digraph. Considering the first passage times of a Markov chain based on these probabilities, we find the expected message delay experienced by each peer and its overall mean as a function of initial number of infectious peers. In terms of these criteria, the hybrid approach outperforms pull and push paradigms, and push is better than the pull case. Such theoretical results would be beneficial when integrating the models in several peer-to-peer distributed application scenarios.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bailey, N.T.J.: The Mathematical Theory of Infectious Diseases and its Applications. Charles Griffin and Compan, London (1975)
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. of the Sixth ACM Symp. on Principles of Distributed Computing, pp. 1–12 (1987)
Birrell, A., Levin, R., Needham, R., Schroeder, M.: Grapevine: Providing availability using lazy replication. ACM Transactions on Computer Systems 10(4), 360–391 (1992)
Golding, R., Taylor, K.: Group Membership in the Epidemic Style. Technical Report, UCSC-CRL-92-13, University of California at Santa Cruz (1992)
Ladin, R., Lishov, B., Shrira, L., Ghemawat, S.: An exercise in distributed computing. Communications of the ACM 25(4), 260–274 (1982)
Guo, K.: Scalable Message Stability Detection Protocols. Ph.D. dissertation, Cornell University, Dept. of Computer Science (1998)
van Renesse, R., Minsky, Y., Hayden, M.: A gossip-style failure detection service. In: Proceedings of Middleware 1998, pp. 55–70 (1998)
Birman, K., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Transactions on Computer Systems 17(2), 41–88 (1999)
van Renesse, R., Birman, K., Vogels, W.: Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Transactions on Computer Systems 21(2), 164–206 (2003)
Eugster, P., Guerraoui, R., Kermarrec, A.-M., Massoulie, L.: Epidemic information dissemination in distributed systems. IEEE Computer, 60–67 (May 2004)
Çağlar, M., Özkasap, Ö.: A chain-binomial model for pull and push-based information diffusion. In: Proc. of IEEE ICC (2006)
Gertsbakh, I.B.: Epidemic Process on a Random Graph: Some Preliminary Results. J. Appl. Prob. 14, 427–438 (1977)
Jaworski, J.: Epidemic Processes on Digraphs of Random Mappings. J. Appl. Prob. 36, 780–798 (1999)
Pittel, B.: On Spreading a Rumor. SIAM Journal on Applied Mathematics 47(1), 213–223 (1987)
van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Özkasap, Ö., Yazıcı, E.Ş., Küçükçifçi, S., Çağlar, M. (2006). Exact Performance Measures for Peer-to-Peer Epidemic Information Diffusion. In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds) Computer and Information Sciences – ISCIS 2006. ISCIS 2006. Lecture Notes in Computer Science, vol 4263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11902140_90
Download citation
DOI: https://doi.org/10.1007/11902140_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47242-1
Online ISBN: 978-3-540-47243-8
eBook Packages: Computer ScienceComputer Science (R0)