&lt;title&gt;Availability and locality measurements of peer-to-peer file systems&lt;/title&gt;

Chu, Jacky; Labonte, Kevin; Levine, Brian Neil

doi:10.1117/12.475282

Cited by 191 publications

(174 citation statements)

References 7 publications

Supporting

Mentioning

165

Contrasting

Unclassified

Order By: Relevance

“…We measured peer availability for over three months, which is significantly longer than reported in [2], [4], and [14].…”

Section: Availabilitymentioning

confidence: 99%

“…For other P2P systems than BitTorrent, several measurement studies of P2P networks have addressed the issues of availability [2,4,6], integrity [10], flashcrowds [5,9], and download performance [1,15,14,3,4]. Most of the availability studies only span a few days [2] or weeks [4], making it difficult to draw conclusions on long-term peer behavior.…”

Section: Related Workmentioning

confidence: 99%

“…Most of the availability studies only span a few days [2] or weeks [4], making it difficult to draw conclusions on long-term peer behavior. The only longterm study is a 200-day trace of the Kazaa traffic on the University of Washington backbone [6], but the wellconnected users with free Internet access in this environment are not average P2P users.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

The Bittorrent P2P File-Sharing System: Measurements and Analysis

Pouwelse

Garbacki

Epema

et al. 2005

Lecture Notes in Computer Science

568

399

View full text Add to dashboard Cite

Of the many P2P file-sharing prototypes in existence, BitTorrent is one of the few that has managed to attract millions of users. BitTorrent relies on other (global) components for file search, employs a moderator system to ensure the integrity of file data, and uses a bartering technique for downloading in order to prevent users from freeriding. In this paper we present a measurement study of BitTorrent in which we focus on four issues, viz. availability, integrity, flashcrowd handling, and download performance. The purpose of this paper is to aid in the understanding of a real P2P system that apparently has the right mechanisms to attract a large user community, to provide measurement data that may be useful in modeling P2P systems, and to identify design issues in such systems.

show abstract

“…We measured peer availability for over three months, which is significantly longer than reported in [2], [4], and [14].…”

Section: Availabilitymentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The Bittorrent P2P File-Sharing System: Measurements and Analysis

Pouwelse

Garbacki

Epema

et al. 2005

Lecture Notes in Computer Science

568

399

View full text Add to dashboard Cite

show abstract

“…Previous work on modelling and analysis of P2P systems [24][25][26][27], has focused on developing a viewpoint based on performance metrics of such overlay systems. Our work differs greatly from these earlier efforts.…”

Section: Relevant Literaturementioning

confidence: 99%

The P2P war: Someone is monitoring your activities

2008

View full text Add to dashboard Cite

In an effort to legally prosecute P2P users, the RIAA and MPAA have reportedly started to create decoy users: they participate in P2P networks in order to identify illegal sharing of content. This has reportedly scared some users who are afraid of being caught and prosecuted. The question we would like to answer is how prevalent is this phenomenon: how likely is it that a user will run into such a ''fake user" and thus run the risk of a lawsuit? The first challenge is identifying these ''fake users". We collect this information from a number of free open-source software projects which are trying to identify such addresses by forming the, so-called, blocklists. The second challenge is to quantify the probability of a user contacting such a fake user by conducting a large scale experiment in order to obtain reliable statistics. Using PlanetLab, we conduct active measurements, spanning a period of 90 days, from January to March 2006, spread over three continents. Analyzing over 100 GB of TCP header data, we quantify the probability of a P2P user contacting fake users. We observe that 100% of our peers run into entities in these lists. In fact, 12-17% of all distinct IPs contacted by any node were listed on blocklists. Interestingly, a little caution can have significant effect: the top five most prevalent blocklisted IP ranges contribute to nearly 94% of all blocklisted IPs we ran into. Avoiding these can reduce the probability of a user being tracked to about 1%. In addition, we examine the identity of these blocklisted IPs. The majority of blocklisted IPs belong to the commercial and government domains and are nearly 2.5 times more than IPs belonging to educational, spyware or adware entities. Interestingly, less than 0.5% of all unique IPs contacted, belong explicitly to media companies. However, this may not be reassuring for P2P users, since the other blocklist users (government or commercial) could be collaborating with media companies.

show abstract

“…A zipfian distribution is used to model both the replication distribution and the query distribution to achieve results similar to the results in [13]: The most popular 10% of documents amount for 50% of the total number of stored documents and account for over 50% of total queries. The documents are classified into 50 different topics, each of which only one cluster is responsible for.…”

Section: Simulationsmentioning

confidence: 99%

Topology-Aware Multi-cluster Architecture Based on Efficient Index Techniques

Zhao

Zhang

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we focus on how to construct an efficient unstructured P2P system. The main contributions of our proposal are two-fold. First, aiming at alleviating the topology mismatch problem between the P2P logical overlay network and the physical underlying network, we proposed a Topology-aware Multi-cluster Overlay (TMO) architecture where peers self-organize into clusters based on network locality. Second, in order to further improve the search efficiency of the TMO architecture, we present two novel index techniques, namely, cluster-index technique and topic-index technique. The two different techniques are highly effective in different application domains in which the TMO architecture is deployed. The simulation results indicate that our proposed schemes are efficient in both resource usage and data retrieval.

show abstract

<title>Availability and locality measurements of peer-to-peer file systems</title>

Cited by 191 publications

References 7 publications

The Bittorrent P2P File-Sharing System: Measurements and Analysis

The Bittorrent P2P File-Sharing System: Measurements and Analysis

The P2P war: Someone is monitoring your activities

Topology-Aware Multi-cluster Architecture Based on Efficient Index Techniques

Contact Info

Product

Resources

About