Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Brief announcement: prefix hash tree
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Asynchronous distributed averaging on communication networks
IEEE/ACM Transactions on Networking (TON)
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
IEEE Transactions on Knowledge and Data Engineering
Peer-to-Peer Secure Multi-party Numerical Computation
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
ScoreTree: a decentralised framework for credibility management of user-generated content
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
| Hi-index | 0.00 |
User-generated content (UGC) from Internet users has significant value only when its credibility can be established A basic approach to establishing credibility is to take an average of scores from annotators, while more sophisticated approaches have been used to eliminate anomalous scoring behaviour by giving different weights to scores from different annotator profiles A number of applications such as file sharing and article reviewing use a decentralised architecture While computing a weighted average of static values in a decentralised application is well studied, sophisticated UGC algorithms are more complicated since source values to be aggregated and their weights may change in time In our work we consider a centralised credibility management algorithm, ScoreFinder, as an example, and show both structured and unstructured approaches for computing time-dependent weighted average values in peer-to-peer (P2P) networks Experimental results on two real data sets demonstrate that our approaches converge and deliver results comparable to those from the centralised version of ScoreFinder.