A Novel Method for Origin-Destination Flow Computation Based on Distributed Network Monitoring.

The traditional network flow estimation requires monitoring on every node which consumes too much resource. So how to increase the deployment of new distributed monitors as the network expanding is becoming a new research focus. This paper analyses the monitors adding mechanism and present a novel algorithm for finding candidate locations for additional deployment in the network. The algorithm is based on Apriori search method that combines with the link weight change algorithm that aims to facilitate origin-destination flow computation. We also develop the greedy algorithm with Group Betweenness Centrality(GBC) involved for the purpose of comparing. The result shows that the new algorithm need less additional monitors than greedy algorithm.