Optimized Robust Algorithm (Secure Spread 1.0)
Secure
Wait for
Final_Token
(FT)
Wait for
Partial_Token
(PT)
Wait for
Key_List
(KL)
Wait for
Cascading
Membership
(CM)
Collect
Fact_Outs
(FO)
Wait for
Self_Join
Join group
Wait for
Membership
Reduces the cost to about 50% if no cascaded event happens.
A process can crash/disconnect in any state.
The network can partition/merge in any state.
Leave group
Previous slide
Next slide
Back to first slide
View graphic version