Sciweavers

29 search results - page 3 / 6
» Incrementally improving lookup latency in distributed hash t...
Sort
View
INFOCOM
2005
IEEE
15 years 3 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...
100
Voted
JNW
2006
120views more  JNW 2006»
14 years 9 months ago
An EMST Based Look-up Protocol for Peer to Peer Networks
-- Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems a...
Tarun Bansal, Pankaj Ghanshani
ERLANG
2003
ACM
15 years 2 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
P2P
2008
IEEE
15 years 3 months ago
Faster Content Access in KAD
Many different Distributed Hash Tables (DHTs) have been designed, but only few have been successfully deployed. The implementation of a DHT needs to deal with practical aspects (e...
Moritz Steiner, Damiano Carra, Ernst W. Biersack
OSDI
2004
ACM
15 years 9 months ago
CoDNS: Improving DNS Performance and Reliability via Cooperative Lookups
The Domain Name System (DNS) is a ubiquitous part of everyday computing, translating human-friendly machine names to numeric IP addresses. Most DNS research has focused on server-...
KyoungSoo Park, Vivek S. Pai, Larry L. Peterson, Z...