2026-09-19T12:18:37Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1516302023-08-01T03:28:36Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Alizadeh, Mohammad
Yang, Lei
Kaklamanis, Ioannis
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2023-07-31T19:54:21Z
2023-07-31T19:54:21Z
2023-06
2023-06-06T16:34:40.856Z
https://hdl.handle.net/1721.1/151630
This thesis addresses the problem of achieving scalable fault-tolerant broadcast in networks with limited bandwidth. We begin by examining the limitations of leaderbased protocols, such as HotStuff, which suffer from a leader bottleneck and reduced system throughput as the number of servers increases. To mitigate this, we propose CodedBcaster and Coded HotStuff, a Byzantine Fault Tolerant (BFT) broadcast scheme based on erasure coding, demonstrating a significant improvement in throughput. We further explore the problem of optimal rate allocation in heterogeneous node-constrained networks and provide concrete theoretical results for determining the optimal system throughput rate. Additionally, we propose the MaxMin Rate Controller (MaxMin-RC) protocol as a feedback-based solution to optimize broadcast throughput in non-BFT settings, achieving close alignment with the optimal throughput rate. Through extensive simulations and evaluations, we demonstrate the effectiveness of our proposed solutions.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright retained by author(s)
https://rightsstatements.org/page/InC-EDU/1.0/
Fault Tolerant Broadcast in Bandwidth-Constrained
Networks
Thesis
application/pdf
Master
Master of Engineering in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="aa500fc0-b20c-4ed0-8df1-8b066ebe8f44">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Fault Tolerant Broadcast in Bandwidth-Constrained
Networks</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2023-06</PublicationDate>
<Authors>
<Author>
<DisplayName>Kaklamanis, Ioannis</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>This thesis addresses the problem of achieving scalable fault-tolerant broadcast in networks with limited bandwidth. We begin by examining the limitations of leaderbased protocols, such as HotStuff, which suffer from a leader bottleneck and reduced system throughput as the number of servers increases. To mitigate this, we propose CodedBcaster and Coded HotStuff, a Byzantine Fault Tolerant (BFT) broadcast scheme based on erasure coding, demonstrating a significant improvement in throughput. We further explore the problem of optimal rate allocation in heterogeneous node-constrained networks and provide concrete theoretical results for determining the optimal system throughput rate. Additionally, we propose the MaxMin Rate Controller (MaxMin-RC) protocol as a feedback-based solution to optimize broadcast throughput in non-BFT settings, achieving close alignment with the optimal throughput rate. Through extensive simulations and evaluations, we demonstrate the effectiveness of our proposed solutions.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>