Distance-based reputation metrics are practical in P2P environments
by Victor S. Grishchenko
International Journal of Metadata, Semantics and Ontologies (IJMSO), Vol. 1, No. 2, 2006

Abstract: This article considers computational aspects of web-of-trust-like approaches in distributed, peer-to-peer environments. The key algorithmic issue here is finding the shortest trusted path between two participants. This is a kind of all-pairs-shortest-path problem and it is found to be resolvable assuming scale-free social graph topology and sublinear per-node resource constraints.

Online publication date: Tue, 03-Oct-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metadata, Semantics and Ontologies (IJMSO):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com