Abstract: The embodiment herein provides a system and method for providing a novel leader election mechanism in distributed systems that is randomized in twin dimensions of space and time using the concept of a colliding random walk (CRW). Leader election is randomized in space in terms of the node identified as the leader and the time taken to identify the leader. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. A novel fault tolerance mechanism is provided to identify several leaders for same set of coupons. In this system and method, the source vertex generates multiple CRWs for each piece of work that needs to be done. The fault tolerance mechanism reduces the time to collision, increases the number of leaders and also offers increased resilience and tolerance to faults.

Abstract: The embodiments herein provide a fair, high speed and lightweight consensus mechanism for leader election in distributed systems using coupons. The consensus mechanism uses a leader election mechanism that is randomized in twin dimensions of space and time using the concept of a colliding random walk. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. Two novel coupon processing mechanisms called Process Execution Time Synchronization (PETS) mechanism and Single Queue (SQ) mechanism are used to process the coupons and find matches. The use of PETS optimizes memory and time requirements while SQ is extremely fast and efficient to handle large volumes of coupons. Also, the coupon forwarding to neighbouring nodes is performed based on three algorithms namely Uniform, Delay and Adaptive Delay forward. These forwarding algorithms effect high fairness even in case of open networks.

Abstract: The embodiment herein provides a system and method for providing a novel leader election mechanism in distributed systems that is randomized in twin dimensions of space and time using the concept of a colliding random walk (CRW). Leader election is randomized in space in terms of the node identified as the leader and the time taken to identify the leader. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. A novel fault tolerance mechanism is provided to identify several leaders for same set of coupons. In this system and method, the source vertex generates multiple CRWs for each piece of work that needs to be done. The fault tolerance mechanism reduces the time to collision, increases the number of leaders and also offers increased resilience and tolerance to faults.

Abstract: The embodiments herein provide a fair, high speed and lightweight consensus mechanism for leader election in distributed systems using coupons. The consensus mechanism uses a leader election mechanism that is randomized in twin dimensions of space and time using the concept of a colliding random walk. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. Two novel coupon processing mechanisms called Process Execution Time Synchronization (PETS) mechanism and Single Queue (SQ) mechanism are used to process the coupons and find matches. The use of PETS optimizes memory and time requirements while SQ is extremely fast and efficient to handle large volumes of coupons. Also, the coupon forwarding to neighbouring nodes is performed based on three algorithms namely Uniform, Delay and Adaptive Delay forward. These forwarding algorithms effect high fairness even in case of open networks.