Reputation Aggregation in Peer-to-Peer Network Using Differential Gossip Algorithm

@article{Gupta2015ReputationAI,
  title={Reputation Aggregation in Peer-to-Peer Network Using Differential Gossip Algorithm},
  author={Ruchir Gupta and Yatindra Nath Singh},
  journal={IEEE Transactions on Knowledge and Data Engineering},
  year={2015},
  volume={27},
  pages={2812-2823}
}
  • Ruchir Gupta, Y. N. Singh
  • Published 16 October 2012
  • Computer Science
  • IEEE Transactions on Knowledge and Data Engineering
In a peer-to-peer system, a node should estimate reputation of other peers not only on the basis of its own interaction, but also on the basis of expression of other nodes. Reputation aggregation mechanism implements strategy for achieving this. Reputation aggregation in peer to peer networks is generally a very time and resource consuming process. Moreover, most of the methods consider that a node will have the same reputation after aggregation with all the nodes in the network, which is not… 

Figures and Tables from this paper

Trust estimation in peer-to-peer network using BLUE
TLDR
A new trust estimation method using BLUE (Best Linear Unbiased Estimator) that also takes into account the uncertainties in the input variables is proposed and shows that using the proposed estimation method, effective trust estimation is achieved in the peer-to-peer resource sharing systems.
An Algorithm for Creating Malicious Free Absolute Trust Peers in P2P Networks
TLDR
A new algorithm is proposed which accounts for the past behavior of the peers and will estimate the absolute value of the trust of peers to mitigate the attacks by malicious peers and to motivate the peers to share the resources effectively and securely.
Detecting Malicious Peers with Past Behavior and Identifying Absolute Trust Peers in P 2 P Networks
TLDR
A new algorithm is proposed which accounts for the past behavior of the peers and will estimate the absolute value of the trust of peers to mitigate the attacks by malicious peers and to motivate the peers to share the resources effectively and securely.
A New Incentive Based Algorithm for Avoiding Free Riding in Peer to Peer Network
TLDR
The results show that the scheme is efficient for a P2P network of few tens of nodes and with slight modifications, this mechanism can be extended for large sized networks.
An Efficient Local Strategy to Control Information Spreading in Network
TLDR
An immunization strategy is proposed that uses only local information available at a node, viz. degree of the node and average degree of its neighbour nodes, which has less complexity and gives significantly better results in comparison with other strategies while using only local Information.
Reliable and Authenticated Rumor Riding Protocol for Unstructured Peer-to-Peer Network
TLDR
It is concluded that the proposed Trusted Rumor Riding (TRR) protocol can detect several attack while satisfying the quality of service needs.
Adaptive Capacity Partitioning in Cooperative Computing to Maximize Received Resources
TLDR
The adaptive step size (ASZ) can provide an efficient solution to the problem of optimal partitioning in real-life distributed networks due to its distributed implementation, robustness to changes in network dynamics, and compatibility with the existing partitioning schemes.
An Adjusted Free-Market-Inspired Approach to Mitigate Free-Riding Behavior in Peer-to-Peer Fog Computing
TLDR
The experimental results indicate that the proposed AFMIA, an Adjusted Free-Market-Inspired Approach that considers resources as goods that have dynamic prices based on the amount of supply and demand, can successfully improve fairness without compromising on success rates.
Asynchronous epidemic algorithms for consistency in large-scale systems
TLDR
The research work shows that combining and integrating the proposed protocols enables extreme-scale distributed systems to achieve and detect global consistent states even under realistic and dynamical conditions.
...
...

References

SHOWING 1-10 OF 36 REFERENCES
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
TLDR
The simulation results demonstrate that GossipTrust has small aggregation time, low memory demand, and high ranking accuracy, and suggest promising advantages of using the Gossip trust system for trusted P2P applications.
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.
Trust estimation in peer-to-peer network using BLUE
TLDR
A new trust estimation method using BLUE (Best Linear Unbiased Estimator) that also takes into account the uncertainties in the input variables is proposed and shows that using the proposed estimation method, effective trust estimation is achieved in the peer-to-peer resource sharing systems.
PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities
  • Li Xiong, Ling Liu
  • Computer Science
    IEEE Transactions on Knowledge and Data Engineering
  • 2004
TLDR
PeerTrust is presented - a reputation-based trust supporting framework, which includes a coherent adaptive trust model for quantifying and comparing the trustworthiness of peers based on a transaction-based feedback system, and a decentralized implementation of such a model over a structured P2P network.
PET: A PErsonalized Trust Model with Reputation and Risk Evaluation for P2P Resource Sharing
TLDR
PET, a personalized trust model, is proposed to help the construction of a good cooperation, especially in the context of economic-based solutions for the P2P resource sharing, and combining with traditional reputation evaluation to derive the trustworthiness in this field.
Heuristic Discovery of Role-Based Trust Chains in Peer-to-Peer Networks
TLDR
A novel heuristic-weighting approach to selecting the most likely path to construct a role-based trust chain, and applies history-sensitive heuristics to measure the path complexity and assess the chaining efficiency.
Randomized gossip algorithms
TLDR
This work analyzes the averaging problem under the gossip constraint for an arbitrary network graph, and finds that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm.
Rumor Spreading in Social Networks
TLDR
It is proved that, in these networks, the standard PUSH-PULL strategy delivers the message to all nodes within O (log2 n ) rounds with high probability; and by themselves, PUSH and PULL require polynomially many rounds.
Gossip-based computation of aggregate information
  • D. Kempe, A. Dobra, J. Gehrke
  • Computer Science
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
TLDR
This paper analyzes the diffusion speed of uniform gossip in the presence of node and link failures, as well as for flooding-based mechanisms, and shows that this diffusion speed is at the heart of the approximation guarantees for all of the above problems.
Small-world file-sharing communities
TLDR
A novel perspective on file sharing that considers the relationships that form among users based on the files in which they are interested is proposed and a new structure that captures common user interests in data is proposed - the data-sharing graph.
...
...