Recovering latent time-series from their observed sums: Network tomography with particle filters

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 30-39

  Airoldi, Edoardo ^a   Faloutsos, Christos ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Empirical Bayes; Informative Priors; Link Loads; MCMC; Origin Destination Traffic Flows; Particle Filter; Self organizing Bayesian Dynamical System

Indexed keywords

EMPIRICAL BAYES; INFORMATIVE PRIORS; LINK LOADS; MCMC; ORIGIN-DESTINATION TRAFFIC FLOWS; PARTICLE FILTER; SELF-ORGANIZING BAYESIAN DYNAMICAL SYSTEM;

DATA ACQUISITION; LEARNING SYSTEMS; LOCAL AREA NETWORKS; MATHEMATICAL MODELS; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC; TOMOGRAPHY;

TIME SERIES ANALYSIS;

EID: 12244295758     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. E. M. Airoldi. Advances in network tomography. Technical Report CMU-CALD-03-101, Carnegie Mellon University, 2003.
2. E. M. Airoldi and C. Faloutsos. Recovering Latent Time-Series from their Observed Sums. Technical Report CMU-CS-04-130, Carnegie Mellon University, 2004.
3. Y. Bejerano, Y. Breitbart, M. Garofalakis, and R. Rastogi. Physical topology discovery for large multi-subnet networks. In Proceedings of IEEE INFOCOM, pages 342-352, 2003.
4. Z. Bi, C. Faloutsos, and F. Korn. The DGX distribution for mining massive, skewed data. In Proceedings of ACM SIGKDD, pages 17-26, 2001.
5. J. Cao, D. Davis, S. Van Der Viel, and B. Yu. Time-varying network tomography: router link data. Journal of the American Statistical Association, 95:1063-75, 2000.
6. J. Cao, D. Davis, S. Van Der Viel, B. Yu, and Z. Zu. A scalable method for estimating network traffic matrices from link counts. Technical report, Bell Labs, 2001.
7. S. E. Fienberg. The geometry of an r × c contingency table. Annals of Mathematical Statistics, 39:1186-90, 1968.
8. S. E. Fienberg. The geometry of a two by two contingency table. Journal of the American Statistical Association, 65:694-701, 1970a.
9. W. R. Gilks and C. Berzuini. Following a moving target - monte carlo inference for dynamic bayesian models. Journal of the Royal Statistical Society, Series B, 63:127-146, 2001.
10. T. Higuchi. Self-organizing time series model. In A. Doucet, N. de Freitas, and N. Gordon, editors, Sequential Monte Carlo Methods in Practice. Springer-Verlag, 2001.
11. G. Liang and B. Yu. Pseudo-likelihood estimations in network tomography. In Proceedings of IEEE INFOCOM, 2003.
12. J. Liu. Monte Carlo Strategies in Scientific Computing. Springer-Verlag, 2001.
13. B. Mandelbrot. An informational theory of the statistical structure of language. In W. Jackson, editor, Communication Theory. Butterworths, 1953.
14. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot. Traffic matrix estimation: existing techniques and new directions. In Proceedings of ACM SIGCOMM, pages 161-174, 2002.
15. I. Rish, M. Brodie, and S. Ma. Accuracy vs. efficiency trade-offs in probabilistic diagnosis. In Proceedings of AAAI, 2002.
16. I. Rish, M. Brodie, N. Odintsova, S. Ma, and G. Grabarnik. Real-time problem determination in distributed systems using active probing. To appear in NOMS, 2004.
17. C. and G. Casella. Monte Carlo Statistical Methods. Springer-Verlag, 1999.
18. C. Tebaldi and M. West. Bayesian inference on network traffic using link count data. Journal of the American Statistical Association, 93:557-576, 1998.
19. R. J. Vanderbei and J. Iannone. An em approach to od matrix estimation. Technical Report SOR 94-04, Princeton University, 1994.
20. Y. Vardi. Network tomography: estimating source-destination traffic intensities from link data. Journal of the American Statistical Association, 91:365-377, 1996.
21. S. Vaton and A. Gravey. Iterative bayesian estimation of network traffic matrices in the case of bursty flows. In Proceedings of the second ACM SIGCOMM Workshop on Internet measurment, pages 89-90, 2002.
22. W. Wei, B. Wang, D. Towsley. Continuous-time Hidden Markov Models for Network Performance Evaluation. Performance Evaluation, 49:129-146, 2002.
23. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg. Fast accurate computation of large-scale IP traffic matrices from link loads. In Proceedings of SIGMETRICS, 2003.
24. Y. Zhang, M. Roughan, C. Lund, and D. Donoho. An information-theoretic approach to traffic matrix estimation. In Proceedings of SIGCOMM, 2003.
25. G. K. Zipf. Selected Studies of the Principle of Relative Frequency in Language. Harvard University Press, 1932.