Time-Varying Network Tomography: Router Link Data

Journal of the American Statistical Association

Volumn 95, Issue 452, 2000, Pages 1063-1075

  Cao, Jin ^a   Davis, Drew ^a   Vander Wiel, Scott ^a   Yu, Bin ^a,b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Expectation Maximization algorithm; Filtering; Inverse problem; Link data; Maximum likelihood estimation; Network traffic; Normal; Smoothing; Variance model

Indexed keywords

EID: 0442309490     PISSN: 01621459     EISSN: 1537274X     Source Type: Journal    
DOI: 10.1080/01621459.2000.10474303     Document Type: Article

References (17)

1. Anderson, B. D. O., and Moore, J. B. (1979), Optimal Filtering, Englewood Cliffs, NJ: Prentice-Hall.
2. Chambers, J. M., and Hastie, T. J., (eds.) (1993), Statistical Models in S, Pacific Grove, CA: Chapman & Hall.
3. Cooperative Association for Internet Data Analysis (CAIDA). (1999), Cflowd Flow Analysis Software (version 2.0), Author, www.caida.org/ Tools/Cflowd.
4. Csiszár, I. (1975), “I-divergence geometry of probability distributions and minimization problems,” The Annals of Probability, 3(1), 146-158.
5. Deming, W. E., and Stephan, F. F. (1940), “On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known,” Annals of Mathematical Statistics, 11, 427-444.
6. Dempster, A. P., Laird, N. M., and Rubin, D. B. (1977), “Maximum Like-lihood From Incomplete Data via the EM Algorithm, With Discussion,” Journal of Royal Statistical Society, Ser. B, 39, 1-38.
7. Gay, D. M. (1983), “Algorithm 611: Subroutines for Unconstrained Min-imization Using a Model/Trust-Region Approach,” ACM Trans. Math. Software, 9, 503-524.
8. Gelman, A., Carlin, J. B., Stern, H. S., and Rubin, D. B. (1995), Bayesian Data Analysis, Chapman & Hall.
9. Hastie, T. J., and Tibshirani, R. J. (1990), Generalized Additive Models, London: Chapman & Hall.
10. Ireland, C. T., and Kullback, S. (1968), “Contingency Tables With Given Marginals,” Biometrika, 55, 179-188.
11. Ku, H. H., and Kullback, S. (1968), “Interaction in Multidimensional Contingency Tables: An Information Theoretic Approach,” Journal of Re-search of the National Bureau of Standards, 72, 159-199.
12. Lange, K. (1995), “A Gradient Algorithm Locally Equivalent to the EM Algorithm,” Journal of the American Statistical Association, 57(2), 425-437.
13. Loader, C. (1999), Local Regression and Likelihood, New York: Springer-Verlag.
14. Tebaldi, C., and West, M. (1998), “Bayesian Inference on Network Traffic Using Link Count Data,” Journal of the American Statistical Association, 93(442), 557-576.
15. Vanderbei, R. I., and Iannone, J. (1994), “An EM Approach to OD Matrix Estimation,” Technical Report SOR 94-04, Princeton University.
16. Vardi, Y. (1996), “Network Tomography: Estimating Source-Destination Traffic Intensities From Link Data,” Journal of the American Statistical Association, 91, 365-377.
17. West, M., and Harrison, J. (1997), Bayesian Forecasting and Dynamic Models, New York: Springer-Verlag.