Gossipsub implementation

[tinniaru3005]

This function facilitates the Gossipsub protocol for segment distribution among nodes. It ensures that each node receives any missing segments by checking other nodes in the network.

Creates 2 DHTs:

• rows (dict): A hash table where the keys are row IDs and the values are lists of nodes that contain these rows.
• cols (dict): A hash table where the keys are column IDs and the values are lists of nodes that contain these columns.

Implementation:

• The function iterates through all row IDs and column IDs.
• For each segment identified by a row ID (rID) and a column ID (cID):
  • It checks if the current node (self) already has the segment.
  • If the segment is missing, it attempts to receive the segment from other nodes using the Gossipsub protocol via the receiveSegmentViaGossip method.