A degree-optimal, ordered peer-to-peer overlay network
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/34117 |
| _version_ | 1826191363106930688 |
|---|---|
| author | Zatloukal, Kevin C. (Kevin Chaffee) |
| author2 | David R. Karger. |
| author_facet | David R. Karger. Zatloukal, Kevin C. (Kevin Chaffee) |
| author_sort | Zatloukal, Kevin C. (Kevin Chaffee) |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005. |
| first_indexed | 2024-09-23T08:55:03Z |
| format | Thesis |
| id | mit-1721.1/34117 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T08:55:03Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/341172019-04-10T19:42:02Z A degree-optimal, ordered peer-to-peer overlay network Zatloukal, Kevin C. (Kevin Chaffee) David R. Karger. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005. Includes bibliographical references (leaves 93-96). Peer-to-peer overlay networks are structures for organizing nodes, routing traffic, and searching for data in a distributed system. Two of the most important theoretical advancements in this area were the development of degree-optimal and ordered networks. Prior to this work, it was not known whether both properties could be achieved simultaneously. This thesis presents Family Trees, the first peer-to-peer overlay network that is both degree-optimal and ordered. We develop Family Trees theoretically, proving correctness and bounds on their performance. We also describe how Family Trees can be optimized to improve latency and discuss the results of an experimental study showing that Family Trees provide good performance in practice. by Kevin C. Zatloukal. S.M. 2006-09-28T15:04:49Z 2006-09-28T15:04:49Z 2005 2005 Thesis http://hdl.handle.net/1721.1/34117 67618271 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 96 leaves 5505095 bytes 5509056 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Zatloukal, Kevin C. (Kevin Chaffee) A degree-optimal, ordered peer-to-peer overlay network |
| title | A degree-optimal, ordered peer-to-peer overlay network |
| title_full | A degree-optimal, ordered peer-to-peer overlay network |
| title_fullStr | A degree-optimal, ordered peer-to-peer overlay network |
| title_full_unstemmed | A degree-optimal, ordered peer-to-peer overlay network |
| title_short | A degree-optimal, ordered peer-to-peer overlay network |
| title_sort | degree optimal ordered peer to peer overlay network |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/34117 |
| work_keys_str_mv | AT zatloukalkevinckevinchaffee adegreeoptimalorderedpeertopeeroverlaynetwork AT zatloukalkevinckevinchaffee degreeoptimalorderedpeertopeeroverlaynetwork |