
134 Peer-to-Peer Computing
(a) possible cheating in EigenTrust
(b) a partition approach
FIGURE 6.3: Drawback of EigenTrust and a modified situation [Abrams
et al., 2005].
predecessor of c in the cycle and succ(c) the successor of c. The distri-
bution p over pre-trusted peers is restricted in such a way to assign an
equal amount of pre-trusted weight to each color.
Run Transactions Each peer i in every color c is a llowed to query and
download only from peers in succ(c). Thus, for every query q, the set of
servers contains only peers in succ(c).
Compute Trust Values In order to compute the trust sc ore for nodes of
a given color c