Understanding the Gossip Protocol

Question

I am reading akka cluster documentation, and now I am in the Gossip section . I did not understand the following statement:

A cluster member is reported using the Gossip Protocol, where the current state of the cluster is randomly woven through the cluster, with preference for members who have not seen the latest version .

This is pretty hard to imagine. I have the following question:

Question : how does node know which members did not see the last change if the last change is still woven.

I mean, if a node received a notification about how it decides where to send it? Obviously, he should not send it back, since the sender saw the last change. But what about the other members? Some of them may have already seen the condition, and there is no other way to understand this than to request all of these members. But if we request one node, and it answers “no, I have not seen it” during the request, someone can send it a state ...

Answer 1

In the next paragraph, the article talks about using vector clocks. It says:

, .

, , . , 1000 , 10-15 , , .