Back to Results
First PageMeta Content
Distributed hash table / File sharing / Tree / Computer programming / B-tree / Data management / T-tree / Routing / Peer-to-peer / Distributed data storage / Binary trees / Computing


Using Random Subsets to Build Scalable Network Services Dejan Kosti´c, Adolfo Rodriguez, Jeannie Albrecht, Abhijeet Bhirud, and Amin Vahdat Department of Computer Science Duke University  dkostic,razor,albrecht,abhi,va
Add to Reading List

Document Date: 2003-01-24 18:02:42

Open Document

File Size: 151,70 KB

Share Result on Facebook

Company

IBM / Hewlett Packard / Overlay Transformations / SARO / Intel / Microsoft / 2 Probing / CSC / /

/

Event

Product Issues / Product Recall / /

IndustryTerm

streaming media server / media servers / important network services / large-scale network services / node network / location infrastructure / live media / Internet emulation environment / Epidemic algorithms / underlyA ing network / Content distribution networks / target network / distributed systems / important services / building scalable distributed systems / /

OperatingSystem

FreeBSD / Linux / /

Organization

Duke University / Abhijeet Bhirud / and Amin Vahdat Department / National Science Foundation / /

Person

Amin Vahdat / Dejan Kosti / Adolfo Rodriguez / Jeannie Albrecht / Overlay Tree / /

Position

representative / set representative / /

Product

ModelNet / simultaneous moves / Overlay Convergence 4.3 Effects / RanSub / /

ProgrammingLanguage

C / /

Technology

Ethernet / DSD / peer-to-peer / Linux / Peer to peer / RanSub algorithm / streaming media / RanSub protocol / simulation / P2P system / /

SocialTag