Question

4. (20 pts) Consider the study of replica voting algorithm you had done as part of the first warm-up project. For an extended analysis, Figure 4 shows the key performance results of the voting algorithms. The performance parameters are the time to deliver a data to the end-user (TTC). the number of distinet data proposals before effecting a data delivery, and the control message overhead expended to deliver a data. One of the influential parameters is the fault severity of a mis-behaving voter: denoted as a parameter r, where r is the probability that a faulty device does in fact behave incorrectly 0.1 means that a faulty device X behaves incorrectly only for 10% of the times X participates in For e.g. m operations-which means that X behaves correctly for 90% of the times. The results are shown for a case of r 0.5. Empirically plot the results for two other cases: r 0.2 and r 0.75 Show the plots on top of the results given for r 0.5. mrndure is maranteed to terminate, Le.. 6nd X in a Experimental results on voting algorithm performance data size 30 kbytes o( Tc)=50 mec; μ(TC)-50 msec, control message: 50 bytes Tc: voter computation time N-10: fm : # of faulty devices # of YES votes needed 6; ,24% network loss/-2% ▲ network loss network loss /=096 450 ↑ 400 fault severity: r-0.5 S 300 fault severity: r=0.5 fault severity: -o.5 200 150 0 3 2 0 20 15 fm fm fm 5 1 2 3 4 1 2 3 4 Figure 4: Experimental performance results of replica voting algorithm

Answer 1

irk moin leg chock numbe) utuan