2026-09-19T00:51:36Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/341172022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
David R. Karger.
Zatloukal, Kevin C. (Kevin Chaffee)
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-09-28T15:04:49Z
2006-09-28T15:04:49Z
2005
2005
http://hdl.handle.net/1721.1/34117
67618271
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.
96 leaves
5505095 bytes
5509056 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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
Electrical Engineering and Computer Science.
A degree-optimal, ordered peer-to-peer overlay network
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="1c960260-437e-4dcd-841c-8f3dcbbbb773">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A degree-optimal, ordered peer-to-peer overlay network</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>Zatloukal, Kevin C. (Kevin Chaffee)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>