Keeping Track of the Latest Gossip in Message-Passing Systems

Consider a distributed system in which processes exchange information by passing messages. The gossip problem is the following: Whenever a process q receives a message from another process p, q must be able to decide which of p and q has more recent information about r, for every other process r in the system. With this data, q is in a position to update its knowledge about the global state of the system.