Exact performance measures for peer-to-peer epidemic information diffusion

Authors:
Öznur Özkasap;Emine Şule Yazıcı;Selda Küçükçifçi;Mine Çağlar
Affiliations:
Department of Computer Engineering, Koç University, Istanbul, Turkey;Department of Mathematics, Koç University, Istanbul, Turkey;Department of Mathematics, Koç University, Istanbul, Turkey;Department of Mathematics, Koç University, Istanbul, Turkey
Venue:
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Year:
2006

Citing 10
Cited 3

On spreading a rumor

SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Providing high availability using lazy replication

ACM Transactions on Computer Systems (TOCS)
Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
Grapevine: an exercise in distributed computing

Communications of the ACM
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
GROUP MEMBERSHIP IN THE EPIDEMIC STYLE

GROUP MEMBERSHIP IN THE EPIDEMIC STYLE
Scalable message stability detection protocols

Scalable message stability detection protocols
Epidemic Information Dissemination in Distributed Systems

Computer
A gossip-style failure detection service

Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing

Exact probability distributions for peer-to-peer epidemic information diffusion

ACM SIGMETRICS Performance Evaluation Review
Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination

Computer Networks: The International Journal of Computer and Telecommunications Networking
An analytical framework for self-organizing peer-to-peer anti-entropy algorithms

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

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.