Sciweavers

346 search results - page 32 / 70
» Routing networks for distributed hash tables
Sort
View
USITS
2003
13 years 9 months ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
SPAA
2005
ACM
14 years 1 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
ICDCS
2008
IEEE
14 years 2 months ago
Routing of XML and XPath Queries in Data Dissemination Networks
XML-based data dissemination networks are rapidly gaining momentum. In these networks XML content is routed from data producers to data consumers throughout an overlay network of ...
Guoli Li, Shuang Hou, Hans-Arno Jacobsen
SPAA
2006
ACM
14 years 1 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
KIVS
2005
Springer
14 years 1 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...