On Distributed Rating Systems for Peer-to-Peer Networks

@article{Tian2008OnDR,
  title={On Distributed Rating Systems for Peer-to-Peer Networks},
  author={Ye Tian and Di Wu and Kam-Wing Ng},
  journal={Comput. J.},
  year={2008},
  volume={51},
  pages={162-180}
}
In recent years, many distributed rating systems have been proposed against the increasing misbehaviors of peers in peer-to-peer (P2P) networks. However, the low accuracy, long-response time and vulnerabilities under the adversary attacks of P2P rating systems have long been criticized and hindering the practical deployment of such a mechanism. There is also a lack of systematic analysis and evaluation for understanding the systems. In this paper, we first present a framework of stochastic… 

Figures from this paper

Peer-to-Peer System Design: A Socioeconomic approach

TLDR
This thesis argues that the goal of most earlier P2P works, of achieving a Nash equilibrium when all peers are rational, is limited, and presents Design Space Analysis, a simulation based method that allows for flexible user behavior assumptions and aims to analyze protocols more comprehensively and not just on a single point in the design space.

Robust vote sampling in a P2P media distribution system

TLDR
This work presents the design and simulations, using real BitTorrent traces, for a method combining fully decentralized metadata dissemination, vote sampling and ranking for deployment in the Tribler.org BitTorrent media client.

Low-Cost Web Service Discovery Based on Distributed Decision Tree in P2P Environments

TLDR
Experimental results based on synthetic and real datasets show the proposed QoS-aware Web service discovery approach can perform effective service discovery with low cost in P2P environments.

Virtual Domain Sharing in e-Science based on Usage Service Level Agreements

TLDR
This paper proposes an integrated architecture that provides uSLA-based access to resources, supports the recurrent delegation of usage rights, and provides faulttolerant resource co-allocation.

References

SHOWING 1-10 OF 40 REFERENCES

The Eigentrust algorithm for reputation management in P2P networks

TLDR
An algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global trust value, based on the peer's history of uploads is described.

A reputation-based approach for choosing reliable resources in peer-to-peer networks

TLDR
This work proposes a self-regulating system where the P2P network is used to implement a robust reputation mechanism, and a distributed polling algorithm by which resource requestors can assess the reliability of a resource offered by a participant before initiating the download.

On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks

TLDR
It is shown that systems with heavy-tailed lifetime distributions are more resilient than those with light-tailed (e.g., exponential) distributions and that for a given average degree, k-regular graphs exhibit the highest level of fault tolerance.

Fuzzy techniques for trust and reputation management in anonymous peer-to-peer systems

TLDR
Fuzzy techniques are used in the design of reputation systems based on collecting and aggregating peers' opinions and the behavior of the proposed system is described by comparison with probabilistic approaches.

Denial-of-service resilience in peer-to-peer file sharing systems

TLDR
The resilience of p2p file sharing systems against DoS attacks, in which malicious nodes respond to queries with erroneous responses, is studied by means of analytical modeling and simulation and a new class of p 2p-network-targeted attacks is introduced.

Measurement study of peer-to-peer file sharing systems

TLDR
This measurement study seeks to precisely characterize the population of end-user hosts that participate in Napster and Gnutella, and shows that there is significant heterogeneity and lack of cooperation across peers participating in these systems.

A Robust Reputation System for P2P and Mobile Ad-hoc Networks

TLDR
This paper proposes a fully distributed reputation system that can cope with false disseminated information and enables redemption and prevent the sudden exploitation of good reputation built over time by introducing re-evaluation and reputation fading.

Effective use of reputation in peer-to-peer environments

TLDR
It is shown that the straightforward approach for peers to exploit the reputation metrics may lead to unexpectedly low efficiency for high-performing peers, and argues and justifies experimentally that the calculation of the reputation values has to be complemented by reputation-based policies that define the pairs of peers eligible to interact.

Managing and Sharing Servents' Reputations in P2P Systems

TLDR
An approach to P2P security where servants can keep track, and share with others, information about the reputation of their peers is proposed, based on a distributed polling algorithm by which resource requestors can assess the reliability of perspective providers before initiating the download.