The Community for Technology Leaders
RSS Icon
Issue No.09 - September (2009 vol.21)
pp: 1343-1357
Ahmet Bulut ,, San Mateo
Nick Koudas , University of Toronto, Toronto
Anand Meka , University of California Santa Barbara, Santa Barbara
Ambuj K. Singh , University of California, Santa Barbara, Santa Barbara
Divesh Srivastava , AT&T Labs-Research, Florham Park
We develop a framework for minimizing the communication overhead of monitoring global system parameters in IP networks and sensor networks. A global system predicate is defined as a conjunction of the local properties of different network elements. A typical example is to identify the time windows when the outbound traffic from each network element exceeds a predefined threshold. Our main idea is to optimize the scheduling of local event reporting across network elements for a given network traffic load and local event frequencies. The system architecture consists of N distributed network elements coordinated by a central monitoring station. Each network element monitors a set of local properties and the central station is responsible for identifying the status of global parameters registered in the system. We design an optimal algorithm, the Partition and Rank (PAR) scheme, when the local events are independent; whereas, when they are dependent, we show that the problem is NP-complete and develop two efficient heuristics: the PAR for dependent events (PAR-D) and Adaptive (Ada) algorithms, which adapt well to changing network conditions, and outperform the current state of the art techniques in terms of communication cost.
Network monitoring, push-pull techniques.
Ahmet Bulut, Nick Koudas, Anand Meka, Ambuj K. Singh, Divesh Srivastava, "Optimization Techniques for Reactive Network Monitoring", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 9, pp. 1343-1357, September 2009, doi:10.1109/TKDE.2008.203
[1] B. Babcock and C. Olston, “Distributed Top-K Monitoring,” Proc. ACM SIGMOD, pp. 28-39, 2003.
[2] S. Babu, R. Motwani, K. Munagala, I. Nishizawa, and J. Widom, “Adaptive Ordering of Pipelined Stream Filters,” Proc. ACM SIGMOD, pp. 407-418, 2004.
[3] C. Chow and C. Liu, “Approximating Discrete Probability Distributions with Dependence Trees,” IEEE Trans. Information Theory, vol. 14, no. 3, pp. 462-467, 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. 48-60, 2006.
[5] P. Deolasee, A. Katkar, A. Panchbudhe, K. Ramamritham, and P. Shenoy, “Adaptive Push-Pull: Disseminating Dynamic Web Data,” Proc. 10th Int'l Conf. World Wide Web (WWW '01), pp. 265-274, 2001.
[6] A. Deshpande, C. Guestrin, S.R. Madden, J.M. Hellerstein, and W. Hong, “Model-Driven Data Acquisition in Sensor Networks,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 588-599, 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. 143-154, 2005.
[8] M. Dilman and D. Raz, “Efficient Reactive Monitoring,” Proc. IEEE INFOCOM, pp. 1012-1019, 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. 234-243, 1996.
[10] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, first ed. Freeman, 1979.
[11] J. Gehrke, F. Korn, and D. Srivastava, “On Computing Correlated Aggregates over Continual Data Streams,” Proc. ACM SIGMOD, pp. 13-24, 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. 11-22, 2004.
[14] E.T. Jaynes, Probability Theory: The Logic of Science, first ed. Cambridge Univ. Press, 2003.
[15] D. Kifer, S. Ben-David, and J. Gehrke, “Detecting Change in Data Streams,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB '04), pp.180-191, 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. 817-840, July 2004.
[18] C. Olston, J. Jiang, and J. Widom, “Adaptive Filters for Continuous Queries over Distributed Data Streams,” Proc. ACM SIGMOD, pp. 563-574, 2003.
[19] V. Paxson and S. Floyd, “Wide Area Traffic: The Failure of Poisson Modeling,” IEEE/ACM Trans. Networking, vol. 3, no. 3, pp. 226-244, 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.57-68, 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. 650-662, 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. 507-516, 2002.
[24] S. Zhu and C. Ravishankar, “Stochastic Consistency, and Scalable Pull-Based Caching for Erratic Data Sources,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 192-203, 2004.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool