EigenTrust

EigenTrust

EigenTrust algorithm is a reputation management algorithm for peer-to-peer networks, developed by Sep Kamvar, Mario Schlosser, and Hector Garcia-Molina. The algorithm provides each peer in the network a unique global trust value based on the peer's history of uploads and thus aims to reduce the number of inauthentic files in a P2P network.

Overview

Peer-to-peer systems available today (like Gnutella) are open, often anonymous and lack accountability. Hence a user with malicious intent can introduce into the peer-to-peer network resources that may be inauthentic, corrupted or malicious (Virus). This reflects poorly on the credibility of current peer-to-peer systems. A research team from Stanford provides a reputation management system, where each peer in the system has a unique global trust value based on the peer's history of uploads. Any peer requesting resources will be able to access the trust value of a peer and avoid downloading files from untrusted peers.

Algorithm

The Eigentrust algorithm is based on the notion of transitive trust: If a peer "i" trusts any peer "j", it would also trust the peers trusted by "j". Each peer "i" calculates the local trust value "s""ij" for all peers that have provided it with authentic or fake downloads based on the satisfactory or unsatisfactory transactions that it has had.

:s_{ij} = operatorname{sat}(i,j) - operatorname{unsat}(i,j)

where sat ("i", "j") refers to the number of satisfactory responses that peer "i" has received from peer "j",and unsat("i", "j") refers to the number of unsatisfactory responses that peer "i" has received from peer "j".

The local value is normalized, to prevent malicious peers from assigning arbitrarily high local trust values to colluding malicious peers and arbitrarily low local trust values to good peers. The normalized local trust value "c""ij" is then

:c_{ij} = frac{max(s_{ij},0)}{sum_{j} max(s_{ij}, 0)}

The local trust values are aggregated at a central location or in a distributed manner to create a trust vector for the whole network. Based on the idea of transitive trust, a peer "i" would ask other peers it knows to report the trust value of a peer "k" and weigh responses of these peers by the trust peer "i" places in them.

: t_{ik} = sum_{j} c_{ij} c_{jk}

If we assume that a user knew the "c""ij" values for the whole network in the form of a matrix "C", then trust vector ar t_{i} that defines the trust value for t_{ik} is given by

:ar t_{i} = C^Tar c_{i}.,

In the equation shown above, if C is assumed to be aperiodic and strongly connected, powers of the matrix C will converge to a stable value at some point.

:ar t = (C^T)^x ar c_{i}. ,

It seems that for a large value of "x", the trust vector ar t_{i} will converge to the same vector for every peer in the network. The vector ar t_{i} is known as the left principal eigenvector of the matrix "C". We also note that since ar t_{i} is same for all nodes in the network, it represents the global trust value.

Based on the results above a simple centralized trust value computing algorithm can be written. Note that we assume that all the local trust values for the whole network are available and present in the matrix "C". We also note that, if the equation shown above converges, we can replace the initial vector ar c_{i} by a vector ar e that is an m-vector representing uniform probability distribution over all m peers. The basic EigenTrust algorithm is shown below:

:ar t_{0} = ar e ;

:repeat

:ar t^{(k+1)} = C^T ar t^{(k)} ;

:{delta} = || t^{(k+1)} - t^{(k)} || ;

:until {delta} < mathrm{error} ;

See also

*Markov chain
*Eigen

External links

* [http://citeseer.ist.psu.edu/kamvar03eigentrust.html S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, The EigenTrust Algorithm for Reputation Management in P2P Networks, In Proceedings of the Twelfth International World Wide Web Conference, 2003.]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • PageRank — is a link analysis algorithm that assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of measuring its relative importance within the set. The algorithm may be applied to… …   Wikipedia

  • Reputation management — is the process of tracking an entity s actions and other entities opinions about those actions; reporting on those actions and opinions; and reacting to that report creating a feedback loop. All entities involved are generally people, but that… …   Wikipedia

  • Sepandar Kamvar — Sepandar David Kamvar, also known as Sep Kamvar, is a Persian American computer scientist, artist, and entrepreneur based in San Francisco, CA. He is a consulting assistant professor of computational and mathematical engineering at Stanford… …   Wikipedia

  • Trittbrettfahrerproblem — Das Trittbrettfahrerproblem (engl. free rider problem) bezeichnet ein Problem kollektiven Handelns, das bei der Nutzung von Gemeingütern auftreten kann, wenn Wirtschaftssubjekte den Nutzen eines Gutes ohne Gegenleistung erlangen. Es tritt sowohl… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”