Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Consistent hashing and random trees : algorithms for caching in distributed networks

Consistent hashing and random trees : algorithms for caching in distributed networks

Thumbnail Image
Download
Name

40295142-MIT.pdf

Description
Full printable version
Size

8.75 MB

Format

Adobe PDF

Checksum (MD5)

515b1b520c82a6b373bed6eb39873c6e

Author(s)
Lewin, Daniel Mark.
Advisor(s)
F.T. Leighton and David Karger.
Date Issued
1998
Publisher
Massachusetts Institute of Technology
Description
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (p. 106-108).
Subjects
Electrical Engineering and Computer Science
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.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.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/9947
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.