Abstract
The recent and rapid development of P2P systems is paving the way for a distinguished manner of computing where autonomy and decentralization are the foundation of success. In this paper, we focus on the problem of free riding in decentralized collaborative environments. We propose a novel free riders filtering algorithm based on trustworthiness. Existing, literature does not consider trustworthiness, which we believe is a vital dimension that should be considered when identifying free riders. Our proposed algorithm is based on appraisal analysis to filter out and isolate free riders. Our extensive simulation experiments show that our proposed algorithm is reasonably successful in identifying free riders in P2P systems.
| Original language | English |
|---|---|
| Pages (from-to) | 61-76 |
| Number of pages | 16 |
| Journal | Journal of Next Generation Information Technology |
| Volume | 1 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2010 |
Keywords
- P2P systems
- Reputation
- Trust
ASJC Scopus subject areas
- General Computer Science