1 / 20

Behavior of Byzantine Algorithm

Behavior of Byzantine Algorithm. Chun Zhang. Index . Introduction Experimental Setup Behavior Observation Result Analysis Conclusion Future Work. Introduction---B yzantine Algorithm. Commanding-general & lieutenants each general (process) may be either loyalty or traitor (faulty)

lonna
Télécharger la présentation

Behavior of Byzantine Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Behavior of Byzantine Algorithm Chun Zhang

  2. Index • Introduction • Experimental Setup • Behavior Observation • Result Analysis • Conclusion • Future Work

  3. Introduction---Byzantine Algorithm Commanding-general & lieutenants • each general (process) may be either loyalty or traitor (faulty) • commanding-general sends two types of orders: attack and retreat Problem • all lieutenants decide on the order to obey • all loyal lieutenants decide on the same order • if the commanding-general is loyal, then every loyal lieutenant obeys the order he sends Faulty tolerance: n>= 3m+1: the algorithm can solve the problem n <3m+1: the algorithm won’t work properly

  4. Experimental Setup • m=4 n=1: started by the number of 4 nodes, 1 of 4 nodes is traitor. • Running 60 times for each pair of input number • Input number according to n>=3m+1 and n<3m+1 • Range: general numbers are between 4 and 10

  5. Behavior Observation---n>=3m+1

  6. Behavior Observation---n<3m+1

  7. Result Analysis: No. of Decisions Based on Varying Input Number

  8. Result Analysis: No. of Decisions Based on Varying Input Number

  9. Result Analysis: No. of Decisions Based on Varying Input Number

  10. Conclusion n>=3m+1 • The retreat has large portion of the decision and the change is smooth. • The attack and wait has small portion of the decision, most of the time, the change is smooth. n<3m+1 • The retreat is still in large portion of the decision but the change is a little bit sharp comparing the change in n>3m+1. • The attack and wait still is in small portion of the decision, but the change is a little bit sharp comparing the change in n>3m+1.

  11. Future Work • To test my program with much larger no. of processes. • To test my program on a real distributed network.

  12. Reference • Lamport L., ShostakR., and Pease M. “The Byzantine Generals Problem”, ACM transactions on Programming Languages and Systems 4(3), 1982

  13. Thank You

  14. Code Explanation

More Related