In peer-to-peer (P2P) systems where individual peers must cooperate to process each other’s requests, a useful metric for evaluating the system is how many remote requests are serviced by each peer. In this paper we apply this remote work metric to flooding-based P2P search networks such as Gnutella. We study how to maximize the remote work in the entire network by controlling the rate of query...

In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. There is no dichotomy between a central server and distributed clients. Current P2P networks (e.g., Gnutella) are constructed by participants following their own un-coordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and ...

Peer-to-peer systems such as Gnutella are resilient to failures at a single point in the network because of their decentralized nature. However an attack resulting in the removal of a small percentage of highly connected nodes could cripple such systems. We believe that distributed attack recovery is not simply a reactive process but requires proactive measures by the nodes in the system. We pr...

The focus of this paper is the searching behavior in Peer-to-Peer (P2P) communities and in that context, will discuss potential for enhancement of the P2P protocol using searching behavior. Due to excessive network traffic, network scalability is a major P2P problem. The purpose of this paper is to study searching behavior by using log files and subsequently, will propose solutions to reduce th...

. How to build an efficient and scalable p2p file sharing system is still an open question. Structured systems obtain O(log(N)) lookup upper bound by associating content with node. But they can not supporting complex queries. On the other hand, Gnutella-like unstructured systems support complex queries, but because of its random-graph topology and its flooding content discovery mechanism, it ca...

1 Introduction A hash table is a data structure that efficiently maps " keys " onto " values " and serves as a core building block in the implementation of software systems. We conjecture that many large-scale distributed systems could likewise benefit from hash table functionality.We use the term Content-Addressable Network (CAN) to describe such a distributed, Internet-scale, hash table. Perh...

Resource search or discovery is a fundamental issue in peer-to-peer (P2P) and grid studies.1 Search objects, or resources, can be cycles, storage spaces, files, services, addresses, and so on. In general, systems are employing three categories of P2P-network architectures to improve search performance: centralized (such as Napster, http://www.napster.com/), decentralized but structured (such as...

SHARK is a novel concept and middleware service for search in peer-to-peer (P2P) networks. Rather than flooding a network like Gnutella or imposing numerical IDs on objects like distributed hash tables, it is based on directed routing of keywords in a multidimensional redundant metadata hierarchy. SHARK arranges nodes and objects in the network and in semantic clusters. In spite of its rich key...

Currently used P2P file-sharing systems such as Gnutella suffer from a freeloading problem due to absence of enforcible decentralized mechanism to motivate peers to provide services to others. Freeloading leads to a de facto centralized system that is susceptible to DoS attacks and provides poor service to its participants. In this paper, we propose a decentralized mechanism that avoids on-line...

Today, peer-to-peer (P2P) networks, e.g., filesharing networks like Gnutella, are specialised towards specific purposes. This shortcoming is addressed by introducing a new middleware for P2P networks which is shown in Figure 1. The middleware supports the deployment and use of services inside a P2P network. It consists of six different modules, each encapsualating the functionality required for...