Hi,
I want to better understand the use of code here: http://bit.ly/1kxjk5GWhy
should FLE reset the Vote to what is on the disk/initial values when
totalOrderPredicate() fails in the case of received ElectionEpoch being greater
than current vote's ElectionEpoch.
Going back to initial values(and clearing the recv set) does not seem to make
it incorrect but seems to slow down FLE if I am not mistaken. For example if B
has the best totalOrderPredicate() and A learns from it and if C has higher
election epoch but older values then A is forced to reset what it learned from
B till C and B catch up to each other?. Rather than let A and B wait for C to
upgrade its values after A and B borrow its ElectionEpoch?.
Any help is appreciated.
thanksPowell.
