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


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record