
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ahmet Bulut, Nick Koudas, Anand Meka, Ambuj K. Singh, Divesh Srivastava, "Optimization Techniques for Reactive Network Monitoring," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 9, pp. 13431357, September, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.203, author = {Ahmet Bulut and Nick Koudas and Anand Meka and Ambuj K. Singh and Divesh Srivastava}, title = {Optimization Techniques for Reactive Network Monitoring}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {9}, issn = {10414347}, year = {2009}, pages = {13431357}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.203}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Optimization Techniques for Reactive Network Monitoring IS  9 SN  10414347 SP1343 EP1357 EPD  13431357 A1  Ahmet Bulut, A1  Nick Koudas, A1  Anand Meka, A1  Ambuj K. Singh, A1  Divesh Srivastava, PY  2009 KW  Network monitoring KW  pushpull techniques. VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] B. Babcock and C. Olston, “Distributed TopK Monitoring,” Proc. ACM SIGMOD, pp. 2839, 2003.
[2] S. Babu, R. Motwani, K. Munagala, I. Nishizawa, and J. Widom, “Adaptive Ordering of Pipelined Stream Filters,” Proc. ACM SIGMOD, pp. 407418, 2004.
[3] C. Chow and C. Liu, “Approximating Discrete Probability Distributions with Dependence Trees,” IEEE Trans. Information Theory, vol. 14, no. 3, pp. 462467, May 1968.
[4] D. Chu, A. Deshpande, J.M. Hellerstein, and W. Hong, “Approximate Data Collection in Sensor Networks Using Probabilistic Models,” Proc. Int'l Conf. Data Eng. (ICDE '06), pp. 4860, 2006.
[5] P. Deolasee, A. Katkar, A. Panchbudhe, K. Ramamritham, and P. Shenoy, “Adaptive PushPull: Disseminating Dynamic Web Data,” Proc. 10th Int'l Conf. World Wide Web (WWW '01), pp. 265274, 2001.
[6] A. Deshpande, C. Guestrin, S.R. Madden, J.M. Hellerstein, and W. Hong, “ModelDriven Data Acquisition in Sensor Networks,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 588599, 2004.
[7] A. Desphande, C. Guestrin, S. Madden, and W. Hong, “Exploiting Correlated Attributes in Acquisitional Query Processing,” Proc. Int'l Conf. Data Eng. (ICDE '05), pp. 143154, 2005.
[8] M. Dilman and D. Raz, “Efficient Reactive Monitoring,” Proc. IEEE INFOCOM, pp. 10121019, 2001.
[9] O. Etzioni, S. Hanks, T. Jiang, R.M. Karp, O. Madani, and O. Waarts, “Efficient Information Gathering on the Internet,” Proc. Ann. Symp. Foundations of Computer Science (FOCS '96), pp. 234243, 1996.
[10] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness, first ed. Freeman, 1979.
[11] J. Gehrke, F. Korn, and D. Srivastava, “On Computing Correlated Aggregates over Continual Data Streams,” Proc. ACM SIGMOD, pp. 1324, 2001.
[12] J. Han and M. Kamber, Data Mining: Concepts and Techniques, second ed. Morgan Kaufmann, 2006.
[13] A. Jain, E. Chang, and Y.F. Wang, “Adaptive Stream Resource Management Using Kalman Filters,” Proc. ACM SIGMOD, pp. 1122, 2004.
[14] E.T. Jaynes, Probability Theory: The Logic of Science, first ed. Cambridge Univ. Press, 2003.
[15] D. Kifer, S. BenDavid, and J. Gehrke, “Detecting Change in Data Streams,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB '04), pp.180191, 2004.
[16] J. Kleinberg, “Bursty and Hierarchical Structure in Streams,” Proc. ACM SIGKDD, 2002.
[17] M. Massie, B. Chun, and D. Culler, “The Ganglia Distributed Monitoring System: Design, Implementation, and Experience,” Parallel Computing, vol. 30, no. 7, pp. 817840, July 2004.
[18] C. Olston, J. Jiang, and J. Widom, “Adaptive Filters for Continuous Queries over Distributed Data Streams,” Proc. ACM SIGMOD, pp. 563574, 2003.
[19] V. Paxson and S. Floyd, “Wide Area Traffic: The Failure of Poisson Modeling,” IEEE/ACM Trans. Networking, vol. 3, no. 3, pp. 226244, June 1995.
[20] J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
[21] S. Shah, S. Dharmarajan, and K. Ramamritham, “An Efficient and Resilient Approach to Filtering and Disseminating Streaming Data,” Proc. 29th Int'l Conf. Very Large Data Bases (VLDB '03), pp.5768, 2003.
[22] C. Wang and M.S. Chen, “On the Complexity of Distributed Query Optimization,” IEEE Trans. Knowledge and Data Eng., vol. 8, no. 4, pp. 650662, July/Aug. 1996.
[23] M. Wang, T. Madhyastha, N. Chan, S. Papadimitriou, and C. Faloutsos, “Data Mining Meets Performance Evaluation: Fast Algorithm for Modeling Bursty Traffic,” Proc. Int'l Conf. Data Eng. (ICDE '02), pp. 507516, 2002.
[24] S. Zhu and C. Ravishankar, “Stochastic Consistency, and Scalable PullBased Caching for Erratic Data Sources,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 192203, 2004.