Optimal Flow Collector Placement In Experimental Networks

For operational security personnel, network based data collection requires balancing the need for complete collection against the risks of drowning in redundant data. We have developed a formulation of this problem of redundant collection which converts the problem into a maxflow problem, enabling us to determine optimal sensor placement assuming complete collection. We discuss the formulation and how it can accommodate multiple security requirements and demonstrate its implementation on multiple candidate networks.