TY - GEN
T1 - Robust tomography via network traffic maps leveraging sparsity and low rank
AU - Mardani, Morteza
AU - Giannakis, Georgios B.
PY - 2013/12/1
Y1 - 2013/12/1
N2 - 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.
AB - 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.
KW - Anomaly patterns
KW - Low rank
KW - Sparsity
KW - Traffic correlation
UR - http://www.scopus.com/inward/record.url?scp=84897724878&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84897724878&partnerID=8YFLogxK
U2 - 10.1109/GlobalSIP.2013.6737015
DO - 10.1109/GlobalSIP.2013.6737015
M3 - Conference contribution
AN - SCOPUS:84897724878
SN - 9781479902484
T3 - 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings
SP - 811
EP - 814
BT - 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings
T2 - 2013 1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013
Y2 - 3 December 2013 through 5 December 2013
ER -