Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    The Bloom Clock for Causality Testing

    Testing for causality between events in distributed executions is a fundamental problem. Vector clocks solve this problem but do not scale well. The probabilistic Bloom clock can determine causality between ev...

    Anshuman Misra, Ajay D. Kshemkalyani in Distributed Computing and Internet Technology (2021)

  2. No Access

    Chapter and Conference Paper

    Solvability of Byzantine Fault-Tolerant Causal Ordering Problems

    Causal ordering in an asynchronous setting is a fundamental paradigm for collaborative software systems. Previous work in the area concentrates on ordering messages in a faultless setting and on ordering broad...

    Anshuman Misra, Ajay D. Kshemkalyani in Networked Systems (2022)

  3. No Access

    Chapter and Conference Paper

    Brief Announcement: Byzantine-Tolerant Detection of Causality in Synchronous Systems

    It was recently proved that the causality or the happens before relation between events in an asynchronous distributed system cannot be detected in the presence of Byzantine processes [Misra and Kshemkalyani, ...

    Anshuman Misra, Ajay D. Kshemkalyani in Stabilization, Safety, and Security of Dis… (2023)

  4. No Access

    Chapter and Conference Paper

    Byzantine Fault-Tolerant Causal Order Satisfying Strong Safety

    Causal ordering is an important building block for distributed software systems. It was recently proved that it is impossible to provide causal ordering – liveness and strong safety – using a deterministic non...

    Anshuman Misra, Ajay D. Kshemkalyani in Stabilization, Safety, and Security of Dis… (2023)