Raft algorithm is a strong leader-based distributed consensus mechanism which ensures strong consistency. However it’s availability aspect suffers in the presence of partial network partitions resulting in repeated leader elections and reducing the normal operations. We propose adding a new mode called Unavailable to the existing 3 modes to make the algorithm more robust and resistant to this non-trivial edge case.