[Nrg-l] FW: TALK:Monday 9-12-05 A Distributed Hash Table (Thesis Defense)

Mark Crovella crovella at cs.bu.edu
Wed Sep 7 16:14:15 EDT 2005


 

-----Original Message-----
From: seminars-bounces at lists.csail.mit.edu
[mailto:seminars-bounces at lists.csail.mit.edu] On Behalf Of CSAIL Event
Calendar
Sent: Wednesday, September 07, 2005 4:04 PM
To: seminars at csail.mit.edu
Subject: TALK:Monday 9-12-05 A Distributed Hash Table (Thesis Defense)


Thesis Defense (Frank Dabek)
Speaker: Frank Dabek
Speaker Affiliation: CSAIL

Date: 9-12-2005
Time: 2:30 PM - 3:30 PM
Refreshments: 2:15 PM
Location: 32D-463 (Star)

Distributed hash tables are a way to organize the storage and network
resources of many Internet hosts to create a single storage system. The
promise of DHTs lies in their potential to create a distributed storage
infrastructure that, in aggregate, is more robust and offers higher
performance than any individual host. Applications access the DHT
through a simple hash-table interface that hides much of the complexity
of building distributed systems from the programmer.
Because DHTs are likely to be deployed on potentially unreliable
volunteer nodes spread around the globe, providing high performance and
reliability is challenging: nodes in the system may join or leave at any
time and latencies between nodes can be large.

DHash is a distributed hash table that stores data reliably and provides
low latency, high throughput access to data.  DHash uses an efficient
distributed lookup service, Chord, to map each block to a node based on
the block's key.  DHash replicates data blocks for availability and
efficiently maintains the desired number of replicas as nodes join and
leave the system.  DHash minimizes the latency of block fetch operations
by routing requests to nearby nodes in the network using a
decentralized, synthetic coordinate system, Vivaldi, that accurately
predicts network latency between hosts. A transport protocol, STP,
allows DHash to efficiently and fairly use network resources while
performing many parallel block downloads.

DHash has proven to be a useful substrate for building a number of
different cooperative applications including a file system for content
distribution, a Usenet replacement, and a cooperative digital research
library.

Relevant URL(S): 
For more information please contact: Frank Dabek, 3-7436, fdabek at mit.edu

_______________________________________________
Seminars mailing list
Seminars at lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/seminars




More information about the Nrg-l mailing list