Show simple item record

dc.contributor.authorOluwasanmi, Olumuyiwa
dc.date.accessioned2012-02-01T18:28:37Z
dc.date.available2012-02-01T18:28:37Z
dc.date.issued2012-02-01
dc.date.submittedDecember 2011
dc.identifier.urihttp://hdl.handle.net/1928/17495
dc.description.abstractWith the growth of the Internet, there has been a push toward designing reliable algorithms that scale effectively in terms of latency, bandwidth and other computational resources. Scalability has been a serious problem especially with peer-to-peer (p2p) networks which may have sizes of more than a million nodes. An important problem in designing reliable algorithms is Byzantine agreement. For reasons of scalability, message complexity is a critical resource for this problem. Unfortunately, previous solutions to Byzantine agreement require each processor to send $O(n)$ messages, where $n$ is the total number of processors in the network. In this dissertation, we show that the Byzantine agreement problem can be solved with significantly less that a linear number of messages both in theory and in practice. We implement and test algorithms that solve the classical problem with each processor sending only $\tilde{O}(\sqrt{n})$ messages. Further, we consider the problem in the case where we assume the existence of a random beacon: a global source of random bits. We show that with this assumption, the required number of messages drops to $O(\log n)$, with small hidden constants. Our algorithms are Monte Carlo and succeed with high probability, that is probability $1-o(n^k)$ for some positive constant $k$. Our empirical results suggest that our algorithms may outperform classical solutions to Byzantine agreement for network of size larger than 30,000 nodes.en_US
dc.description.sponsorshipNSF, AFOSR MURI Grant.en_US
dc.language.isoen_USen_US
dc.subjectByzantine Agreementen_US
dc.subjectFault-Toleranten_US
dc.subjectFault-Toleranceen_US
dc.subjectRandomized Algorithmen_US
dc.subjectMonte Carloen_US
dc.subjectRandom Beaconen_US
dc.subjectDistributed Algorithmen_US
dc.subjectConsensusen_US
dc.subjectByzantineen_US
dc.subject.lcshComputer networks--Scalability.
dc.subject.lcshFault-tolerant computing.
dc.subject.lcshComputer algorithms.
dc.titlePractical, scalable algorithms for Byzantine agreementen_US
dc.typeDissertationen_US
dc.description.degreeComputer Scienceen_US
dc.description.levelDoctoralen_US
dc.description.departmentUniversity of New Mexico. Dept. of Computer Scienceen_US
dc.description.advisorSaia, Jared
dc.description.committee-memberBridges, Patrick
dc.description.committee-memberMoore, Cristopher
dc.description.committee-memberValerie, King
dc.data.json{ "@context": { "rdf": "http://www.w3.org/1999/02/22-rdf-syntax-ns#", "rdfs": "http://www.w3.org/2000/01/rdf-schema#", "xsd": "http://www.w3.org/2001/XMLSchema#" }, "@graph": [ { "@id": "http://hdl.handle.net/1928/3292", "@type": "http://schema.org/WebSite" }, { "@id": "http://54.191.234.158/entities/resource/Byzantine", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Monte_Carlo", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Oluwasanmi_Olumuyiwa", "@type": "http://schema.org/Person" }, { "@id": "http://54.191.234.158/entities/resource/Distributed_Algorithm", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Computer_networks--Scalability.", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Byzantine_Agreement", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Fault-Tolerance", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Computer_algorithms.", "@type": "http://schema.org/Intangible" }, { "@id": "http://hdl.handle.net/1928/17495", "@type": "http://schema.org/CreativeWork", "http://purl.org/montana-state/library/associatedDepartment": { "@id": "http://54.191.234.158/entities/resource/University_of_New_Mexico.__Dept._of_Computer_Science" }, "http://purl.org/montana-state/library/degreeGrantedForCompletion": "Computer Science", "http://purl.org/montana-state/library/hasEtdCommitee": { "@id": "http://54.191.234.158/entities/resource/1928/17495" }, "http://schema.org/about": [ { "@id": "http://54.191.234.158/entities/resource/Fault-Tolerance" }, { "@id": "http://54.191.234.158/entities/resource/Distributed_Algorithm" }, { "@id": "http://54.191.234.158/entities/resource/Byzantine_Agreement" }, { "@id": "http://54.191.234.158/entities/resource/Fault-tolerant_computing" }, { "@id": "http://54.191.234.158/entities/resource/Consensus" }, { "@id": "http://54.191.234.158/entities/resource/Monte_Carlo" }, { "@id": "http://54.191.234.158/entities/resource/Fault-Tolerant" }, { "@id": "http://54.191.234.158/entities/resource/Random_Beacon" }, { "@id": "http://54.191.234.158/entities/resource/Byzantine" }, { "@id": "http://54.191.234.158/entities/resource/Computer_networks--Scalability." }, { "@id": "http://54.191.234.158/entities/resource/Computer_algorithms." }, { "@id": "http://54.191.234.158/entities/resource/Randomized_Algorithm" } ], "http://schema.org/author": { "@id": "http://54.191.234.158/entities/resource/Oluwasanmi_Olumuyiwa" }, "http://schema.org/dateCreated": "December 2011", "http://schema.org/datePublished": "2012-02-01", "http://schema.org/description": "With the growth of the Internet, there has been a push toward designing reliable algorithms that scale effectively in terms of latency, bandwidth and other computational resources. Scalability has been a serious problem especially with peer-to-peer (p2p) networks which may have sizes of more than a million nodes.\n\n An important problem in designing reliable algorithms is Byzantine agreement. For reasons of scalability, message complexity is a critical resource for this problem. Unfortunately, previous solutions to Byzantine agreement require each processor to send $O(n)$ messages, where $n$ is the total number of processors in the network.\n\n In this dissertation, we show that the Byzantine agreement problem can be solved with significantly less that a linear number of messages both in theory and in practice. We implement and test algorithms that solve the classical problem with each processor sending only $\\tilde{O}(\\sqrt{n})$ messages.\n\n Further, we consider the problem in the case where we assume the existence of a random beacon: a global source of random bits. We show that with this assumption, the required number of messages drops to $O(\\log n)$, with small hidden constants.\n\n Our algorithms are Monte Carlo and succeed with high probability, that is probability $1-o(n^k)$ for some positive constant $k$.\n\n Our empirical results suggest that our algorithms may outperform classical solutions to Byzantine agreement for network of size larger than 30,000 nodes.", "http://schema.org/inLanguage": "en_US", "http://schema.org/isPartOf": { "@id": "http://hdl.handle.net/1928/3292" }, "http://schema.org/name": "Practical, scalable algorithms for Byzantine agreement" }, { "@id": "http://54.191.234.158/entities/resource/Randomized_Algorithm", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Fault-tolerant_computing", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Fault-Tolerant", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Random_Beacon", "@type": "http://schema.org/Intangible" }, { "@id": "http://54.191.234.158/entities/resource/Consensus", "@type": "http://schema.org/Intangible" } ]}


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record