Elements of network protocol design
Elements of network protocol design
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Proceedings of the 9th ACM conference on Computer and communications security
IEEE Internet Computing
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A reputation system for peer-to-peer networks
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
On the convolution of Pareto and gamma distributions
Computer Networks: The International Journal of Computer and Telecommunications Networking
Recommendation Retrieval in Reputation Assessment for Peer-to-Peer Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
The success of incentive techniques to motivate freeriders to contribute resources in file-sharing Gnutella-like peer-to-peer networks depends on the availability of peer behavior tracking in terms of resource consumption and contribution. Though many reputation systems have been proposed toward the goal of behavior tracking, the overheads incurred in such tracking have received little attention. Consideration of overheads is an important factor in judging the merits of a practical reputation tracking scheme in order to maintain the scalability of the underlying peer-to-peer network. This paper proposes two methods of reputation tracking: strong and weak reputations. These methods differ in the trade-offs between reliability of reputation tracking and the overheads incurred. We formally specify and verify strong reputations and note that while the scheme yields highly reliable reputation tracking, the reliability and overhead trade-offs in weak reputations present a more viable alternative for large peer-to-peer networks.