Scalable leader election

King, Valerie; Saia, Jared; Sanwalani, Vishal; Vee, Erik

doi:10.1145/1109557.1109667

Cited by 73 publications

(129 citation statements)

References 0 publications

Supporting

Mentioning

129

Contrasting

Order By: Relevance

“…Being few in number, these processors can run a heavyweight protocol requiring allto-all communication to also agree on a string globalstr which contains a bit (or multiple bits) from each processor, such that a 2/3 + fraction of the bits are randomly set. This string can be communicated scalably to almost all processors using a communication tree formed as a byproduct of the protocol (See [13,14]). …”

Section: Methodsmentioning

confidence: 99%

“…Most closely related is the algorithm in [11] which similarly starts with almost everywhere agreement on a bit and a small representative set of processors from [13,14] and produces everywhere agreement. However it is not load balanced, and does not create quorums or require the use of specially designed functions H and J.…”

Section: Related Workmentioning

confidence: 99%

“…Using the Almost-everywhere agreement protocol in [13,14] We observe that this protocol which uses polylogarithmic bits of communication generates a representative set S of O(log n) processors which is agreed upon by all but O(1/ log n) fraction of good processors, and any message agreed upon by the processors is learned by all but O(1/ log n) fraction of good processors. Hence we start in our current work from the point where there is an b log n bit string globalstr agreed upon by all but O(1/ log n) fraction of good processors such that 2/3+ fraction of good processor in S have each generated c /b random bits (see below), and the remaining bits are generated by bad processors after seeing the bits of good processors.…”

Section: 1mentioning

confidence: 99%

“…In the last few years, almost everywhere Byzantine agreement, i.e., coordination between all but a o(1) fraction of processors, was shown to be possible with no more than polylogarithmic bits of communication per processor and polylogarithmic time [13]. More recently, scalable everywhere agreement was shown to be possible if a small set of processors took on the brunt of each communicating Ω(n 3/2 ) bits to the remaining processors [11], or if private channels are assumed [12].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information

King

Lonargan

Saia

et al. 2011

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the adversary is malicious, controls a constant fraction of processors, and can view all messages in a round before sending out its own messages for that round. Furthermore, each bad processor may send an unlimited number of messages. The only constraint on the adversary is that it must choose its corrupt processors at the start, without knowledge of the processors' private random bits. A good quorum is a set of O(log n) processors, which contains a majority of good processors. In this paper, we give a synchronous algorithm which uses polylogarithmic time andÕ( √ n) bits of communication per processor to bring all processors to agreement on a collection of n good quorums, solving Byzantine agreement as well. The collection is balanced in that no processor is in more than O(log n) quorums. This yields the first solution to Byzantine agreement which is both scalable and load-balanced in the full information model. The technique which involves going from situation where slightly more than 1/2 fraction of processors are good and and agree on a short string with a constant fraction of random bits to a situation where all good processors agree on n good quorums can be done in a fully asynchronous model as well, providing an approach for extending the Byzantine agreement result to this model. As an additional result, we present a fully asynchronous algorithm that can go from a situation where slightly more than 1/2 fraction of processors are good and and agree on a short string with a constant fraction of random bits, to a situation where all good processors agree on n good quorums, and can do this in a load balanced way. This provides an approach for extending the Byzantine agreement result above to the asynchronous model, with an additional log n factor in the number of bits communicated.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: 1mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information

King

Lonargan

Saia

et al. 2011

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Of particular note are recent algorithms by Ben-Or et al [23], Kapron et al [24], King et al [25,26] that use universe reduction to solve Byzantine agreement.…”

Section: Related Workmentioning

confidence: 99%

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Alistarh

Gilbert

Guerraoui

et al. 2010

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract. Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call model (introduced by Karp et al. [1]), and we analyze two different notions of robustness: the ability to tolerate adaptive failures, and the ability to tolerate oblivious failures.For adaptive failures, we present a new gossip protocol, TrickleGossip, which achieves near-optimal O(n log 3 n) message complexity. To the best of our knowledge, this is the first epidemic-style protocol that can tolerate adaptive failures. We also show a direct relation between resilience and message complexity, demonstrating that gossip protocols which tolerate a large number of adaptive failures need to use a super-linear number of messages with high probability.For oblivious failures, we present a new gossip protocol, CoordinatedGossip, that achieves optimal O(n) message complexity. This protocol makes novel use of the universe reduction technique to limit the message complexity.

show abstract

Transmission Line Theory

2016

Microwave and Millimetre‐Wave Design for Wireless Communications

View full text Add to dashboard Cite

We describe an algorithm for Byzantine agreement that is scalable in the sense that each processor sends onlyÕ( √ n) bits, where n is the total number of processors. Our algorithm succeeds with high probability against an adaptive adversary, which can take over processors at any time during the protocol, up to the point of taking over arbitrarily close to a 1/3 fraction. We assume synchronous communication but a rushing adversary. Moreover, our algorithm works in the presence of flooding: processors controlled by the adversary can send out any number of messages. We assume the existence of private channels between all pairs of processors but make no other cryptographic assumptions. Finally, our algorithm has latency that is polylogarithmic in n. To the best of our knowledge, ours is the first algorithm to solve Byzantine agreement against an adaptive adversary, while requiring o(n 2 ) total bits of communication.

show abstract

Scalable leader election

Cited by 73 publications

References 0 publications

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Transmission Line Theory

Contact Info

Product

Resources

About