Timing

Question 1

How can the Berkeley Algorithm be improved?

Answer 1

1. Ignore significant outliers when calculating the average time difference.
2. In case the co-ordinator node fails/corrupts, a secondary leader must be ready/pre-chosen to reduce downtime caused due to the co-ordinator’s unavailability.
3. Broadcast the relative inverse time difference instead of sending the synchronized time to reduce latency caused by latency in the network.

Question 2

What are some Vector Clock properties?

Answer 2

1. T=T’ iff T[i] = T’[i]
2. T<= T’ iff T[i] <= T’[i]
3. T < T’ iff T[i] <= T’ and T not equal to T’
4. T || T’ iff Tnot<=T’ and T’not<=T