Mapping origin-to-destination network-traffic-state is pivotal for network management and proactive security tasks. However, lack of flow-level measurements as well as potential anomalies pose major challenges toward achieving these goals. Leveraging the spatiotemporal correlation of nominal traffic, and the sparse nature of anomalies, this paper proposes a novel estimator to map out both nominal and anomalous traffic components, based on link counts along with a small subset of flow-counts. Adopting a Bayesian approach with a bilinear charactrization of the nuclear- and the ℓ1-norm, a nonconvex optimization problem is formulated which takes into account inherent patterns of nominal traffic and anomalies, captured through traffic correlations, via quadratic regularizers. Traffic correlations are learned from (cyclo)stationary historical data. The nonconvex problem is solved using an alternating majorization-minimization technique which provably converges to a stationary point. Simulated tests confirm the effectiveness of the novel estimator.
[1]
Morteza Mardani,et al.
Robust network traffic estimation via sparsity and low rank
,
2013,
2013 IEEE International Conference on Acoustics, Speech and Signal Processing.
[2]
Gonzalo Mateos,et al.
Rank Regularization and Bayesian Inference for Tensor Completion and Extrapolation
,
2013,
IEEE Transactions on Signal Processing.
[3]
Konstantina Papagiannaki,et al.
Structural analysis of network traffic flows
,
2004,
SIGMETRICS '04/Performance '04.
[4]
Adi Shraibman,et al.
Rank, Trace-Norm and Max-Norm
,
2005,
COLT.
[5]
Zhi-Quan Luo,et al.
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
,
2012,
SIAM J. Optim..