Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
Protecting Free Expression Online with Freenet
IEEE Internet Computing
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Limited reputation sharing in P2P systems
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
PET: A PErsonalized Trust Model with Reputation and Risk Evaluation for P2P Resource Sharing
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 07
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
Fighting peer-to-peer SPAM and decoys with object reputation
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Journal of the American Society for Information Science and Technology
A survey of trust and reputation systems for online service provision
Decision Support Systems
Measurements, analysis, and modeling of BitTorrent-like systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
IEEE Transactions on Parallel and Distributed Systems
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
Analysis of ratings on trust inference in open environments
Performance Evaluation
Exploring the feasibility of proactive reputations: Research Articles
Concurrency and Computation: Practice & Experience - Recent Advances in Peer-to-Peer Systems and Security (P2P 2006)
Analysis of a reputation system for Mobile Ad-Hoc Networks with liars
Performance Evaluation
Transaction Rate Limiters for Peer-to-Peer Systems
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Reputation Bootstrapping for Trust Establishment among Web Services
IEEE Internet Computing
Scrivener: providing incentives in cooperative content distribution systems
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Reputation management algorithms for DHT-based peer-to-peer environment
Computer Communications
A survey of attack and defense techniques for reputation systems
ACM Computing Surveys (CSUR)
Taxonomy of trust: Categorizing P2P reputation systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Exploring the feasibility of reputation systems under churn
IEEE Communications Letters
Long term study of peer behavior in the KAD DHT
IEEE/ACM Transactions on Networking (TON)
Replica Placement Algorithm for Highly Available Peer-to-Peer Storage Systems
AP2PS '09 Proceedings of the 2009 First International Conference on Advances in P2P Systems
Start Trusting Strangers? Bootstrapping and Prediction of Trust
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
A Queuing Model for Evaluating the Transfer Latency of Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
A probabilistic reputation model based on transaction ratings
Information Sciences: an International Journal
Performance limitations of ADSL users: a case study
PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
Bootstrapping trust evaluations through stereotypes
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
The design of a reliable reputation system
Electronic Commerce Research
In-degree dynamics of large-scale P2P systems
ACM SIGMETRICS Performance Evaluation Review
Understanding Disconnection and Stabilization of Chord
IEEE Transactions on Parallel and Distributed Systems
A multi-dimensional trust evaluation model for large-scale P2P computing
Journal of Parallel and Distributed Computing
A statistical theory of chord under churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
SPROUT: P2P routing with social networks
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
A probabilistic trust model for handling inaccurate reputation sources
iTrust'05 Proceedings of the Third international conference on Trust Management
Self-policing mobile ad hoc networks by reputation systems
IEEE Communications Magazine
A performance study of BitTorrent-like peer-to-peer systems
IEEE Journal on Selected Areas in Communications
FriendBox: A Hybrid F2F Personal Storage Application
CLOUD '12 Proceedings of the 2012 IEEE Fifth International Conference on Cloud Computing
Hi-index | 0.07 |
Reputation and trust systems rely on historical information to account for uncertainty about the intention of users to cooperate. In open, dynamic systems like peer-to-peer (P2P) networks, however, forming trust relationships is often a lengthy and time consuming effort due to the anonymous and discontinuous participation of users. For example, the flow of transactions may be interrupted by unexpected user departures, precluding trustors from gaining the necessary experience to make an accurate trust evaluation. The problem is further complicated in the case that no previous direct and reputational evidence is available. This happens, for instance, when a new user joins the system for the first time or users form short-term, ad hoc groups around a shared goal, which is very common in P2P networks. In these cases, the problem is how to minimize the time to bootstrap trust between volatile users who are unknown to one another. To shed light on this question, this paper presents an accurate model for capturing the influence of churn - the continuous process of node arrival and departure - on trust bootstrapping. Using our analytical model, we show that churn can be very problematic in real P2P systems and develop equations that allow system architects to compute the minimal transaction rate that achieves quick bootstrapping of trust. Also, we present an example of how our analytical framework can be used to design a viable solution for the trust bootstrapping problem in dynamic settings. The core idea is that users ask their social links to transact with strangers and together generate trust evaluations in a short time scale. Finally, we verify our theoretical results by simulation and confirm how a simple application of our framework can reduce bootstrapping times by 50% in environments with high churn rates.