Consistent hashing and random trees : algorithms for caching in distributed networks
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/9947 |
| _version_ | 1826202659720265728 |
|---|---|
| author | Lewin, Daniel Mark. |
| author2 | F.T. Leighton and David Karger. |
| author_facet | F.T. Leighton and David Karger. Lewin, Daniel Mark. |
| author_sort | Lewin, Daniel Mark. |
| collection | MIT |
| description | Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998. |
| first_indexed | 2024-09-23T12:12:03Z |
| format | Thesis |
| id | mit-1721.1/9947 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T12:12:03Z |
| publishDate | 2005 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/99472021-10-19T12:55:11Z Consistent hashing and random trees : algorithms for caching in distributed networks Lewin, Daniel Mark. F.T. Leighton and David Karger. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Electrical Engineering and Computer Science Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998. Includes bibliographical references (p. 106-108). by Daniel M. Lewin. M.S. 2005-08-19T14:27:13Z 2005-08-19T14:27:13Z 1998 1998 Thesis http://hdl.handle.net/1721.1/9947 40295142 eng 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 110 p. 9178048 bytes 9177804 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science Lewin, Daniel Mark. Consistent hashing and random trees : algorithms for caching in distributed networks |
| title | Consistent hashing and random trees : algorithms for caching in distributed networks |
| title_full | Consistent hashing and random trees : algorithms for caching in distributed networks |
| title_fullStr | Consistent hashing and random trees : algorithms for caching in distributed networks |
| title_full_unstemmed | Consistent hashing and random trees : algorithms for caching in distributed networks |
| title_short | Consistent hashing and random trees : algorithms for caching in distributed networks |
| title_sort | consistent hashing and random trees algorithms for caching in distributed networks |
| topic | Electrical Engineering and Computer Science |
| url | http://hdl.handle.net/1721.1/9947 |
| work_keys_str_mv | AT lewindanielmark consistenthashingandrandomtreesalgorithmsforcachingindistributednetworks |