Page 1 |
Save page Remove page | Previous | 1 of 123 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
SCALABLE REPUTATION SYSTEMS FOR PEER-TO-PEER NETWORKS
by
Runfang Zhou
A Dissertation Presented to the
FACULTY OF THE GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER SCIENCE)
May 2007
Copyright 2007 Runfang Zhou
Object Description
| Title | Scalable reputation systems for peer-to-peer networks |
| Author | Zhou, Runfang |
| Author email | rzhou@usc.edu |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science |
| School | Viterbi School of Engineering |
| Date defended/completed | 2007-01-25 |
| Date submitted | 2007 |
| Restricted until | Unrestricted |
| Date published | 2007-04-10 |
| Advisor (committee chair) | Hwang, Kai |
| Advisor (committee member) |
Kuo, C.-C. Jay Neuman, Clifford |
| Abstract | Peer-to-Peer reputation systems are essential to evaluate the trustworthiness of participating peers and to combat selfish, dishonest, and malicious peer behaviors. The system collects locally-generated peer feedbacks and aggregates them to yield global reputation scores. 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 discovered 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 two robust and scalable P2P reputation systems: PowerTrust and GossipTrust for structured and unstructured P2P networks, respectively. Both systems leverage the power-law feedback characteristics. PowerTrust dynamically selects a 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. GossipTrust is built with a new gossip communication protocol to support fast reputation aggregation and a novel storage scheme based on Bloom filters to store global reputation scores. GossipTrust applies identity-based cryptography to guarantee security and integrity of the exchanged reputation data.; Both PowerTrust and GossipTrust are 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 in structured P2P networks and GossipTrust in unstructured P2P networks. This power- law guided reputation system design proves to achieve high query success rate in P2P file-sharing applications and reduces the total job makespan and failure rate in large-scale, parameter-sweeping P2P Grid applications. |
| Keyword | P2P networks; reputation systems; trust; PSA; DHT |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Type | texts |
| Legacy record ID | usctheses-m367 |
| Contributing entity | University of Southern California |
| Rights | Zhou, Runfang |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | cisadmin@dots.usc.edu |
| Filename | etd-Zhou-20070410 |
| Archival file | uscthesesreloadpub_Volume40/etd-Zhou-20070410.pdf |
Description
| Title | Page 1 |
| Contributing entity | University of Southern California |
| Repository email | cisadmin@dots.usc.edu |
| Full text | SCALABLE REPUTATION SYSTEMS FOR PEER-TO-PEER NETWORKS by Runfang Zhou A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) May 2007 Copyright 2007 Runfang Zhou |
