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


Routing Algorithms for DHTs: Some Open Questions Sylvia Ratnasamy () Scott Shenker ()
Add to Reading List

Document Date: 2004-08-20 15:06:14


Open Document

File Size: 62,87 KB

Share Result on Facebook

City

Diego / Boston / San Diego / Newport / Banff / San Jose / /

Company

Gnutella / ContentAddressable Networks / /

Country

Germany / Canada / /

/

Facility

Port Jefferson / University of California at Berkeley / /

IndustryTerm

distributed file systems / Internet Measurement Workshop / large systems / Internet applications / Internet traffic / overlay networks / large-scale peer-topeer systems / et al. algorithm / file sharing systems / content-addressable network / chat services / large-scale event notification infrastructure / Internet-scale facilities / event notification services / hybrid routing algorithms / large distributed systems / overlay network / hybrid algorithms / particular algorithm / search mechanism / /

Movie

A. D. / /

Organization

University of California / Computer Science Department / /

Person

Scott Shenker / Sylvia Ratnasamy / Ion Stoica / /

ProgrammingLanguage

K / /

ProvinceOrState

Rhode Island / M. B. / California / Massachusetts / /

Technology

LAN / Plaxton/Tapestry algorithms / Multimedia Conferencing / peer-to-peer / existing routing algorithms / Routing Algorithms / API / one particular algorithm / P2P / file sharing / hybrid routing algorithms / cloning / caching / DHT algorithms / Plaxton/Tapestry algorithm / Operating Systems / Plaxton et al. algorithm / routing algorithm / /

URL

http /

SocialTag