![Distributed hash table / File sharing / Tree / Computer programming / B-tree / Data management / T-tree / Routing / Peer-to-peer / Distributed data storage / Binary trees / Computing Distributed hash table / File sharing / Tree / Computer programming / B-tree / Data management / T-tree / Routing / Peer-to-peer / Distributed data storage / Binary trees / Computing](https://www.pdfsearch.io/img/8cfce340e247e9fa5f08c306e3a5d8f0.jpg) Date: 2003-01-24 18:02:42Distributed 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,vaAdd to Reading ListSource URL: issg.cs.duke.eduDownload Document from Source Website File Size: 151,70 KBShare Document on Facebook
|