A Re-routing Method Based on Weighted Tripartite Graph for TM Estimation

This paper proposes a new method to avoid redundant measurement during re-routing for determining flow entries in traffic matrix. We take the correlation among flows into consideration; build a complete tripartite graph to represent the relationship between flows, paths and links and correlations among flows, and its weighted variant. Based on the weighted graph, we formulate the problem of how to reroute flows at a time as a weighted tripartite matching problem to solve so as to maximize the total number of flows finally measured after periodically re-routing. Evaluation results with real data demonstrate the efficiency of our method.