Structural analysis of network traffic matrix via relaxed principal component pursuit

详细信息	查看全文 | 推荐本文 |

• 作者：Zhe Wang^a ; ^b ; ^{wangzhe@cse.buaa.edu.cn}  ; [Author Vitae] ; Kai Hu^a ; ^{hukai@buaa.edu.cn}  ; [Author Vitae] ; Ke Xu^a ; ^b ; ^{kexu999@gmail.com}  ; [Author Vitae] ; Baolin Yin^a ; ^b ; ^{yin@nlsde.buaa.edu.cn}  ; [Author Vitae] ; Xiaowen Dong^c ; ^{xiaowen.dong@epfl.ch}  ; [Author Vitae]
• 关键词：Network measurement ; Traffic matrix structural analysis ; Robust principal component analysis ; Relaxed principal component pursuit ; Accelerated proximal gradient algorithm
• 刊名：Computer Networks
• 出版年：2012
• 期刊代码：28_13891286
• 类别：cp
• 出版时间：3 May, 2012
• 卷：56
• 期：7
• 页码：2049-2067
• 文件大小：1692 K

摘要

The network traffic matrix is widely used in network operation and management. It is therefore of crucial importance to analyze the components and the structure of the network traffic matrix, for which several mathematical approaches such as Principal Component Analysis (PCA) were proposed. In this paper, we first argue that PCA performs poorly for analyzing traffic matrix that is polluted by large volume anomalies, and then propose a new decomposition model for the network traffic matrix. According to this model, we carry out the structural analysis by decomposing the network traffic matrix into three sub-matrices, namely, the deterministic traffic, the anomaly traffic and the noise traffic matrix, which is similar to the Robust Principal Component Analysis (RPCA) problem previously studied in . Based on the Relaxed Principal Component Pursuit (Relaxed PCP) method and the Accelerated Proximal Gradient (APG) algorithm, we present an iterative approach for decomposing a traffic matrix, and demonstrate its efficiency and flexibility by experimental results. Finally, we further discuss several features of the deterministic and noise traffic. Our study develops a novel method for the problem of structural analysis of the traffic matrix, which is robust against pollution of large volume anomalies.