Title :
Computational complexity of one reputation metric
Author :
Grishchenko, Victor S.
Author_Institution :
Inst. of Phys. & Appl. Math., Ural State Univ., Yekaterinburg, Russia
Abstract :
This article addresses a problem of practical computation of a previously defined (Grischenko, 2004) reputation metric in P2P (peer-to-peer) environments. This problem turns out to be identical to a very generic all-pairs-shortest-paths problem (APSP) calculated in a distributed environment. An algorithm of practically acceptable computational cost is introduced and analyzed.
Keywords :
computational complexity; peer-to-peer computing; APSP; P2P environments; all-pairs-shortest-paths problem; computational complexity; peer-to-peer environments; reputation metric; Algorithm design and analysis; Computational complexity; Computational efficiency; Equations; Feedback; Fuzzy logic; Mathematics; Peer to peer computing; Physics computing; Voting;
Conference_Titel :
Security and Privacy for Emerging Areas in Communication Networks, 2005. Workshop of the 1st International Conference on
Print_ISBN :
0-7803-9468-2
DOI :
10.1109/SECCMW.2005.1588305
