Publication: Estimating Latent Processes on a Network From Indirect Measurements
Open/View Files
Date
2013
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
Informa UK Limited
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Airoldi, Edoardo M., and Alexander W. Blocker. 2013. Estimating Latent Processes on a Network From Indirect Measurements. Journal of the American Statistical Association 108, no. 501: 149–164.
Research Data
Abstract
In a communication network, point-to-point traffic volumes over time are critical for designing protocols that route information efficiently and for maintaining security, whether at the scale of an Internet service provider or within a corporation. While technically feasible, the direct measurement of point-to-point traffic imposes a heavy burden on network performance and is typically not implemented. Instead, indirect aggregate traffic volumes are routinely collected. We consider the problem of estimating point-to-point traffic volumes, \(x_t\), from aggregate traffic volumes, \(y_t\), given information about the network routing protocol encoded in a matrix A. This estimation task can be reformulated as finding the solutions to a sequence of ill-posed linear inverse problems, \(y_t=Ax_t\), since the number of origin-destination routes of interest is higher than the number of aggregate measurements available.
Here, we introduce a novel multilevel state-space model (SSM) of aggregate traffic volumes with realistic features. We implement a naïve strategy for estimating unobserved point-to-point traffic volumes from indirect measurements of aggregate traffic, based on particle filtering. We then develop a more efficient two-stage inference strategy that relies on model-based regularization: a simple model is used to calibrate regularization parameters that lead to efficient/scalable inference in the multilevel SSM. We apply our methods to corporate and academic networks, where we show that the proposed inference strategy outperforms existing approaches and scales to larger networks. We also design a simulation study to explore the factors that influence the performance. Our results suggest that model-based regularization may be an efficient strategy for inference in other complex multilevel models. Supplementary materials for this article are available online.
Description
Other Available Sources
Keywords
Approximate inference, Ill-posed inverse problem, Multilevel state-space model, Multistage estimation, Network tomography, Origin-destination traffic matrix, Particle filtering, Polytope sampling, Stochastic dynamics
Terms of Use
This article is made available under the terms and conditions applicable to Open Access Policy Articles (OAP), as set forth at Terms of Service