CPC H04L 41/0803 (2013.01) [G06F 16/2379 (2019.01); G06F 16/2465 (2019.01); H04L 47/11 (2013.01); G06F 2216/03 (2013.01); G06Q 20/223 (2013.01); H04L 9/3239 (2013.01); H04L 9/50 (2022.05); H04L 47/38 (2013.01)] | 18 Claims |
1. A node to propagate transactions in a network of nodes, each node having one or more connections to other nodes, the node comprising:
a processor;
memory;
a network interface; and
an application containing processor-executable instructions that, when executed by the processor, cause the processor to:
receive a plurality of incoming transactions over a time period;
combine the plurality of incoming transactions using network coding to generate a composite message;
send the composite message to one or more nodes in the network; and
determine an adjusted time period based on an equilibrium constant parameter based on a count of transactions in the plurality of incoming transactions received over the time period; and
determine that the count of transactions received in the time period exceeds a minimum count to use network coding, and wherein the combining and sending are conditional on the determination for exceeding the minimum count.
|