Show simple item record

dc.contributor.advisorF.T. Leighton and David Karger.en_US
dc.contributor.authorLewin, Daniel M. (Daniel Mark), 1970-en_US
dc.date.accessioned2005-08-19T14:27:13Z
dc.date.available2005-08-19T14:27:13Z
dc.date.copyright1998en_US
dc.date.issued1998en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/9947
dc.descriptionThesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.en_US
dc.descriptionIncludes bibliographical references (p. 106-108).en_US
dc.description.statementofresponsibilityby Daniel M. Lewin.en_US
dc.format.extent110 p.en_US
dc.format.extent9178048 bytes
dc.format.extent9177804 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectElectrical Engineering and Computer Scienceen_US
dc.titleConsistent hashing and random trees : algorithms for caching in distributed networksen_US
dc.typeThesisen_US
dc.description.degreeM.S.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc40295142en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record