PCAR:Finding Critical Paths Based on Principal Component Analysis
Zhenghu Gong · Computer Engineering and Science · 2008
Reducing the objects to be measured is one of the optimization targets when monitoring the traffic flows on large-scale networks. Traditional methods often reduce the objects to be measured according to the flow's dependence in the space.The paper presents an algorithm of finding critical paths based on principal component analysis named PCAR,which finds the critical paths in the network by analysing the time-and-space dependence of the network traffic. We evaluate the algorithm using a large collection of real traffic flows collected in the Abliene network and our results demonstrate that the algorithm are effective and features a low error ratio compared with other algorithms.