Edith Cohen, Amos Fiat, and Haim Kaplan. A case for associative peer-to-peer overlays. volume 33, January 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Peer-to-Peer Keyword Search Using Keyword Relationship - Nakauchi, Ishikawa.. (2003) (1 citation) (Correct)
....due to query flooding, recently some efforts are made to improve scalability. For example, FastTrack [7] organizes subscribing nodes into loosely hi erarchical structure where some nodes are selected as su pemodes and cache the index. Multiple random walks [8] and associative overlays [9] reduce the number of forwarded queries by limiting searches to a fraction of the population. The other class of the decentralized architectures is a structured P2P system commonly referred to as Distributed Hash Tables (DHTs) 10, 11, 12, 13] where the overlay topology is tightly controlled. The ....
Edith Cohen, Amos Fiat, and Haim Kaplan. A Case for Associative Peer to Peer Overlays. Proc. HotNets- I, Oct. 2002.
Efficient Content Location Using Interest-Based.. - Sripanidkulchai.. (2003) (17 citations) (Correct)
....are effective at finding popular content, whereas interest based shortcuts can find both popular and unpopular content. These proposed improvements to Gnutella can be used along with interest based shortcuts to further improve the performance of Gnutella. More recently, associative overlays [25], also proposed to improve Gnutella s performance, are based on the same principles as interest based locality. Other peer to peer applications, such as Kazaa, can also use interest based locality to improve performance. Although the specifics of Kazaa s protocol is not publicly known, ....
E. Cohen, A. Fiat, and H. Kaplan, "A case for associative peer-to-peer overlays," in Proc. of Workshop on Hot Topics in Networks, 2002.
Efficient Sequences of Trials - Cohen, Fiat, Kaplan (2003) (1 citation) Self-citation (Cohen Fiat Kaplan) (Correct)
No context found.
E. Cohen, A. Fiat, and H. Kaplan. A case for associative peer to peer overlays. In Proceedings of HotNets-I, ACM SIGCOMM, 2002.
Bringing Efficient Advanced Queries to Distributed Hash.. - Bauer, Hurley, Pletka.. (2004) (Correct)
No context found.
Edith Cohen, Amos Fiat, and Haim Kaplan. A case for associative peer-to-peer overlays. volume 33, January 2003.
A New Adaptive, Semantically Clustered Peer-to-Peer.. - Das, Thakur, Bose, Chaki (Correct)
No context found.
E. Cohen, A. Fiat, H. Kaplan, "A case for associative peer to peer overlays", SIGCOMM Comput. Commun. Rev., 33(1), pp:95--100, 2003.
Bringing Efficient Advanced Queries to Distributed Hash.. - Bauer, Hurley, Pletka.. (2004) (Correct)
No context found.
Edith Cohen, Amos Fiat, and Haim Kaplan. A case for associative peer-to-peer overlays. volume 33, January 2003.
Bringing Efficient Advanced Queries to Distributed Hash.. - Bauer, Hurley, Pletka.. (2004) (Correct)
No context found.
Edith Cohen, Amos Fiat, and Haim Kaplan. A case for associative peer-to-peer overlays. volume 33, January 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC