Achieving Efficiency, Robustness, and Security in Distributed Computing
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This dissertation investigates ways to improve various performance metrics of distributed computing systems. We begin with a study of the \emph{message complexity} of the \emph{leader election} problem in diameter-two networks. We first give a simple randomized Monte-Carlo leader election algorithm that with high probability\footnote{Throughout this dissertation, we would use eith high probability'' or
whp'' to mean ``with probability at least