Sciweavers

346 search results - page 6 / 70
» Routing networks for distributed hash tables
Sort
View
LCN
2008
IEEE
14 years 1 months ago
Range queries and load balancing in a hierarchically structured P2P system
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
Simon Rieche, Bui The Vinh, Klaus Wehrle
KIVS
2005
Springer
14 years 29 days ago
On the Distribution of Nodes in Distributed Hash Tables
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
Heiko Niedermayer, Simon Rieche, Klaus Wehrle, Geo...
IEEEAMS
2003
IEEE
14 years 23 days ago
Rich and Scalable Peer-to-Peer Search with SHARK
SHARK is a novel concept and middleware service for search in peer-to-peer (P2P) networks. Rather than flooding a network like Gnutella or imposing numerical IDs on objects like d...
Jan Mischke, Burkhard Stiller
AICT
2006
IEEE
102views Communications» more  AICT 2006»
13 years 9 months ago
Publishing, Retrieving and Streaming Lectures via Application Level Multicast
Structured peer-to-peer overlay network is an efficient solution for querying and retrieving resources spread between the peers. Unfortunately, key based routing of Distributed Ha...
Marco Milanesio, Giancarlo Ruffo
SAINT
2008
IEEE
14 years 1 months ago
Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
Richard Price, Tien Tuan Anh Dinh, Georgios K. The...