Reliable computer systems (3rd ed.): design and evaluation
Reliable computer systems (3rd ed.): design and evaluation
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Friendships that last: peer lifespan and its role in P2P protocols
Web content caching and distribution
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Total recall: system support for automated availability management
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Glacier: highly durable, decentralized storage despite massive correlated failures
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Price of Structured Routing and Its Mitigation in P2P Systems under Churn
P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Stochastic analysis of the interplay between object maintenance and churn
Computer Communications
Proactive replication in distributed storage systems using machine availability estimation
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
An analytical study of a structured overlay in the presence of dynamic membership
IEEE/ACM Transactions on Networking (TON)
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
Research on peer-to-peer (P2P) systems has been hampered by the fact that few systems are actually in use, and the space of possible applications is still under scrutiny. As a consequence, new ideas have been mostly evaluated using synthetic data, traces from a few existing systems and simulators, with a poor characterization of churn. This void has lead to the formulation of a variety of models, with implications that have not yet been made altogether clear to the community. In this work, we discuss the question whether it pays off to evaluate P2P applications using more than one churn model. Although an affirmative response could appear to be obvious at first glance, we show that depending on the aspects under consideration, models can yield equivalent results, saving implementation time but leading to spurious generalizations if proper care is not taken.