A degree-optimal, ordered peer-to-peer overlay network
Name
67618271-MIT.pdf
Description
Full printable version
Size
5.25 MB
Format
Adobe PDF
Checksum (MD5)
1b65d77857c251eafa09ab8f111710af
Author(s)
Zatloukal, Kevin C. (Kevin Chaffee)
Advisor(s)
David R. Karger.
Date Issued
2005
Publisher
Massachusetts Institute of Technology
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.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (leaves 93-96).
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.
Persistent DSpace Link
