In recent years, Peer-to-Peer (P2P) systems and computational Grids are evolving into a new distributed computing model, called P2P Grid. This paper presents a new approach to solving the trust and security problems in a P2P Grid. Establishing trust in P2P Grids is essential to build lasting working relationships among the peers joining collective Grid applications. A P2P reputation system is t...

An aggregation service (AgS) is a P2P overlay-tier whose purpose is to aggregate and optimize the searching of services and service components maintained by service providers in a P2P Service Overlay Network (SON). AgS dimensioning takes into account the AgS size, in order to allow it to adequately perform the searching when compared with P2P SON native searching mechanisms. Suitable AgS dimens...

Peer-to-peer network is one in which each node in the network can act as a client or server for the other nodes in the network. It allows shared access to various resources such as files, peripherals, and sensors without the need for a central server. Content distribution in the P2P network from server is done by multicasting. Multicasting is the process of sending the data to the multiple desi...

We show that the de Bruijn graph is appropriate for maintaining dynamic connections, e.g., between the members of a P2P application who join and leave the system at their convenience. We describe the content-addressable network D2B, based on an overlay network preserving de Bruijn connections dynamically, and on a distributed hash table (DHT) supporting efficient publish and search procedures. ...

P2P traffic has brought serious impact on the bearer network, and how to utilize network bandwidth has become a common concern problem for the Internet Service Provider (ISP) and the P2P user. A congestion distance and DHT based P2P traffic optimization method is proposed in this paper. The P2P traffic optimization model imports both aims of the ISP and the P2P user, and the cost of congestion ...

. Abstract . . Traditional botnets use a centralized communications architecture where all the bots connect to Command and Control (C&C) servers. These servers are the weak point of the botnet, as they are easy targets for take down and monitoring. Peer-to-peer (p2p) botnets have a distributed architecture, which make them more resilient. This research aims at the detection of individual p2p bo...

A peerto-peer (P2P) network is a distributed system in which peers employ distributed resources to perform a critical function in a decentralized fashion. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce remarkable network traffic. The resultant networks may not perform searches eff...

Peer-to-peer (P2P) systems have received a lot of attention due to the popularity of applications such as SETI, Napster, Gnutella, and Morpheus. The P2P systems present tremendous challenges in searching data items among the numerous host nodes. While search has been studied in a similar but different context, i.e., parallel and distributed database systems, the large scale and dynamic membersh...

We propose a data replication scheme on a random apollonian P2P overlay that benefits from the small world and scale free properties. The proposed algorithm features a replica density estimation and a space filling mechanism designed to avoid redundant messages. Not only it provides uniform replication of the data stored into the network but it also improves on classical flooding approaches by ...

Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry [3, 6, 5, 9] provide a self-organizing substrate for large-scale peer-to-peer applications. These systems provide efficient, fault-tolerant routing, object location and load balancing within a selforganization overlay network. In this paper, we show how redundant information that is collected as part of the norm...