Sciweavers

456 search results - page 43 / 92
» On Routing in Distributed Hash Tables
Sort
View
SPAA
2006
ACM
14 years 5 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
WWW
2008
ACM
14 years 11 months ago
Xml data dissemination using automata on top of structured overlay networks
We present a novel approach for filtering XML documents using nondeterministic finite automata and distributed hash tables. Our approach differs architecturally from recent propos...
Iris Miliaraki, Zoi Kaoudi, Manolis Koubarakis
SPAA
2003
ACM
14 years 4 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
EJWCN
2010
118views more  EJWCN 2010»
13 years 5 months ago
Field Division Routing
Multi-hop communication objectives and constraints impose a set of challenging requirements that create difficult conditions for simultaneous optimization of features such as scala...
Milenko Drinic, Darko Kirovski, Lin Yuan, Gang Qu,...
KIVS
2005
Springer
14 years 4 months ago
Making Chord go mobile
: The Chord protocol is a structured Peer-to-Peer (P2P) protocol based on distributed hash tables (DHT). By using hash keys to identify the nodes in the network and also the shared...
Stefan Zöls, Rüdiger Schollmeier, Wolfga...