Back to Results
First PageMeta Content
Distributed hash table / Routing / Tapestry / Pastry / Kademlia / Chord / Geographic routing / Network topology / Koorde / Distributed data storage / Computing / Network architecture


The Impact of DHT Routing Geometry on Resilience and Proximity K. Gummadi∗, R. Gummadi†, S. Gribble‡, S. Ratnasamy§, S. Shenker¶, I. Stoicak, ∗
Add to Reading List

Document Date: 2003-10-10 15:30:26


Open Document

File Size: 410,90 KB

Share Result on Facebook

City

Los Angeles / /

Company

DHTs / Intel / /

Country

Germany / /

Currency

USD / /

/

Facility

University of Washington / /

IndustryTerm

satellite links / large-scale distributed applications / much faster recovery algorithms / Internet topology / Internet graph / faster recovery algorithms / active recovery algorithms / butterfly networks / large scale distributed systems / power-law degree-based generators / butterfly network / node network / turn-key systems / recovery algorithm / Internet topology model / basic routing algorithms / Internet latency distribution / insight across algorithms / recovery algorithms / closest server / Internet latency / /

Organization

University of Washington / Computer Systems Organisation / National Science Foundation / UC Berkeley / /

Person

Hypercube Hybrid / /

Position

Computer Communication Networks General / /

ProvinceOrState

Virginia / /

Technology

basic routing algorithms / much faster recovery algorithms / randomized algorithm / Hybrid algorithm / PNS algorithm / load balancing / PRS algorithms / routing algorithms / PRS In DHT algorithms / recovery algorithms / P2P / proposed algorithms / caching / GEOMETRIES AND ALGORITHMS / simulation / Tree algorithm / recovery algorithm / Ring algorithms / 3.3 Butterfly The Viceroy algorithm / active recovery algorithms / 2.3 Algorithms / routing algorithm / two algorithms / /

SocialTag