Sciweavers

Share
7 search results - page 1 / 2
» Analytical Study on Improving DHT Lookup Performance under C...
Sort
View
INFOCOM
2005
IEEE
9 years 5 months ago
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
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...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Fr...
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
9 years 5 months ago
Incrementally improving lookup latency in distributed hash table systems
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 ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
CORR
2007
Springer
134views Education» more  CORR 2007»
8 years 12 months ago
An Analytical Study of a Structured Overlay in the presence of Dynamic Membership
— In this paper, we present a complete analytical study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a master-equation-based approach, which is u...
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurel...
IPTPS
2005
Springer
9 years 5 months ago
A Statistical Theory of Chord Under Churn
Most earlier studies of DHTs under churn have either depended on simulations as the primary investigation tool, or on establishing bounds for DHTs to function. In this paper, we pr...
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurel...
books