Search and replication in unstructured peer-to-peer networks

By Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker. International Conference on Supercomputing, 2002

2,086 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/9a8661ad9dcf12430bc5e9600853cb3b3fe50564

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Peer to Peer Multidimensional Overlays: Approximating Complex Structures (2007, background): “Such networks rely on constrained flooding techniques to search for data [21].”
P-Grid: a self-organizing structured P2P system (2003, methodology): “The network maintenance protocol implements a self-organization process changing the system state, i.e., the overlay network s structure, whereas the search protocol implements a distributed algorithm in the overlay network.”
The ACQUIRE mechanism for efficient querying in sensor networks (2003, background): “In particular, [17] discusses the possibility of launching k-random walks through the unstructured P2P network for discovering required files/data.”
' s personal copy T-MAN : Gossip-based fast overlay topology construction q (2009, background): “Similarly, decentralized search applications benefit from special overlay network structures such as random or scale-free graphs[3] [4], super-peer networks [5], networks that are organized based on proximity and/or capacity of the nodes [6] [7], or distributed hash tables (DHT-s), for example, [8]…”
Random walks and diffusion on networks (2016, methodology): “One context in which this idea has been investigated and implemented are decentralized peer-to-peer networks [273,274].”
A Taxonomy of Botnet Structures (2007, background): “Large numbers of connections on a client host are highly unusual, even for P2P software [33, 49].”
A peer-to-peer approach to resource location in grid environments (2002, background): “Lee and Benford [ LB98 ] propose a resource discovery mechanism based on request propagation: nodes (called traders) forward unsolved requests to other nodes in an unstructured overlay.”
Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “One paper reported, perhaps a little too bluntly, that the fixed ''TTL-based mechanism does not work'' [67] To address this TTL selection problem , they proposed an expanding ring, known elsewhere as iterative deepening [29].”
Peer-to-peer information retrieval using self-organizing semantic overlay networks (2003, background): “[16] study search and replication strategies in unstructured P2P networks.”
Adaptive probabilistic search for peer-to-peer networks (2003, methodology): “In the Random Walks method [9], the requesting node sends out k query messages to an equal number of randomly chosen neighbors.”
Caching in information centric networking: A survey (2013, background): “This approach has received extensive research in the distributed cache and P2P cache systems [48,58,13,40,64], but has only recently received attention in the ICN field [67,37].”