An extensive analysis of user traffic on Gnutella shows a significant amount of free riding in the system. By sampling messages on the Gnutella network over a 24-hour period, we established that 70% of Gnutella users share no files, and 90% of the users answer no queries. Furthermore, we found out that free riding is distributed evenly between domains, so that no one group contributes significa...

Since its inception in early 2000, the Gnutella network has been the subject of numerous topology measurement studies. Although those studies vastly improved our understanding of the network, and of unstructured peer-to-peer networks in general, they did not address the problem of obtaining accurate measurements efficiently. In this paper we discuss how to adapt existing measurement approaches ...

Distributed lookup services have predominantly fallen into one of two categories: Gnutella-based systems and DHTs. In this paper, we identify a set of applications for P2P lookup services, and analyze each of their requirements along a commonlychosen set of dimensions. We show that neither Gnutella nor DHTs may provide the desired tradeoffs among these dimensions. We go on to demonstrate a loca...

Owing to the growing popularity of peer-topeer networks, this paper tries to give a little overview about one of the most popular protocols used in such dynamic environments, the Gnutella protocol. After a short introduction to the protocol internals, the main focus lies on showing the evolution of Gnutella from a decentralized to a hybrid peer-to-peer network protocol thereby focussing the att...

Peer-to-peer systems have emerged as a significant social and technical phenomenon, and they are likely to gain popularity as low-cost individual computing and storage resources become more widely available and network connectivity increases. Unlike traditional distributed systems, P2P networks aggregate large numbers of computers that join and leave the network frequently and that might not ha...

Search algorithms in unstructured P2P networks such as Gnutella use flooding-based techniques for communication and, as a consequence, they produce high message overhead. More dynamic algorithms such as Gnutella’s Dynamic Query Protocol take into account the user’s desired number of results and network topology properties to increase scalability. However, these algorithms only work well for pop...

P2P file-sharing applications are quickly being adopted by a wider and more mainstream audience. There is much to be learned from keyword searches users perform in order to retrieve content from these networks. This paper presents a large-scale measurement study of search terms in the modern Gnutella network. We developed a highly parallelized architecture capable of capturing an unprecedented ...

Gnutella-like peer-to-peer file -sharing systems have been widely deployed on the Internet. However, current search techniques used in existing Gnutella -like peer-to-peer systems are often inefficient. We demonstrated the strong “small-world” property of Gnutella systems and proposed an efficient search approach CSTM to utilize the property. In CSTM, each peer maintains a local state table, wh...

Peer-to-peer (P2P) computing has shown an unexpected growth and development during the recent years. P2P networking is being applied from B2B enterprise solutions to more simple, every-day file-sharing applications like Gnutella clients. In this paper we are investigating the use of the Gnutella P2P protocol for Information Retrieval by means of building and evaluating a general-purpose Web met...