Sciweavers

343 search results - page 54 / 69
» Weighted distributed hash tables
Sort
View
NSDI
2004
13 years 8 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...
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 7 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
WWW
2004
ACM
14 years 8 months ago
PipeCF: a scalable DHT-based collaborative filtering recommendation system
Collaborative Filtering (CF) technique has proved to be one of the most successful techniques in recommendation systems in recent years. However, traditional centralized CF system...
Bo Xie, Peng Han, Ruimin Shen
PERCOM
2006
ACM
14 years 7 months ago
Performance Analysis of Stealth DHT with Mobile Nodes
The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes co...
Andrew MacQuire, Andrew Brampton, Idris A. Rai, La...
AINA
2008
IEEE
14 years 1 months ago
An Architecture for Mobility Support in a Next-Generation Internet
—The current internetworking architecture presents some limitations to naturally support mobility, security and multihoming. Among the limitations, the IP semantic overload seems...
Walter Wong, Rodolfo Villaca, Luciano Paula, Rafae...