Sciweavers

456 search results - page 34 / 92
» On Routing in Distributed Hash Tables
Sort
View
ESCIENCE
2007
IEEE
14 years 4 months ago
Decentralised Resource Discovery Service for Large Scale Federated Grids
Efficient Resource discovery mechanism is one of the fundamental requirement for Grid computing systems, as it aids in resource management and scheduling of applications. Resourc...
Rajiv Ranjan, Lipo Chan, Aaron Harwood, Shanika Ka...
ICDE
2005
IEEE
146views Database» more  ICDE 2005»
14 years 3 months ago
Best Effort Query Processing in DHT-based P2P Systems
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...
Philipp Rösch, Kai-Uwe Sattler, Christian von...
GCC
2004
Springer
14 years 3 months ago
Gemini: Probabilistic Routing Algorithm in Structured P2P Overlay
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
Ming Li, Jinfeng Hu, Haitao Dong, Dongsheng Wang, ...
IPTPS
2003
Springer
14 years 3 months ago
On the Feasibility of Peer-to-Peer Web Indexing and Search
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, ...
INFOCOM
2005
IEEE
14 years 3 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu