| Document Date: 2005-09-01 19:45:26
Open Document File Size: 494,42 KBShare Result on Facebook
City Seattle / Trie / / Company SUM / US West / MIN / PHT / lonMin / MAX / / Country United States / United Kingdom / / Currency pence / / Facility building Place Lab / Building Layered DHT Applications Paper / / IndustryTerm range-search structure / Internet-scale applications / decentralized infrastructure / large-scale distributed applications / rendezvous systems / online balancing work / binary search lookup algorithm / Client devices / large-scale applications / parallel search / binary search / range search / query algorithm / deterministic mapping server / location-enhanced applications / search starts / recent peer-to-peer systems / community web service / search query / average query processing time / binary search tree / consensus protocol / binary search algorithm / / MarketIndex SET 100 / / NaturalFeature Etna / East Coast / / Organization DHT / Place Lab / Overview Place Lab / Given Place Lab / / Person Scribe / / Position war driver / administrator / General / / Product OpenDHT ReDiR / DHTs / / ProgrammingLanguage Java / / Region US West Coast / US East Coast / / Technology consensus protocol / load balancing / DNS / Java / relational database / peer-to-peer / DHT hashing algorithm / routing algorithms / API / GPS / MAC address / P2P / binary search lookup algorithm / cell phones / caching / GSM / binary search algorithm / query algorithm / / URL www.wigle.net / /
SocialTag |
A Case Study in Building Layered DHT Applications Paper #318 Abstract Recent research has convincingly demonstrated that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. On