Search and replication in unstructured peer-to-peer networks

DMCA

Search and replication in unstructured peer-to-peer networks (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Qin Lv , Pei Cao , Edith Cohen , Kai Li , Scott Shenker

Citations:

690 - 6 self

BibTeX

@INPROCEEDINGS{Lv02searchand,
    author = {Qin Lv and Pei Cao and Edith Cohen and Kai Li and Scott Shenker},
    title = {Search and replication in unstructured peer-to-peer networks},
    booktitle = {},
    year = {2002},
    pages = {84--95},
    publisher = {ACM Press}
}

OpenURL

Abstract

Abstract Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the flooding-based query algorithm used in Gnutella does not scale; each individual query gener-ates a large amount of traffic and, as it grows, the system quickly becomes overwhelmed with the query-induced load. This paper explores, through simulation, various alternatives to gnutella's query algorithm, data replicationmethod, and network topology. We propose a query algorithm based on multiple random walks that resolves queries almost as quickly as gnutella's flooding method while reducing the network traffic by two orders of mag-nitude in many cases. We also present a distributed replication strategy that yields close-to-optimal performance. Finally, we find that among the various network topologies we consider, uniform random graphs yield the bestperformance. 1 Introduction The computer science community has become accustomed to the Internet's continuing rapid growth, but even tosuch jaded observers the explosive increase in Peer-to-Peer (P2P) network usage has been astounding. Within a few months of Napster's [12] introduction in 1999 the system had spread widely, and recent measurement data suggeststhat P2P applications are having a very significant and rapidly growing impact on Internet traffic [11, 15]. Therefore, it is important to study the performance and scalability of these P2P networks. Currently, there are several different architectures for P2P networks:

Keyphrases

unstructured peer-to-peer network p2p network query algorithm network topology recent measurement data distributed replication strategy centralized directory abstract decentralized flooding-based query algorithm individual query uniform random graph yield network traffic p2p application internet traffic many case query-induced load multiple random walk explosive increase precise control various network topology several different architecture various alternative network usage computer science community data replicationmethod rapid growth close-to-optimal performance large amount data placement

DMCA