Replication strategies in unstructured peer-to-peer networks
By Edith Cohen, Scott Shenker. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2002
842 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Signal Processing
View Paper: https://www.semanticscholar.org/paper/d4f0c9c7b6ef96e949205eaaaf050b372e612e41
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
- John Risson
- Tim Moors
- Adriana Iamnitchi
- Ian T Foster
- Daniel Nurmi
- Zhichen Xu
- Kunwadee Sripanidkulchai
- Hui Zhang
In Signal Processing
Citations in the corpus
- A peer-to-peer approach to resource location in grid environments (2002, background): “A recent result [ CS02 ] shows that, in a static environment, the optimum replication of an item for search in unstructured networks is proportional to the square root of the popularity of that item.”
- Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “Storage Consistency & Replication [101-112] Eventual consistency Trade-offs Distribution [39, 42, 90, 92, 113-131] Epidemics, Bloom Filters Fault Tolerance [40, 105, 132-139] Erasure Coding Byzantine Agreement Locality [24, 43, 47, 140-160] Load Balancing [37, 86, 100, 107, 151, 161-171]”
- Peer-to-peer information retrieval using self-organizing semantic overlay networks (2003, background): “[4, 16] find that setting the number of object replicas to the square root of the searching rate for an object minimizes the expected search size on successful queries.”
- Caching in information centric networking: A survey (2013, background): “This is different from P2P request processing, as there is no fallback in P2P if the search fails.”
- Search and replication in unstructured peer-to-peer networks (2002, background): “(cid:15) Normal Random Graph (Random): a 9836-node random graph generated by a modi(cid:12)ed version of GT-ITM topology generator [5].”
- Efficient content location using interest-based locality in peer-to-peer systems (2003, background): “and random walks [24], where each peer forwards a query message to a randomly chosen neighbor, in place of flooding are also promising at improving Gnutella’s scalability.”