2009•Unpublished venueRequires access

A New Trust and Reputation-Based Chain Model in Peer-to-Peer Networks

Sinjae Lee, Wonjun Lee

Open publisher page 1 citations

Abstract

Existing peer-to-peer (P2P) applications can be classified into one of the following three categories: file sharing, distributed processing, and instant messaging. The focus of our study will be on the P2P applications for file sharing since it is the most common application for P2P networks [6]. Reputationbased systems have been researched extensively by many, and some of these researchers have constructed reliable theoretical models. Among these is a simple model that is almost exclusively based on the trust feedback and credibility metrics of the P2P community; this model is used to decide the next course of action [1]. Transaction histories are stored in trust vectors, and the number of significant bits in each trust vector is denoted by an integer assigned to it. After each action, the most significant bit is replaced by the latest result, and the history bits are moved to the right of the vector. We calculate trust and distrust ratings on the basis of the bits in the trust vector.

About this research paper

What this paper is about

Existing peer-to-peer (P2P) applications can be classified into one of the following three categories: file sharing, distributed processing, and instant messaging. The focus of our study will be on the P2P applications for file sharing since it is the most common application for P2P networks [6]. Reputationbased systems have been researched extensively by many, and some of these researchers have constructed reliable theoretical models. Among these is a simple model that is almost exclusively based on the trust feedback and credibility metrics of the P2P community; this model is used to decide the next course of action [1]. Transaction histories are stored in trust vectors, and the number of significant bits in each trust vector is denoted by an integer assigned to it. After each action, the most significant bit is replaced by the latest result, and the history bits are moved to the right of the vector. We calculate trust and distrust ratings on the basis of the bits in the trust vector.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Existing peer-to-peer (P2P) applications can be classified into one of the following three categories: file sharing, distributed processing, and instant messaging. The focus of our study will be on the P2P applications for file sharing since it is the most common application for P2P networks [6]. Reputationbased systems have been researched extensively by many, and some of these researchers have constructed reliable theoretical models. Among these is a simple model that is almost exclusively based on the trust feedback and credibility metrics of the P2P community; this model is used to decide the next course of action [1]. Transaction histories are stored in trust vectors, and the number of significant bits in each trust vector is denoted by an integer assigned to it. After each action, the most significant bit is replaced by the latest result, and the history bits are moved to the right of the vector. We calculate trust and distrust ratings on the basis of the bits in the trust vector.

Key concepts: Reputation, Peer-to-peer, Chain (unit), Computer science, Business, Computer network, Political science, Law

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Trust and Reputation-Based Chain Model in Peer-to-Peer Networks — Research Paper | ScholarLens