In this paper we propose a new and efficient reputation management scheme for partially decentralized peer-to-peer systems. The reputation scheme helps to build trust between peers based on their past experiences and the feedback from other peers. We also propose two selection advisor algorithms for helping peers select the right peer to download from. The simulation results show that the propo...

A P2P system based on super-peer overlay shows good features of combining both advantages of hybrid and pure P2P systems. Most P2P applications being developed are based on the overlay networks composed of super-peers. Super-peer is a special peer acting as a server to a cluster of client peers. Selecting super-peers and constructing a super-peer overlay for clustering client peers are importan...

Trust is required in file sharing peer-to-peer (P2P) systems to achieve better cooperation among peers and reduce malicious uploads. In reputation-based P2P systems, reputation is used to build trust among peers based on their past transactions and feedbacks from other peers. In these systems, reputable peers will usually be selected to upload requested files, decreasing significantly malicious...

In this paper, we study the problem of consistent query answering in peer data sharing systems. In a peer data sharing system, databases in peers are designed and administered autonomously and acquaintances between peers are established thorough data sharing constraints. Since data are managed in peer databases autonomously, peers' data may be inconsistent with respect to the data sharing const...

In a typical peer-to-peer streaming model, a publisher provides the streaming content and the interested peers receive and disseminate data in a distributed fashion by forming an overlay. This form of distributed data dissemination makes p2p streaming highly scalable. But in reality, the peers are strategic and there is no incentive for them to contribute forward bandwidth towards other peers. ...

In a dynamic hash table (DHT), peers in a network cooperate to maintain a distributed keyvalue storage. Each peer in a DHT is responsible for storing a subset of keys and their values. Especially in a peer-to-peer system, the peers may not be stable. New peers join and existing peers either fail or leave the system. This process, called churn, requires the DHT to be able to reorganize itself. T...