Sciweavers

52 search results - page 9 / 11
» Indexing Data-oriented Overlay Networks
Sort
View
INFOCOM
2008
IEEE
14 years 1 days ago
Maximizing Resilient Throughput in Peer-to-Peer Network: A Generalized Flow Approach
—A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to ...
Bin Chang, Yi Cui, Yuan Xue
IDEAS
2003
IEEE
131views Database» more  IDEAS 2003»
13 years 11 months ago
Neighborhood Signatures for Searching P2P Networks
Overlay networks have received a lot of attention due to the recent wide-spread use of peer-to-peer (P2P) applications such as SETI, Napster, Gnutella, and Morpheus. Through repli...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
INFOCOM
2003
IEEE
13 years 11 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
14 years 7 months ago
Clustering wavelets to speed-up data dissemination in structured P2P MANETs
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...
Mihai Lupu, Jianzhong Li, Beng Chin Ooi, Shengfei ...
GIR
2006
ACM
13 years 11 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai