Open Access
March 2015 Network tomography for integer-valued traffic
Martin L. Hazelton
Ann. Appl. Stat. 9(1): 474-506 (March 2015). DOI: 10.1214/15-AOAS805


A classic network tomography problem is estimation of properties of the distribution of route traffic volumes based on counts taken on the network links. We consider inference for a general class of models for integer-valued traffic. Model identifiability is examined. We investigate both maximum likelihood and Bayesian methods of estimation. In practice, these must be implemented using stochastic EM and MCMC approaches. This requires a methodology for sampling latent route flows conditional on the observed link counts. We show that existing algorithms for doing so can fail entirely, because inflexibility in the choice of sampling directions can leave the sampler trapped at a vertex of the convex polytope that describes the feasible set of route flows. We prove that so long as the network’s link-path incidence matrix is totally unimodular, it is always possible to select a coordinate system representation of the polytope for which sampling parallel to the axes is adequate. This motivates a modified sampler in which the representation of the polytope adapts to provide good mixing behavior. This methodology is applied to three road traffic data sets. We conclude with a discussion of the ramifications of the unimodularity requirements for the routing matrix.


Download Citation

Martin L. Hazelton. "Network tomography for integer-valued traffic." Ann. Appl. Stat. 9 (1) 474 - 506, March 2015.


Published: March 2015
First available in Project Euclid: 28 April 2015

zbMATH: 06446577
MathSciNet: MR3341124
Digital Object Identifier: 10.1214/15-AOAS805

Keywords: EM algorithm , MCMC , origin–destination , polytope , transport , unimodular matrix

Rights: Copyright © 2015 Institute of Mathematical Statistics

Vol.9 • No. 1 • March 2015
Back to Top