Back to Results
First PageMeta Content
Tapestry / Chord / Kademlia / Pastry / PlanetLab / Routing / Latency / Low latency / Peer-to-peer / Distributed data storage / Computing / Distributed hash table


Designing a DHT for low latency and high throughput Frank Dabek, Jinyang Li, Emil Sit, James Robertson, M. Frans Kaashoek, Robert Morris ∗ MIT Computer Science and Artificial Intelligence Laboratory fdabek, jinyang, si
Add to Reading List

Document Date: 2015-04-29 10:31:16


Open Document

File Size: 237,75 KB

Share Result on Facebook

Company

Artificial Intelligence Laboratory / /

Country

United States / /

/

IndustryTerm

Internet access / data more vulnerable to network / overSome applications / bandwidth product / Internet access link / evaluation infrastructure / highchurn networks / bandwidth-delay product / cost global communication infrastructure / failure recovery algorithms / naive algorithm / constant-hop protocols / storage infrastructure / eral systems / performance applications / node network / client applications / Internet measurements using techniques / transport protocol / read-heavy applications / exhaustive search / Internet latency / churn networks / lookup algorithm / content publishing systems / synthetic coordinate systems / /

Organization

Sevdata / MIT / RPCs / /

Person

James Robertson / Emil Sit / Frank Dabek / Robert Morris / /

/

Position

King data set / King / representative / forward / /

Product

PlanetLab / /

Technology

cable modem / failure recovery algorithms / DNS / peer-to-peer / API / transport protocol / DHash++ lookup algorithm / naive algorithm / Vivaldi algorithm / Caching / lookup algorithm / simulation / UDP / Kademlia algorithms / DHT lookup algorithm / IDA coding algorithm / DSL / base Chord lookup algorithm / Chord lookup algorithm / constant-hop protocols / /

URL

http /

SocialTag