Leader Election in Sparse Dynamic Networks with Churn

DOI10.1080/15427951.2016.1199391zbMath1461.68018OpenAlexW2441892248MaRDI QIDQ5856444

Tejas Kulkarni, Sumathi Sivasubramaniam, John E. Augustine

Publication date: 26 March 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2016.1199391

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tolerating a linear number of faults in networks of bounded degree
• Distributed computation in dynamic networks
• Fast asynchronous Byzantine agreement and leader election with full information
• Fault-tolerant distributed algorithm for election in complete networks
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Self-stabilizing systems in spite of distributed control
• Fast byzantine agreement in dynamic networks
• Breaking the O ( n ² ) bit barrier

This page was built for publication: Leader Election in Sparse Dynamic Networks with Churn