Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. While flooding-based techniques are effective for locating highly replicated items, they are poorly suited for locating rare items. As an alternative, a wide variety of structured P2P networks such as Distributed Hash Tables ...

Computer networks or distributed systems in general may be regarded as communities where the individual components, be they entire systems, application software or users, interact in a shared environment. Such communities dynamically evolve with components or nodes joining and leaving the system. Their own individual activities affect the community’s behavior and vice versa. This paper discusse...

This paper presents an analysis of the Gnutella protocol, a type of the peer-to-peer networking model, that currently provides decentralized file-sharing capabilities to its users. The paper identifies the open problems that are related to the protocol and proposes strategies that can be used to resolve them. Initially, the paper explains the basics of the peer-to-peer networking, and then comp...

Peer-to-Peer (P2P) architectures are very prevalent in today’s Internet. Lots of P2P file sharing systems using Gnutella protocol emerge out and draw attractions of millions of people. The “flooding” search mechanism of Gnutella makes it easy to be deployed, but also spawns numerous messages which leads to serious scalability problems. However, the locality discovered in both user’s share files...

The Gnutella protocol describes a completely decentralized P2P file sharing system in which queries are flooded to all neighbors in the search for files. As originally specified, the protocol does not have any notion of providing privacy; as such, because agencies have begun to censor and threaten users of such systems, participation has decreased. In turn, users who continue to utilize the net...

Peer-to-Peer (P2P) networks without central entities, such as Gnutella or JXTA, generally suffer from a high signaling load resulting in poor efficiency. The main reason therefore is the flooding of search requests in the overlay, since in most P2P protocols the nodes are not aware of the P2P overlay network topology. Especially for resource constrained environments such as mobile communication...

The limitations of client-serverbased systems become evident in an Internet-scale distributed environment. Resources are concentrated on a small number of nodes, which must apply sophisticated load-balancing and fault-tolerance algorithms to provide continuous and reliable access. Additionally, network bandwidth must be increased steadily to handle requests to and from successful Internet serve...

T he limitations of client-serverbased systems become evident in an Internet-scale distributed environment. Resources are concentrated on a small number of nodes, which must apply sophisticated load-balancing and fault-tolerance algorithms to provide continuous and reliable access. Additionally, network bandwidth must be increased steadily to handle requests to and from successful Internet serv...

In this paper, the topology dynamic of Gnutella is studied through phase space. The dynamic changes in peer degree are studied as a time series in two dimensional phase space which is defined as the number of connected leaves and the number of connected ultras. The reported degrees are concentrated in three special Software related regions that we named as Ultra Stable Region, Leaf Stable Regio...

In this paper, we address the problem of designing a scalable, accurate query processor for peerto-peer filesharing and similar distributed keyword search systems. Using a globally-distributed monitoring infrastructure, we perform an extensive study of the Gnutella filesharing network, characterizing its topology, data and query workloads. We observe that Gnutella’s query processing approach pe...