N
Nitin H. Vaidya
Researcher at Georgetown University
Publications - 424
Citations - 29364
Nitin H. Vaidya is an academic researcher from Georgetown University. The author has contributed to research in topics: Wireless network & Wireless ad hoc network. The author has an hindex of 72, co-authored 420 publications receiving 28645 citations. Previous affiliations of Nitin H. Vaidya include Intel & Urbana University.
Papers
More filters
Posted Content
Randomized Reactive Redundancy for Byzantine Fault-Tolerance in Parallelized Learning
Nirupam Gupta,Nitin H. Vaidya +1 more
TL;DR: This report considers the problem of Byzantine fault-tolerance in synchronous parallelized learning that is founded on the parallelized stochastic gradient descent (parallelized-SGD) algorithm and proposes two coding schemes, a deterministic scheme and a randomized scheme, for guaranteeing exact fault-Tolerance if $2f < n$.
Journal ArticleDOI
Single fault-tolerant distributed shared memory using competitive update
Jai Hoon Kim,Nitin H. Vaidya +1 more
TL;DR: It is shown that the overhead of making the DSM recoverable measured in terms of the number of messages and the amount of data transferred is small in many applications.
Proceedings ArticleDOI
Brief Announcement: Partially Replicated Causally Consistent Shared Memory
Zhuolun Xiang,Nitin H. Vaidya +1 more
TL;DR: This paper investigates causal consistency in partially replicated systems, wherein each replica may store only a subset of the shared data.
Posted Content
Error-Free Multi-Valued Consensus with Byzantine Failures
Guanfeng Liang,Nitin H. Vaidya +1 more
TL;DR: An efficient deterministic algorithm for consensus in presence of Byzantine failures achieves consensus on an L-bit value with communication complexity O(nL + n4L0.5 + n6) bits, in a network consisting of n processors with up to t Byzantine failures.
Proceedings ArticleDOI
Byzantine broadcast in point-to-point networks using local linear coding
Guanfeng Liang,Nitin H. Vaidya +1 more
TL;DR: In this paper, a Network-Aware Byzantine Broadcast (NAB) algorithm is proposed to tolerate f faults in arbitrary point-to-point networks consisting of f ≥ 3f+1 nodes and having ≥ 2f + 1 directed node disjoint paths from each node i to each node j. The authors show that NAB can achieve throughput at least 1/3 of the capacity of BB in such networks.