Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Analyzing peer-to-peer traffic across large networks
IEEE/ACM Transactions on Networking (TON)
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
Coping with inaccurate reputation sources: experimental analysis of a probabilistic trust model
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Designing a DHT for low latency and high throughput
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Exploring the feasibility of proactive reputations: Research Articles
Concurrency and Computation: Practice & Experience - Recent Advances in Peer-to-Peer Systems and Security (P2P 2006)
Secure Forwarding in DHTs - Is Redundancy the Key to Robustness?
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
DHT routing using social links
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
Reputation mechanisms help peer-to-peer (P2P) networks to detect and avoid unreliable or uncooperative peers. Recently, it has been discussed that routing protocols can be improved by conditioning routing decisions to the past behavior of forwarding peers. However, churn -- the continuous process of node arrival and departure -- may severely hinder the applicability of rating mechanisms. In particular, short lifetimes mean that reputations are often generated from a small number of transactions. To examine how high rates of churn affect rating mechanisms, this paper introduces an analytical model to compute at which rate transactions has to be performed so that the generated reputations are sufficiently reliable. We then propose a new routing protocol for structured P2P systems that exploits reputation to improve the decision about which neighbor choose as next hop. Our results demonstrate that routing algorithms can extract substantial benefits from reputations even when peer lifetimes are short.