For some use-cases we require a message to be broadcasted to all nodes in the network and every/many nodes should send a reply to the initial sender.
If every node sends a message directly to the initial sender, this results in N messages, hence causing overload of the initial sender.
MINHCAST could offer a propagate-back method using the reverse path of the path used to distribute the message to all nodes.
Intermediate nodes act as aggregator, waiting for message of its child nodes (or some timeout) and then forwarding the message to their parent.
For some use-cases we require a message to be broadcasted to all nodes in the network and every/many nodes should send a reply to the initial sender. If every node sends a message directly to the initial sender, this results in N messages, hence causing overload of the initial sender.
MINHCAST could offer a propagate-back method using the reverse path of the path used to distribute the message to all nodes. Intermediate nodes act as aggregator, waiting for message of its child nodes (or some timeout) and then forwarding the message to their parent.