Trace Driven Analysis of the Long Term Evolution of Gnutella Peer-to-Peer Traffic

Acosta, William; Chandra, Surendar

doi:10.1007/978-3-540-71617-4_5

Cited by 19 publications

(18 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The ultrapeer also computes the Qgrams for each file term for the Spell component. In our earlier work [2], we showed that the success rate at the ultrapeer was low; about 6.9% of the forwarded queries yielded any query responses. Hence, we transform all incoming queries and issue them simultaneously as the original query in the Gnutella network.…”

Section: Query Transformation Middlewarementioning

confidence: 83%

See 1 more Smart Citation

Implications of the file names and user requested queries on Gnutella performance

Chandra

Acosta

2011

Peer-to-Peer Netw. Appl.

Self Cite

View full text Add to dashboard Cite

The Gnutella file sharing system allows a large number of peers to share their local files. However, it does not coordinate the way by which these shared objects are named or how they are searched by other users; such decisions are made independently by each peer. In this work, we investigate the practical performance implications of this design. We collected the shared filenames and user generated queries over a three-year period. We show the mismatch between these naming mechanisms. We show the fundamental limitations of Gnutella performance that cannot be addressed by improvements in overlays or by varying the search mechanisms alone. Based on our observations, we describe two practical approaches to improve Gnutella performance. We describe a mechanism to build the file term synopsis using the observed popularity of queries routed through the ultrapeer. We also describe a query transformation mechanism that improves the success rates for failed queries.

show abstract

Section: Query Transformation Middlewarementioning

confidence: 83%

“…Earlier [2], we analyzed the queries and responses that were routed through a monitoring client in order to quantify query success rates. We showed that between 2003 and 2006, the query success rate at a forwarding peer increased from 3.5% to 6.9%.…”

Section: Query Success Ratementioning

confidence: 99%

Implications of the file names and user requested queries on Gnutella performance

Chandra

Acosta

2011

Peer-to-Peer Netw. Appl.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The ultrapeer also computes the Qgrams for each file term for the Spell component. In our earlier work [3], we showed that the success rate at the ultrapeer was low; about 6.9% of the forwarded queries yielded any query response messages. Hence, we transform all incoming queries and issue them simultaneously as the original query in the Gnutella network.…”

Section: Query Transformation Middlewarementioning

confidence: 83%

Section: Abstract-unstructured Peer-to-peer Query Transformationmentioning

confidence: 99%

“…INTRODUCTION Gnutella is popular and accounted for over 40% of all P2P users [1]. However, its search performance [2] remains poor; between 2003 and 2006, the query success rate at a forwarding peer only increased from 3.5% to 6.9% [3].In general, the performance of unstructured P2P systems depend on the network topology, search mechanisms that route queries over the overlay, annotations of shared objects as well as in the way that users request objects. A large body of prior research efforts (including [4], [5], [6]) investigated various overlay maintenance and search mechanisms that reduced the network overhead for finding shared objects.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Using query transformation to improve Gnutella search performance

Chandra¹,

Acosta²

2010

2010 IEEE International Symposium on Parallel &Amp; Distributed Processing, Workshops and PHD Forum (IPDPSW)

Self Cite

View full text Add to dashboard Cite

Abstract-Gnutella peers independently choose the way in which objects are named as well as queried. Using a long term analysis of the files shared and queries issued, we show that this flexibility leads to a mismatch between the way that objects were named and the way that users were issuing search queries. Thirty percent of the failed queries contained keywords that were not present in any file name while the remaining queries failed because no file name contained all the keywords in a particular query. Our earlier analysis of files shared in the popular iTunes music file sharing system showed that standardizing the file names to make them easier to search is not a viable alternative. Instead, we transform the queries to better match the objects available in the system. We investigated spell correction (using file name information from the neighborhood) as well as remove query keywords. We consider the results from the transformed query to be relevant to the intent of the original query if the transformed query used many of the original keywords and the number of matching files closely matched the number of matches for typical successful queries. Our approach is practical and uses information available within the immediate neighborhood of an ultra-peer. An overlay agnostic analysis shows that our transformation improves success rates from 45% to between 72.5% and 91.2%. Using our Hybrid mechanism as a Gnutella middleware, our transformation produced relevant results for about 61% of the failed queries. Keywords-unstructured peer-to-peer, query transformationI. INTRODUCTION Gnutella is popular and accounted for over 40% of all P2P users [1]. However, its search performance [2] remains poor; between 2003 and 2006, the query success rate at a forwarding peer only increased from 3.5% to 6.9% [3].In general, the performance of unstructured P2P systems depend on the network topology, search mechanisms that route queries over the overlay, annotations of shared objects as well as in the way that users request objects. A large body of prior research efforts (including [4], [5], [6]) investigated various overlay maintenance and search mechanisms that reduced the network overhead for finding shared objects.Earlier [7], we investigated the object annotations and user generated queries on the Gnutella network. Note that objects in Gnutella were independently annotated by the content provider without any global coordination. We showed that over 44% of the queries had no matching objects regardless of the overlay or search mechanism used to locate the objects. In this paper, we focus on these failed queries.Gnutella [8] requires a match of all query terms against terms in the particular file name. We show that 30% of the

show abstract

Identifying peer‐to‐peer communities in the network by connection graph analysis

Jusko

Řehák

2014

Int J Network Mgmt

View full text Add to dashboard Cite

SUMMARYIn this paper we present a unified solution to identify peer-to-peer (P2P) communities operating in the network. We propose an algorithm that is able to progressively discover nodes cooperating in a P2P network and to identify that P2P network. Starting from a single known node, we can easily identify other nodes in the P2P network, through the analysis of widely available and standardized IPFIX (NetFlow) data. Instead of relying on the analysis of content characteristics or packet properties, we monitor connections of known nodes in the network and then progressively discover other nodes through the analysis of their mutual contacts. We show that our method is able to discover cooperating nodes in many P2P networks and present the real computational requirements of the algorithm on a large network. The use of standardized input data allows for easy deployment onto real networks.

show abstract

Trace Driven Analysis of the Long Term Evolution of Gnutella Peer-to-Peer Traffic

Cited by 19 publications

References 4 publications

Implications of the file names and user requested queries on Gnutella performance

Implications of the file names and user requested queries on Gnutella performance

Using query transformation to improve Gnutella search performance

Identifying peer‐to‐peer communities in the network by connection graph analysis

Contact Info

Product

Resources

About