Sciweavers

343 search results - page 28 / 69
» Weighted distributed hash tables
Sort
View
101
Voted
SIGCOMM
2004
ACM
15 years 6 months ago
A layered naming architecture for the internet
Currently the Internet has only one level of name resolution, DNS, which converts user-level domain names into IP addresses. In this paper we borrow liberally from the literature ...
Hari Balakrishnan, Karthik Lakshminarayanan, Sylvi...
105
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
Landmark-Based Information Storage and Retrieval in Sensor Networks
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
Qing Fang, Jie Gao, Leonidas J. Guibas
110
Voted
INFOSCALE
2006
ACM
15 years 6 months ago
Adaptive content management in structured P2P communities
A fundamental paradigm in P2P is that of a large community of intermittently-connected nodes that cooperate to share files. Because nodes are intermittently connected, the P2P co...
Jussi Kangasharju, Keith W. Ross, David A. Turner
88
Voted
WISE
2002
Springer
15 years 5 months ago
A Content-Based Resource Location Mechanism in PeerIS
With the flurry of research on P2P computing, many P2P technical challenges have emerged, one of which is how to efficiently locate desired resources. Advances have been made in...
Bo Ling, Zhiguo Lu, Wee Siong Ng, Beng Chin Ooi, K...
102
Voted
CN
2010
136views more  CN 2010»
15 years 23 days ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl