Anshuman Misra

Prof. Dr. Anshuman Misra


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 January 2023
Verified
Conference Paper
Open access
AMAnshuman Misra
Anshuman Misra
AKAjay Kshemkalyani
Ajay Kshemkalyani
Byzantine fault-tolerant causal ordering of messages in asynchronous systems is useful to many applications. Although the problem has been studied for broadcast communication, it has not been examined for unicasts or multicasts in asynchronous systems. In this paper, we use execution histories to prove that it is impossible to solve causal ordering for both unicasts and multicasts in an asynchronous system with one or more Byzantine processes. In view of these impossibility results, we propose the Channel Sync Algorithms to provide causal order of unicasts and multicasts under the Byzantine failure model in synchronous systems, which have a known upper bound on message latency. The Channel Sync Algorithms operate under the synchronous system model, but are inherently asynchronous and offer a high degree of concurrency as lock-step communication is not assumed.

28 September 2022
Verified
Book Chapter
Closed access
PDF file
AMAnshuman Misra
Anshuman Misra
AKAjay Kshemkalyani
Ajay Kshemkalyani

21 February 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
AMAnshuman Misra
Anshuman Misra
AKAjay Kshemkalyani
Ajay Kshemkalyani
Byzantine fault-tolerant causal ordering of messages is useful to many applications. Causal ordering requires a property that we term strong safety, and liveness. In this paper, we use execution histories to prove that it is impossible to solve causal ordering – strong safety and liveness – in a deterministic manner for unicasts, multicasts, and broadcasts in an asynchronous system with one or more Byzantine processes. We also define a weaker version of strong safety termed weak safety. We prove that it is impossible to solve causal ordering – weak safety and liveness – in a deterministic manner for unicasts and multicasts, in an asynchronous system with one or more Byzantine processes. In view of these impossibility results, we propose the Sender-Inhibition algorithm and the Channel Sync algorithm to provide causal order – weak safety and liveness – of unicasts under the Byzantine failure model in synchronous systems, which have a known upper bound on message latency. The algorithms operate under the synchronous system model, but are inherently asynchronous and offer a high degree of concurrency as lock-step communication is not assumed. The two algorithms provide different trade-offs. We also indicate how the algorithms can be extended to multicasts.

30 September 2023
Verified
Book Chapter
Closed access
PDF file
AMAnshuman Misra
Anshuman Misra
AKAjay Kshemkalyani
Ajay Kshemkalyani


9 April 2025 in Parallel Computing
Verified
Journal Article
Open access
AMAnshuman Misra
Anshuman Misra
AKAjay Kshemkalyani
Ajay Kshemkalyani