Efficient search in peer to peer networks
By Beverly Yang, Hector Garcia-Molina, Venkata Gopal K Addada. 2004
339 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/34aef829d6d1397409bfa67898462701f6ed1d5a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- John Risson
- Vana Kalogeraki
- Guoqiang Zhang
- Tim Moors
- Hector Garcia-Molina
- Kai Li
- Dimitrios Gunopulos
- Arturo Crespo
Citations in the corpus
- A local search mechanism for peer-to-peer networks (2002, methodology): “Typically the user speci.es the name of the .le he/she is looking for and searches for the .le using a brute force mechanism, as we described in the previous section.”
- Search and replication in unstructured peer-to-peer networks (2002, methodology): “Several search techniques for unstructured networks are discussed in [25]: iterative deepening, directed BFS and local indices.”
- PeopleNet: engineering a wireless virtual social network (2005, background): “Another related idea is that of peer-to-peer (P2P) networks in the wired/wireless world [11, 12, 13, 14].”
- 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].”
- Semantic Overlay Networks for P2P Systems (2004, background): “The decision of to which neighbors a query can be forwarded can be done by using local indices [26], routing indices [2], or by simply sending the query to all of neighbors (as Gnutella does).”
- 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].”
- Efficient Peer-to-Peer Keyword Searching (2003, unknown): “Yang and Garcia-Molina suggest techniques to reduce the number of nodes contacted in a Gnutella search while preserving the implementationspecific search semantics and a satisfactory number of responses [20].”