Research Article
Computational complexity of one reputation metric
@INPROCEEDINGS{10.1109/SECCMW.2005.1588305, author={Victor Grishchenko}, title={Computational complexity of one reputation metric}, proceedings={1st International ICST Workshop on the Value of Security through Collaboration}, publisher={IEEE}, proceedings_a={SECOVAL}, year={2006}, month={2}, keywords={}, doi={10.1109/SECCMW.2005.1588305} }
- Victor Grishchenko
Year: 2006
Computational complexity of one reputation metric
SECOVAL
IEEE
DOI: 10.1109/SECCMW.2005.1588305
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.
Copyright © 2005–2024 IEEE