377 search results - page 2 / 76 » Designing a DHT for Low Latency and High Throughput |
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
SIGMETRICS
2003
ACM
13 years 10 months ago
2003
ACM
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
ISCC
2006
IEEE
13 years 10 months ago
2006
IEEE
Most research on Distributed Hash Tables (DHTs) assumes ephemeral, lightly loaded deployments. Each node has a lifetime of a few hours and initiates a lookup once every few second...
ASYNC
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper presents several new asynchronous FIFO designs. While most existing FIFO’s trade higher throughput for higher latency, our goal is to achieve very low latency while m...
MM
1997
ACM
13 years 9 months ago
1997
ACM
Interactive multimediaapplicationsrequire fast response time. Traditional disk scheduling schemes can incur high latencies, and caching data in memory to reduce latency is usually...