Free riding on Gnutella revisited: the bell tolls?

Hughes, Danny; Coulson, G.; Walkerdine, J.

doi:10.1109/mdso.2005.31

Cited by 312 publications

(196 citation statements)

References 10 publications

Supporting

Mentioning

186

Contrasting

Unclassified

Order By: Relevance

“…After Adar and Huberman's work, there have been other studies observing free riding in P2P networks [9,[37][38][39]. In general, the results indicate an increasing level of free riding.…”

Section: Related Workmentioning

confidence: 87%

See 1 more Smart Citation

Counteracting free riding in Peer-to-Peer networks

2008

View full text Add to dashboard Cite

The existence of a high degree of free riding is a serious threat to Peer-to-Peer (P2P) networks. In this paper, we propose a distributed framework to reduce the adverse effects of free riding on P2P networks. Our solution primarily focuses on locating free riders and taking actions against them. We propose a framework in which each peer monitors its neighbors, decides if they are free riders, and takes appropriate actions. Unlike other proposals against free riding, our framework does not require any permanent identification of peers or security infrastructures for maintaining a global reputation system. Our simulation results show that the framework can reduce the effects of free riding and can therefore increase the performance of a P2P network.

show abstract

“…After Adar and Huberman's work, there have been other studies observing free riding in P2P networks [9,[37][38][39]. In general, the results indicate an increasing level of free riding.…”

Section: Related Workmentioning

confidence: 87%

“…In general, the results indicate an increasing level of free riding. For example, Hughes et al observed that 85% of peers share no files at all [37]. Similarly, Yang et al reported a high level of free riding in the Maze P2P network in spite of the incentive mechanism provided by the system [38].…”

Section: Related Workmentioning

confidence: 99%

Counteracting free riding in Peer-to-Peer networks

2008

View full text Add to dashboard Cite

show abstract

“…We propose two BitTorrent-like mechanisms for distributing the security patches. In file-sharing networks such as Gnutella, a very small fraction (5%) of hosts usually provide a large fraction of the shared files (70%) [14]. Exploiting this asymmetry in file-sharing, we consider first disseminating the security patches to these popular hosts, such that most of the other participating hosts can receive the patches from these popular hosts when they actively download files from them.…”

Section: Contributionmentioning

confidence: 99%

“…In most decentralized systems such as Gnutella and KaZaA, downloading traffic is highly focused around a small minority of popular targets and these popular files tend to be gradually concentrated in a small set of providers. For example, in Gnutella, 50% of all files are served by just 1% of nodes and 98% of all files are shared by the top 20% nodes [14]; in KaZaA, 10% most popular files generate 60% of the download traffic and 70% of the highly popular files will remain popular for at least 10∼15 days [18]. These are strong indications that a small fraction of popular hosts sharing the most interesting files could be conveniently leveraged as the early distributors, which effectively push security patches to active downloaders in the system.…”

Section: Scheme Descriptionmentioning

confidence: 99%

On the Effectiveness of Internal Patching Against File-Sharing Worms

Xie

Song

Zhu

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. File-sharing worms have been terrorizing Peer-to-peer (P2P) systems in recent years. Existing defenses relying on users' individual recoveries or limiting users' file-sharing activities are ineffective. Automated patching tools such as Microsoft Windows Update and Symantec Security Update are currently the most popular vehicles for eliminating and containing Internet worms, but they are not necessarily the best fits for combating P2P file-sharing worms, which propagate within a relatively smaller community. In this paper, we propose a complementary P2P-tailored patching system which utilizes the existing file-sharing mechanisms to internally disseminate security patches to those participating peers in a timely and distributed fashion. Specifically, we examine the effectiveness of leveraging the file downloading or searching process to notify vulnerable end hosts of the surging worms and push corresponding security updates to these hosts. We show through in-depth analysis and extensive experiments that both methods are scalable and effective in combating existing P2P worms.

show abstract

“…The experiments are designed to demonstrate the superiority of the proposed iCluster protocols over (a) a state-of-the-art approach for peer organization and retrieval [5] and (b) exhaustive search by flooding [16].…”

Section: Discussionmentioning

confidence: 99%

iCluster: A Self-organizing Overlay Network for P2P Information Retrieval

Raftopoulou

Petrakis

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present iCluster, a self-organizing peer-to-peer overlay network for supporting full-fledged information retrieval in a dynamic environment. iCluster works by organizing peers sharing common interests into clusters and by exploiting clustering information at query time for achieving low network traffic and high recall. We define the criteria for peer similarity and peer selection, and we present the protocols for organizing the peers into clusters and for searching within the clustered organization of peers. iCluster is evaluated on a realistic peer-to-peer environment using real-world data and queries. The results demonstrate significant performance improvements (in terms of clustering efficiency, communication load and retrieval accuracy) over a state-of-the-art peerto-peer clustering method. Compared to exhaustive search by flooding, iCluster exchanged a small loss in retrieval accuracy for much less message flow.

show abstract

Free riding on Gnutella revisited: the bell tolls?

Cited by 312 publications

References 10 publications

Counteracting free riding in Peer-to-Peer networks

Counteracting free riding in Peer-to-Peer networks

On the Effectiveness of Internal Patching Against File-Sharing Worms

iCluster: A Self-organizing Overlay Network for P2P Information Retrieval

Contact Info

Product

Resources

About