The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
Abstract
Peer-to-Peer (P2P) reputation systems are essential to evaluate the trustworthiness of participating peers and to combat the selfish, dishonest, and malicious peer behaviors. The system collects locally-generated peer feedbacks and aggregates them to yield the global reputation scores. Surprisingly, most previous work ignored the distribution of peer feedbacks. We use a trust overlay network (TON) to model the trust relationships among peers. After examining the eBay transaction trace of over 10,000 users, we discover a power-law distribution in user feedbacks. Our mathematical analysis justifies that power-law distribution is applicable to any dynamically growing P2P systems, either structured or unstructured. We develop a robust and scalable P2P reputation system, PowerTrust, to leverage the power-law feedback characteristics. The PowerTrust system dynamically selects small number of power nodes that are most reputable using a distributed ranking mechanism. By using a look-ahead random walk strategy and leveraging the power nodes, PowerTrust significantly improves in global reputation accuracy and aggregation speed. PowerTrust is adaptable to dynamics in peer joining and leaving and robust to disturbance by malicious peers. Through P2P network simulation experiments, we find significant performance gains in using PowerTrust. This power-law guided reputation system design proves to achieve high query success rate in P2P file-sharing applications. The system also reduces the total job makespan and failure rate in large-scale, parameter-sweeping P2P Grid applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1999) · Cited by 12,854
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
An Architecture for Differentiated Services
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., & Weiss, W. (1998) · doi:10.17487/rfc2475 · Cited by 3,965
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
The EigenTrust algorithm for reputation management in P2P networks
Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775242 · Cited by 3,362
Chord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · ACM SIGCOMM Computer Communication Review · doi:10.1145/964723.383071 · Cited by 1,923
Measurement study of peer-to-peer file sharing systems:
Saroiu, S., Gummadi, P. K., & Gribble, S. D. (2001) · SPIE Proceedings · doi:10.1117/12.449977 · Cited by 1,905
Trust among strangers in internet transactions: Empirical analysis of eBay' s reputation system
Resnick, P., & Zeckhauser, R. (2004) · Advances in Applied Microeconomics · doi:10.1016/s0278-0984(02)11030-3 · Cited by 1,804
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
Xiong, L., & Liu, L. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1318566 · Cited by 1,788
Efficient fair queuing using deficit round-robin
Shreedhar, M., & Varghese, G. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.502236 · Cited by 1,399
A self-clocked fair queueing scheme for broadband applications
Golestani, S. J. (2002) · Proceedings of INFOCOM '94 Conference on Computer Communications · doi:10.1109/infcom.1994.337677 · Cited by 1,100
Managing trust in a peer-2-peer information system
Aberer, K., & Despotovic, Z. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502638 · Cited by 917
Managing trust in a peer-2-peer information system
Aberer, K., & Despotovic, Z. (2001) · Proceedings of the tenth international conference on Information and knowledge management - CIKM'01 · doi:10.1145/502636.502638 · Cited by 915
Matei, R., Iamnitchi, A., & Foster, P. (2002) · IEEE Internet Computing · doi:10.1109/4236.978369 · Cited by 766
An analysis of Internet content delivery systems
Saroiu, S., Gummadi, K. P., Dunn, R. J., Gribble, S. D., & Levy, H. M. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844158 · Cited by 546
A Robust Reputation System for P2P and Mobile Ad-hoc Networks
Buchegger, S., & Boudec, J. L. (2004) · Cited by 506
On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing
Foster, I., & Iamnitchi, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45172-3_11 · Cited by 504
Trust and reputation model in peer-to-peer networks
Wang, Y., & Vassileva, J. (2004) · Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003) · doi:10.1109/ptp.2003.1231515 · Cited by 476
Trusted P2P Transactions with Fuzzy Reputation Aggregation
Song, S., Hwang, K., Zhou, R., & Kwok, Y.-K. (2005) · IEEE Internet Computing · doi:10.1109/mic.2005.136 · Cited by 408
Self-citationMAAN: a multi-attribute addressable network for grid information services
Cai, M., Frank, M. R., Chen, J., & Szekely, P. A. (2004) · Latin American Web Congress · doi:10.1109/grid.2003.1261714 · Cited by 393
Free riding on Gnutella revisited: the bell tolls?
Hughes, D., Coulson, G., & Walkerdine, J. (2005) · IEEE Distributed Systems Online · doi:10.1109/mdso.2005.31 · Cited by 377
Ripeanu, M., Foster, I. T., & Iamnitchi, A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0209028 · Cited by 334
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks
Srivatsa, M., Xiong, L., & Liu, L. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060808 · Cited by 309
Analyzing peer-to-peer traffic across large networks
Sen, S., & Wang, J. (2002) · Proceedings of the second ACM SIGCOMM Workshop on Internet measurment - IMW '02 · doi:10.1145/637201.637222 · Cited by 290
TrustMe: anonymous management of trust relationships in decentralized P2P systems
Singh, A., & Liu, L. (2003) · Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003) · doi:10.1109/ptp.2003.1231514 · Cited by 287
Zipf, Power-laws, and Pareto-a ranking tutorial
Adamic, L. A. (2000) · Cited by 277
An analysis of internet content delivery systems
Saroiu, S., Gummadi, K. P., Dunn, R. J., et al. (2002) · doi:10.1145/1060289.1060319 · Cited by 244
Limited reputation sharing in P2P systems
Marti, S., & Garcia-Molina, H. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988787 · Cited by 214
Analyzing the economic efficiency of eBay-like online reputation reporting mechanisms
Dellarocas, C. (2001) · Proceedings of the 3rd ACM conference on Electronic Commerce · doi:10.1145/501158.501177 · Cited by 179
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
Cai, M., Frank, M. R., Chen, J., & Szekely, P. A. (2004) · Journal of Grid Computing · doi:10.1007/s10723-004-1184-y · Cited by 149
Conductance and congestion in power law graphs
Gkantsidis, C., Mihail, M., & Saberi, A. (2003) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/781027.781046 · Cited by 122
Making Eigenvector-Based Reputation Systems Robust to Collusion
Zhang, H., Goel, A., Govindan, R., Mason, K., & Roy, B. V. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30216-2_8 · Cited by 112
Fair and efficient packet scheduling using Elastic Round Robin
Kanhere, S. S., Sethu, H., & Parekh, A. B. (2002) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.993210 · Cited by 112
Identity crisis: anonymity vs reputation in P2P systems
Marti, S., & García-Molina, H. (2004) · International Conference on Peer-to-Peer Computing · doi:10.1109/ptp.2003.1231513 · Cited by 88
Effective use of reputation in peer-to-peer environments
Papaioannou, T. G., & Stamoulis, G. D. (2004) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2004.1336576 · Cited by 50
The Design of A Distributed Rating Scheme for Peer-to-peer Systems
Dutta, D., Goel, A., Govindan, R., et al. (2007) · Cited by 45
Conductance and congestion in power law graphs
Gkantsidis, C., Mihail, M., & Saberi, A. (2003) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/885651.781046 · Cited by 35
Deficits for bursty latency-critical flows: DRR++
MacGregor, M. H., & Shi, W. (2002) · The ... IEEE International Conference on Networks/The IEEE International Conference on Networks · doi:10.1109/icon.2000.875803 · Cited by 27
Monitoring and controlling QoS network domains
Habib, A., Fahmy, S., & Bhargava, B. (2004) · International Journal of Network Management · doi:10.1002/nem.541 · Cited by 15
A proportional congestion control solution for real-time traffic
Jin-mei, Y. (2005) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2005-08373 · Cited by 2
Cited by
A survey of attack and defense techniques for reputation systems
Hoffman, K., Zage, D., & Nita-Rotaru, C. (2009) · ACM Computing Surveys · doi:10.1145/1592451.1592452 · Cited by 777
A survey of trust in social networks
Sherchan, W., Nepal, S., & Paris, C. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501661 · Cited by 671
Distributed and cloud computing: from parallel processing to the Internet of things
(2012) · Choice Reviews Online · doi:10.5860/choice.49-5712 · Cited by 314
Trusted Cloud Computing with Secure Resources and Data Coloring
Hwang, K., & Li, D. (2010) · IEEE Internet Computing · doi:10.1109/mic.2010.86 · Cited by 291
Self-citationRATEWeb: Reputation Assessment for Trust Establishment among Web services
Malik, Z., & Bouguettaya, A. (2009) · The VLDB Journal · doi:10.1007/s00778-009-0138-1 · Cited by 260
Metadata
- Authors
- Zhou, R., & Hwang, K.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2007-04
- Volume
- 18
- Issue
- 4
- Pages
- 460-473
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2156937700
- Cited by
- 728
- References
- 42
- FWCI
- 199.83
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.