Service Emergence based on Relationship among Self-Organizing Entities
SAINT '02 Proceedings of the 2002 Symposium on Applications and the Internet
Distributed Pagerank for P2P Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Real-World Oriented Entertainment Applications
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
A survey on distributed approaches to graph based reputation measures
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
A flexible architecture for privacy-aware trust management
Journal of Theoretical and Applied Electronic Commerce Research
No Free Lunch: Price Premium for Privacy Seal-Bearing Vendors
Journal of Management Information Systems
A group based reputation system for p2p networks
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
A unifying framework for behavior-based trust models
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
| Hi-index | 0.00 |
This paper proposes a distributed reputation model for open peer-to-peer networks called distributed pagerank. This model is motivated by the observation that although pagerank has already satis.ed the requirements of reputation models, the centralized calculation of pagerank is incompatible with peer-to-peer networks. Distributed pagerank is a decentralized approach for calculating the pagerank of each peer by its reputation, in which the relationship between peers is introduced as the equivalent to the link between web pages. The distributed calculation of pagerank is performed asynchronously by each peer as it communicates with the other peers. The asynchronous calculation accomplishes both demanding no extra messages for the calculation of pagerank and steadily calculating an accurate pagerank of each peer even under the dynamic topology of relationships. The result of the simulation has indicated that the calculated pagerank value of each peer converges at the original pagerank value under the static topology of relationships, which is presumable under a dynamic topology. A fully implemented application of distributed pagerank has also been presented, which supports dynamic formation of communities with reputation ranking.