Information Technology Reference
In-Depth Information
Uniform Links
c
succ(c)
(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 allowed 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 score for nodes of
a given color c, the stationary distribution of a modified Markov chain
is determined. The outgoing links from color c are set to be uniform
over succ(c), and then the trust values of the nodes in c in this modified
Markov chain are computed as shown in Figure 6.3(b).
Simulation results indicated that the improved EigenTrust algorithm per-
formed almost as well as the original EigenTrust but demonstrated better load
balancing properties.
Search WWH ::
Custom Search