Reputation based probabilistic resource allocation for avoiding free riding and formation of common interest groups in unstructured P2P networks
- 16 July 2015
- journal article
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 9 (6) , 1101-1113
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- A grade-based incentive mechanism with starvation prevention for maintaining fairness in peer-to-peer networksInternational Journal of System Assurance Engineering and Management, 2012
- New P2P Sharing Incentive Mechanism Based on Social Network and Game Theory2012
- Trust‐aware query routing in P2P social networksInternational Journal of Communication Systems, 2011
- GossipTrust for Fast Reputation Aggregation in Peer-to-Peer NetworksIEEE Transactions on Knowledge and Data Engineering, 2008
- Incentive and Service Differentiation in P2P Networks: A Game Theoretic ApproachIEEE/ACM Transactions on Networking, 2006
- Reputation-based policies that provide the right incentives in peer-to-peer environmentsComputer Networks, 2006
- Reciprocal resource sharing in P2P environments2005
- Robust incentive techniques for peer-to-peer networks2004
- Free riding on GnutellaFirst Monday, 2000
- Modeling TCP throughputACM SIGCOMM Computer Communication Review, 1998