When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...
— We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of bo...
This work presents a comprehensive theoretical framework for window-based congestion control protocols that are designed to converge to fairness and efficiency. We first derive ...
While a variety of mechanisms have been developed for securing individual intra-domain protocols, none address the issue in a holistic manner. We develop a unified framework to sec...