Specifically, a peer can potentially forward each message to any neighbor between itself and the message's intended destination, not just the closest one to the destination.
The curve for the optimal Chord network was computed by exhaustively deciding for each possible source-destination pair whether there exists a route through the overlay that does not include any malicious peers (subject to the constraint that non-malicious peers must not route messages farther away than their 2nd-closest neighbor to the message's intended destination).
When all peers adhere to this protocol, messages are delivered to their final destinations in at most O log2n) hops because each hop at least halves the distance from the message's current position to its destination.
Considering all the parameters the same, if a node say A contacts a node, say B, of the same community as the message destination, then node B's utility to deliver that message will be higher than A. We have considered message delivery per unit time as an attribute for computing the delivery probability of a node for a particular destination.
Hence, the node 3 alone helps in forwarding the message to the destination node.
Hence, the chance of delivering the message to the destination increases.
This will result in a larger probability to send the message to the destination.
Once messages from the source nodes are received, relay nodes forward the messages to the destination.
(iii) At time instant for, the source sends message to the destination, and the destination sends message to the source.
At time instant for, the source sends message to the destination, and the destination sends message to the source.
(i) At time instant, the source sends message to the destination, and the destination sends message to the source.
