Sciweavers

456 search results - page 28 / 92
» On Routing in Distributed Hash Tables
Sort
View
IPTPS
2004
Springer
14 years 3 months ago
When Multi-hop Peer-to-Peer Lookup Matters
Distributed hash tables have been around for a long time [5, 7]. A number of recent projects propose peerto-peer DHTs, based on multi-hop lookup optimizations. Some of these syste...
Rodrigo Rodrigues, Charles Blake
DATE
2007
IEEE
107views Hardware» more  DATE 2007»
14 years 4 months ago
Routing table minimization for irregular mesh NoCs
The majority of current Network on Chip (NoC) architectures employ mesh topology and use simple static routing, to reduce power and area. However, regular mesh topology is unreali...
Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam...
NSDI
2004
13 years 11 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
IPSN
2010
Springer
14 years 4 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
ICDCSW
2006
IEEE
14 years 3 months ago
Reducing Latency in Rendezvous-Based Publish-Subscribe Systems for Wireless Ad Hoc Networks
To ensure decoupling between publishers and subscribers, most publish-subscribe systems route notifications through intermediate message brokers. A byproduct of this practice is ...
Nuno Carvalho, Filipe Araújo, Luís R...