Estimating Traffic and Anomaly Maps via Network Tomography

被引:48
作者
Mardani, Morteza [1 ]
Giannakis, Georgios B. [1 ]
机构
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
关键词
Convex optimization; low rank; nominal and anomalous traffic; sparsity; spatiotemporal correlation; SPARSITY;
D O I
10.1109/TNET.2015.2417809
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Mapping origin-destination (OD) network traffic is pivotal for network management and proactive security tasks. However, lack of sufficient flow-level measurements as well as potential anomalies pose major challenges towards this goal. Leveraging the spatiotemporal correlation of nominal traffic, and the sparse nature of anomalies, this paper brings forth a novel framework to map out nominal and anomalous traffic, which treats jointly important network monitoring tasks including traffic estimation, anomaly detection, and traffic interpolation. To this end, a convex program is first formulated with nuclear and - norm regularization to effect sparsity and low rank for the nominal and anomalous traffic with only the link counts and a small subset of OD-flow counts. Analysis and simulations confirm that the proposed estimator can exactly recover sufficiently low-dimensional nominal traffic and sporadic anomalies so long as the routing paths are sufficiently "spread-out" across the network, and an adequate amount of flow counts are randomly sampled. The results offer valuable insights about data acquisition strategies and network scenaria giving rise to accurate traffic estimation. For practical networks where the aforementioned conditions are possibly violated, the inherent spatiotemporal traffic patterns are taken into account by adopting a Bayesian approach along with a bilinear characterization of the nuclear and norms. The resultant nonconvex program involves quadratic regularizers with correlation matrices, learned systematically from (cyclo) stationary historical data. Alternating-minimization based algorithms with provable convergence are also developed to procure the estimates. Insightful tests with synthetic and real Internet data corroborate the effectiveness of the novel schemes.
引用
收藏
页码:1533 / 1547
页数:15
相关论文
共 42 条
[21]  
LAKHINA A, 2004, P ACM SIGMETRICS NEW
[22]  
Lakhina A, 2004, P ACM SIGCOMM PORTL
[23]  
Mardani M., 2014, SUBSPACE LEARNING IM
[24]   Decentralized Sparsity-Regularized Rank Minimization: Algorithms and Applications [J].
Mardani, Morteza ;
Mateos, Gonzalo ;
Giannakis, Georgios B. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (21) :5374-5388
[25]   Recovery of Low-Rank Plus Compressed Sparse Matrices With Application to Unveiling Traffic Anomalies [J].
Mardani, Morteza ;
Mateos, Gonzalo ;
Giannakis, Georgios B. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (08) :5186-5205
[26]   Dynamic Anomalography: Tracking Network Anomalies Via Sparsity and Low Rank [J].
Mardani, Morteza ;
Mateos, Gonzalo ;
Giannakis, Georgios B. .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2013, 7 (01) :50-66
[27]   SPARSE APPROXIMATE SOLUTIONS TO LINEAR-SYSTEMS [J].
NATARAJAN, BK .
SIAM JOURNAL ON COMPUTING, 1995, 24 (02) :227-234
[28]  
Papagiannaki K., 2003, P 1 ACM SIGCOMM WORK
[29]  
Qi Zhao, 2006, Performance Evaluation Review, V34, P133, DOI 10.1145/1140103.1140294
[30]   A UNIFIED CONVERGENCE ANALYSIS OF BLOCK SUCCESSIVE MINIMIZATION METHODS FOR NONSMOOTH OPTIMIZATION [J].
Razaviyayn, Meisam ;
Hong, Mingyi ;
Luo, Zhi-Quan .
SIAM JOURNAL ON OPTIMIZATION, 2013, 23 (02) :1126-1153