Fault Tolerant Broadcast in Bandwidth-Constrained
Networks
Name
kaklamanis-jkaklam-meng-eecs-2023-thesis.pdf
Description
Thesis PDF
Size
975.57 KB
Format
Adobe PDF
Checksum (MD5)
9d4b3b9cc6d1a83345f2963a9c241418
Author(s)
Kaklamanis, Ioannis
Advisor(s)
Alizadeh, Mohammad
Yang, Lei
Date Issued
June 2023
Publisher
Massachusetts Institute of Technology
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright retained by author(s)
Persistent DSpace Link
