Member Avatar for bufospro

Hi,
I have to implement in C an distibuted algorithm, which counts the number of processes in a full-connected network when happens f byzantine faults.

Could you help me with the algorithm ? Only a basic idea!
I don't want the implementation.

I am looking in web and I found EIGBYZ algorithm, but I can't understand it.

Any help?? please
Thanks a lot

  • 2 Contributors
  • 3 Replies
  • 64 Views
  • 1 Day Discussion Span
  • Latest Post Latest Post by bufospro

Recommended Answers

All 3 Replies

Member Avatar for bufospro

anybody ??

Member Avatar for Nick Evan

Perhaps you could explain which part you don't understand?

Member Avatar for bufospro

Perhaps you could explain which part you don't understand?

If I run the algorithm EIGBYZ with 4 processes [A,B,C,D] and f=1 fault for example.
with initial values 0,0,0,1 and the last proccess is fault what is the output from the algorithm ?

A: B->0, C->0, D->unknown
B: A->0, C->0, D->unknown
C: A->0, B->0, D->unknown
D: A-<unknown B->unknown, C->unknown, D->unknown
???


To count my proccesses I have instead to send a value to increase a counter for every message ?
And if the fault proccess sends two messages ??


I can't understand!

Edited by bufospro because: n/a
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.