Probability, Statistics, Distributed Systems, Software Engineering, Interview Questions.
servers among S1 to S(i-1) became leaders again and only in the Xi th term, Si became leader. Then the expected number of terms before all N servers becomes leader E = E[X1 + X2 + … + Xn] = E[X1] + E[X2] + …. + E[Xn] E[Xi] = Expected number of terms before Si become leader after S(i-1) Let p =