Time-varying network tomography: router link data

In a computer network, the traffic matrix or the origin-destination (OD) byte counts are important statistics needed for design, routing, configuration debugging, monitoring and pricing. However, they are not easily available. For a fixed routing scheme, a statistical inverse algorithm is proposed and validated to estimate the traffic matrix from the easily collectable link counts which are aggregations of the origin-destination counts.

[1]  W. Deming,et al.  On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known , 1940 .

[2]  Bing Yu,et al.  Time-Varying Network Tomography: Router Link Data , 2000 .

[3]  B. Anderson,et al.  Optimal Filtering , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  M GayDavid,et al.  Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach , 1983 .

[5]  S. Kullback,et al.  Contingency tables with given marginals. , 1968, Biometrika.

[6]  Trevor Hastie,et al.  Statistical Models in S , 1991 .

[7]  K. Lange.  A gradient algorithm locally equivalent to the EM algorithm , 1995 .

[8]  R. Tibshirani,et al.  Generalized additive models for medical research , 1986, Statistical methods in medical research.

[9]  James J. Iannone,et al.  An EM Approach to OD Matrix Estimation , 1998 .

[10]  Y. Vardi,et al.  Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data , 1996 .

[11]  M. Wand.  Local Regression and Likelihood , 2001 .

[12]  M. West,et al.  Bayesian forecasting and dynamic models , 1989 .

[13]  David B. Dunson,et al.  Bayesian Data Analysis , 2010 .

[14]  Michael A. West,et al.  Bayesian Inference on Network Traffic Using Link Count Data , 1998 .

[15]  I. Csiszár.  $I$-Divergence Geometry of Probability Distributions and Minimization Problems , 1975 .

[16]  H. H. Ku.  Interaction in multidimensional contingency tables: an information theoretic approach , 1968 .