Back to Results
First PageMeta Content
Distributed hash table / Kademlia / Chord / Tapestry / Routing / Peer-to-peer / Pastry / Tulip Overlay / Distributed data storage / Computing / Network architecture


A performance vs. cost framework for evaluating DHT design tradeoffs under churn Jinyang Li, Jeremy Stribling, Robert Morris, M. Frans Kaashoek and Thomer M. Gil {jinyang, strib, rtm, kaashoek, thomer}@csail.mit.edu MIT
Add to Reading List

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


Open Document

File Size: 193,99 KB

Share Result on Facebook

/

IndustryTerm

non-transitive network / static networks / connected and non-transitive networks / self-tuning protocol / stabilization protocols / oracle algorithm / 3000node network / nontransitive network / nearest neighbor algorithm / 3000node networks / static network / lookup protocol / exhaustive search / lookup protocols / low-churn systems / lookup algorithm / symmetric protocol / /

Organization

MIT / /

Person

Jeremy Stribling / Thomer M. Gil / Jinyang Li / Robert Morris / M. Frans Kaashoek / /

/

Position

slice leader / King / evaluator / unit leader / protocol designer / /

Technology

five existing protocols / oracle algorithm / underlying algorithm / self-tuning protocol / stabilization protocols / DNS / artificial intelligence / DHT protocol / symmetric protocol / peer-to-peer / DHT protocols / nearest neighbor algorithm / Chord lookup protocol / two protocols / simulation / evaluating lookup protocols / DHT lookup protocol / Chord lookup algorithm / /

SocialTag