Abstract
ABSTRACT
The proposed protocol introduces a Markovian approach to message propagation in distributed computing systems, emphasizing reduced overhead and enhanced fault tolerance. Each node functions as a stateless agent, making forwarding decisions solely based on its current state and the received message, consistent with the Markov property. Messages act as self-contained carriers, embedding relay history and path metadata such as bloom filters, vector clocks, or acknowledgment maps, so nodes can detect prior processing and avoid redundant forwarding. Current-state directives like next-hop details, time-to-live, quorum requirements, and propagation mode guide deterministic or probabilistic dissemination across gossip, ring, or hybrid topologies. By ensuring each message is forwarded only once per node, the protocol achieves near-linear communication complexity, supports dynamic membership changes, and enables recovery after failures. This design minimizes bandwidth and memory consumption, making it highly scalable for large, fault-tolerant distributed networks.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Mohan, Shivam, "MARKOVIAN COMMUNICATION PROTOCOL FOR EFFICIENT COMMUNICATION IN DISTRIBUTED SYSTEMS", Technical Disclosure Commons, ()
https://www.tdcommons.org/dpubs_series/10221