Efficient data propagation in a computer network

A control node in a technical network with a plurality of nodes and connections between the nodes, which is represented in a probabilistic graph, wherein an edge in the graph is assigned with a probability value, representing a respective technical network constraint for activating the edges in the technical network, wherein the control node comprises:

• an input interface for determining technical network parameters and network constraints;
• a processor which is adapted for providing a probabilistic graph for the technical network and for decomposing the probabilistic graph into independent components and for generating a component tree structure as data structure
• a memory for storing that data structure;
• wherein the processor is further adapted to iteratively determine an optimal edge in the generated component tree, which maximizes an expected information flow to a query node to and/or from each node by processing the determined technical network constraints and by:
• executing a Monte-Carlo sampling for estimation of the expected information flow for cyclic components in the component tree, and
• computing the expected information flow of the non-cyclic components in the component tree analytically
• and wherein the processor is adapted to update the component tree iteratively with each determined optimal edge and to re-estimate the expected information flow in the updated component tree and to calculate an optimal set of edges and based thereon
• wherein the control node further comprises an output interface for providing a result with nodes in the technical network for data propagation, so that information flow is maximized by processing technical network constraints.