2026-09-19T05:55:07Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1565592024-09-04T03:10:49Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Alizadeh, Mohammad
Yang, Lei
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2024-09-03T21:07:28Z
2024-09-03T21:07:28Z
2024-05
2024-07-10T13:02:23.209Z
https://hdl.handle.net/1721.1/156559
https://orcid.org/0000-0003-3256-4700
Recent interest in decentralized applications calls for distributed systems that replicate their states across a large number of servers communicating over wide-area networks. We propose near-optimal solutions to two fundamental problems in the design and implementation of such systems: consensus and synchronization. First, we propose a universal decomposition of distributed consensus protocols that enables near-optimal throughput and liveness on fluctuating networks. Our key technique is to minimize the amount of communication necessary for participants to safely reach consensus. We design a state-of-the-art information dispersal protocol to achieve that. Second, we propose the first family of efficient rateless error-correcting codes for reconciling set differences. Our codes enable pairs of servers to synchronize system states with near-optimal communication and computation costs. We theoretically analyze these solutions, and implement end-to-end systems to demonstrate strong real-world benefits.
Ph.D.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright retained by author(s)
https://rightsstatements.org/page/InC-EDU/1.0/
Efficient Consensus and Synchronization for Distributed Systems
Thesis
application/pdf
Doctoral
Doctor of Philosophy
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="cb7d05fb-33da-40a9-9099-c24edcfdbb77">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Efficient Consensus and Synchronization for Distributed Systems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2024-05</PublicationDate>
<Authors>
<Author>
<DisplayName>Yang, Lei</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>https://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>Recent interest in decentralized applications calls for distributed systems that replicate their states across a large number of servers communicating over wide-area networks. We propose near-optimal solutions to two fundamental problems in the design and implementation of such systems: consensus and synchronization. First, we propose a universal decomposition of distributed consensus protocols that enables near-optimal throughput and liveness on fluctuating networks. Our key technique is to minimize the amount of communication necessary for participants to safely reach consensus. We design a state-of-the-art information dispersal protocol to achieve that. Second, we propose the first family of efficient rateless error-correcting codes for reconciling set differences. Our codes enable pairs of servers to synchronize system states with near-optimal communication and computation costs. We theoretically analyze these solutions, and implement end-to-end systems to demonstrate strong real-world benefits.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>