Since traditional centralized trusting mechanism can not adapt to the demand of P2P network, we need establish a distributed trusting mechanism to strength the reliability of system. The trust models focus o the members.. It divides P2P network into several overlapped groups with different functions and treats it as trust relationship of groups, trust relationship between groups and peers and t...

Decentralized peer to peer networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network topology or data placement. The greatest advantage is the robustness provided by them. However, flooding-based query algorithms used by the networks produce enormous amounts of traffic and substantially slow down the system...

Peer-to-peer systems have become one of the most popular Internet applications. Some unstructured systems such Gnutella perform file searching by flooding requests among nodes. It has been proven that such unstructured systems are not scalable, and searching consumes tremendous bandwidth. We propose three mechanisms to reconstruct the system topology and improve message flooding. Our research a...

Though many have explored BitTorrent networks theoretically or experimentally, few have examined the graph topology underlying the connections made between peers in a BitTorrent system. Also, many have looked at the presence of scale-free and small-world characteristics in various peerto-peer network topologies, but not specifically at BitTorrent, the most popular peer-to-peer system. This pape...

Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network topology or data placement. The greatest advantage is the robustness provided by them. However, flooding-based query algorithms used by the networks produce enormous amounts of traffic and substantially slow down the ...

The advent of digital libraries along with the tremendous growth of digital content call for distributed and scalable approaches for managing vast data collections. Peer-to-peer (P2P) networks emerge as a promising solution to delve with these challenges. However, the lack of global content/topology knowledge in an unstructured P2P system demands unsupervised methods for content organization an...

Important research efforts are conducted in the area of search, lookup, and routing, and are even increasing in light of promises and challenges of peer-to-peer (P2P) systems or the semantic web. To organize these areas of concern, this paper proposes an exhaustive two-dimensional design space that structures and classifies current and facilitates future research. In the functional dimension, i...

Epidemic protocols proved to be very efficient solutions for supporting dynamic and complex information diffusion in highly distributed computing infrastructures, like P2P environments. They are useful bricks for building and maintaining virtual network topologies, in the form of overlay networks as well as to support pervasive diffusion of information when it is injected into the network. This...

Clustering technique is used in database and information retrieval system for organizing data and improving retrieval efficiency. We surmise such functionality is valuable to a Peer-to-Peer (P2P) distributed environment. In this paper, we introduce the concept of peer clustering at the level of overlaying network topology, thus, data inside the P2P network are organized in a fashion similar to ...

Almost all recent researches on P2P systems focus on how to build a highly usable P2P overlay network. Researchers include small routing table, short query path and good robustness into their design objectives of overlay topology. In this paper, we present a general group theory method and define a new Cayley graph. Based on this Cayley graph, we propose a novel P2P overlay network called CHC, ...