Scalable reputation management with trustworthy user selection for P2P MMOGs
International Journal of Advanced Media and Communication
A Framework for Reputation Management in Large-Scale Distributed Systems
Computer Supported Cooperative Work in Design IV
FISTE: A black box approach for end-to-end QoS management
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A new authentication model based on CL-PKC in resource limited P2P systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A probabilistic reputation model based on transaction ratings
Information Sciences: an International Journal
Trust Management and Admission Control for Host-Based Collaborative Intrusion Detection
Journal of Network and Systems Management
Future Generation Computer Systems
Building and managing reputation in the environment of Chinese e-commerce: a case study on Taobao
Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics
Behavior-based reputation management in P2P file-sharing networks
Journal of Computer and System Sciences
A QoS-based fine-grained reputation system in the grid environment
Concurrency and Computation: Practice & Experience
A survey of trust in social networks
ACM Computing Surveys (CSUR)
A Web Service trust evaluation model based on small-world networks
Knowledge-Based Systems
Hi-index | 0.00 |
Distributed peer-to-peer (P2P) applications have been gaining momentum recently. In such applications, all participants are equal peers simultaneously functioning as both clients and servers to each other. A fundamental problem is, therefore, how to select reliable servers from a vast candidate pool. To answer this important open question, we present a novel reputation system built upon the multivariate Bayesian inference theory. Our system offers a theoretically sound basis for clients to predict the reliability of candidate servers based on self-experiences and feedbacks from peers. In our system, a fine-grained quality of service (QoS) differentiation method is designed to satisfy the diverse QoS needs of individual nodes. Our reputation system is also application-independent and can simultaneously serve unlimited P2P applications of different type. Moreover, it is semidistributed in the sense that all application-related QoS information is stored across system users either in a random fashion or through a distributed hash table (DHT). In addition, we propose to leverage credits and social awareness as reliable means of seeking honest feedbacks. Furthermore, our reputation system well protects the privacy of users offering feedbacks and is secure against various attacks such as defaming, flattering, and the Sybil attack. We confirm the effectiveness and efficiency of the proposed system by extensive simulation results.