J
John Augustine
Researcher at Indian Institute of Technology Madras
Publications - 90
Citations - 1127
John Augustine is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Distributed algorithm & Dynamic network analysis. The author has an hindex of 17, co-authored 81 publications receiving 955 citations. Previous affiliations of John Augustine include Nanyang Technological University & University of California, Irvine.
Papers
More filters
Proceedings ArticleDOI
Optimal power-down strategies
TL;DR: An algorithm is given that produces a deterministic strategy whose competitive ratio is arbitrarily close to optimal, and an algorithm to produce the optimal online strategy given a system and a probability distribution that generates the length of the idle period.
Proceedings ArticleDOI
Fast byzantine agreement in dynamic networks
TL;DR: In this paper, the authors studied Byzantine agreement in dynamic networks where topology can change from round to round and nodes can also experience heavy churn (i.e., nodes can join and leave the network continuously over time), and they presented randomized distributed algorithms that achieve almost-everywhere Byzantine agreement with high probability even under a large number of adaptively chosen Byzantine nodes and continuous adversarial churn in a number of rounds that is polylogarithmic in n.
Proceedings ArticleDOI
Towards robust and efficient computation in dynamic peer-to-peer networks
TL;DR: These algorithms are the first-known, fully-distributed, agreement algorithms that work under highly dynamic settings and are localized (i.e., do not require any global topological knowledge), simple, and easy to implement.
Journal ArticleDOI
Optimal Power-Down Strategies
TL;DR: An algorithm is given that, given a system, produces a deterministic strategy whose competitive ratio is arbitrarily close to optimal and an algorithm to produce the optimal online strategyGiven a system and a probability distribution that generates the length of the idle period.
Proceedings ArticleDOI
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks
TL;DR: The main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a constant degree graph with high expansion even under continuous high adversarial churn.