{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/156559"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/156559","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Efficient Consensus and Synchronization for Distributed Systems","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_html":"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_has_math":false,"creators":["Yang, Lei"],"institution":"Massachusetts Institute of Technology","degree_name":"Doctoral","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Alizadeh, Mohammad"],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-05","date_published":"2024-05","updated_at":"2026-07-22T22:22:10Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"rights_urls":["https://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/156559","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Alizadeh, Mohammad"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Yang, Lei"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2024-09-03T21:07:28Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2024-09-03T21:07:28Z"]},{"key":"dc:date.issued","label":"Date","values":["2024-05"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctoral","Doctor of Philosophy"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/156559"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:title","label":"Title","values":["Efficient Consensus and Synchronization for Distributed Systems"]}]}],"canonical_facts":{"dc:contributor.advisor":["Alizadeh, Mohammad"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Yang, Lei"],"dc:date.accessioned":["2024-09-03T21:07:28Z"],"dc:date.available":["2024-09-03T21:07:28Z"],"dc:date.issued":["2024-05"],"dc:description.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."],"dc:description.degree":["Ph.D."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/156559"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"dc:rights.uri":["https://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Efficient Consensus and Synchronization for Distributed Systems"],"dc:type":["Thesis"],"thesis:degree_name":["Doctoral","Doctor of Philosophy"]},"updated_at":"2026-07-22T22:22:10Z"}