Back to Results
First PageMeta Content
Distributed hash table / Pastry / Tapestry / Peer-to-peer / Gossip protocol / Gnutella / AVL tree / Replication / Trie / Distributed data storage / Computing / Chord


Kelips∗: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead Indranil Gupta, Ken Birman, Prakash Linga, Al Demers, Robbert van Renesse Cornell University, Ithaca, NY, USA {gupta, k
Add to Reading List

Document Date: 2003-02-10 13:10:45

Open Document

File Size: 214,55 KB

Share Result on Facebook

City

Selangor / Fasttrack / /

Company

Hafner Press / Node 110 Affinity Group View Affinity Group / Intel Corporation / Microsoft / /

Country

Malaysia / /

/

Facility

Robbert van Renesse Cornell University / Stable P2P DHT Through Increased Memory / AFRL-IFGA Information Assurance Institute / /

IndustryTerm

maximum processing time / file sharing systems / lightweight unreliable protocol / normal case lookup processing time / multicast protocol / Internet Traffic Archive / affinity groups / affinity / epidemic style dissemination protocols / p2p systems / /

Organization

AFRL-IFGA Information Assurance Institute / Cornell University / /

Person

Ken Birman / /

/

Product

Kelips / /

ProvinceOrState

Manitoba / /

PublishedMedium

Theory of Computing / /

Technology

Epidemic protocol / load balancing / peer-to-peer / 3 Auxiliary Protocols / lightweight unreliable protocol / Joining protocol / P2P / file sharing / http / epidemic style dissemination protocols / UDP / lightweight Epidemic multicast protocol / /

URL

http /

SocialTag