Research

Advised by Prof. Mikhail Nesterenko · Kent State University

• Implemented Bracha's Byzantine fault-tolerant reliable broadcast protocol in C++ on the QUANTAS discrete-event simulator, building the SEND/ECHO/READY quorum logic to tolerate up to ⅓ Byzantine nodes across networks of 10–100 peers under asynchronous conditions.
• Designed and ran four controlled experiment sweeps varying network delay (1–10 rounds), peer count (25–100), and Byzantine fault percentage (0–30%), with 30 randomized seeds per configuration.
• Showed that latency scales linearly with network delay (~2 rounds per delay unit) and message complexity grows as O(n²), confirming Bracha's theoretical properties empirically.

c++ · quantas · python · matplotlib

Alongside the implementation work, I read and presented papers on Byzantine broadcast in partially connected networks, reliable communication in dynamic (time-varying) networks, and self-stabilizing overlay networks - including Tiara, a deterministic skip list. The work here is translating formal solvability conditions, connectivity bounds, and correctness proofs into something a room can follow.