Skip to main content

Algorithm to Find the Dependent Variable in Large Virtualized Environment

  • Conference paper
  • First Online:
Proceedings of the First International Conference on Computational Intelligence and Informatics

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 507))

  • 1038 Accesses

Abstract

Virtualized environment generates a large amount of monitoring data; even then it’s very hard to correlate such a monitoring data effectively with underlying virtualized environment, due to its dynamic nature. This paper introduces new method of mapping relationship in a virtualized data center by identifying dependent variables within monitored performance data. Dependent variables have an association relationship which can be measured and validated through statistical calculations. The new algorithm introduced here, automatically searches such relationship between various devices of the virtualized environment. Due to its dynamic nature of the virtualized environment, we have to take a measurement at multiple points of time, any relationship which holds good across these time intervals are considered as dependent variables. These dependent variables are used to characterize the complex interaction of the virtual data center device. Such relationship details can be used to build model to predict the fault occurrence. Paper explains the algorithm and experimental results obtained during our validation phase.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. D. Patterson and A. Brown et al., “Recovery-Oriented Computing (ROC): Motivation, Definition, Techniques, and Case Studies,” Technical Report UCB//CSD-02-1175, UC Berkeley, Dept. of Computer Science, http://www.roc.cs.berkley.edu, 2002.

  2. D. Oppenheimer, A. Ganapathi, and D. Patterson, “Why Do Internet Services Fail, and What Can Be Done about It,” Proc. Fourth Usenix Symp. Internet Technologies and Systems (USITS ’03), pp. 1–16, 2003.

    Google Scholar 

  3. M. Ernst, J. Cockrell, W. Griswold, and D. Notkin, “Dynamically Discovering Likely Program Invariants to Support Program Evolution,” IEEE Trans. Software Eng., vol. 27, no. 2, pp. 99–123, Feb. 2001.

    Google Scholar 

  4. J. Perkins and M. Ernst, “Efficient Incremental Algorithms for Dynamic Detection of Likely Invariants,” Proc. ACM 12th Symp. Foundations of Software Eng. (FSE ’04), pp. 23–32, Nov. 2004.

    Google Scholar 

  5. O. Zaiane, M. Xin, and J. Han, “Discovering Web Access Patterns and Trends by Applying Olap and Data Mining Technology on Web Logs,” Proc. IEEE Forum on Research and Technology Advances in Digital Libraries (ADL ’98), pp. 19–29, Apr. 1998.

    Google Scholar 

  6. J. Srivastava, R. Cooley, M. Deshpande, and P. Tan, “Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data,” ACM SIGKDD Explorations Newsletter, vol. 1, no. 2, pp. 12–23, 2000.

    Google Scholar 

  7. G. Adomavicius and A. Tuzhilin, “Using Data Mining Methods to Build Customer Profiles,” Computer, vol. 34, no. 2, pp. 74–82, 2.

    Google Scholar 

  8. Q. Yang, H. Zhang, and T. Li, “Mining Web Logs for Prediction Models in WWW Caching and Prefetching,” Proc. Seventh ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (KDD ’01), pp. 473–478, 2001.

    Google Scholar 

  9. M. Spiliopoulou, C. Pohle, and L. Faulstich, “Improving the Effectiveness of a Web Site with Web Usage Mining,” Proc. Int’l Workshop Web Usage Analysis and User Profiling (WEBKDD ’99), pp. 142–162, 2000.

    Google Scholar 

  10. M.F. Arlitt and C.L. Williamson, “Web Server Workload Characterization: The Search for Invariants,” ACM SIGMETRICS Performance Evaluation Rev., vol. 24, no. 1, pp. 126–137, 1996.

    Google Scholar 

  11. D. Menasce, V. Almeida, R. Riedi, F. Ribeiro, R. Fonseca, and W. Meira, “In Search of Invariants for E-Business Workloads,” Proc. Second ACM Conf. Electronic Commerce (EC ’00), pp. 56–65, 2000.

    Google Scholar 

  12. N. Jiang, R. Villafane, K. Hua, A. Sawant, and K. Prabkakara, “ADMiRe: An Algebraic Data Mining Approach to System Performance Analysis,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 7, pp. 888–901, Aug. 2005.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. B. Bharath .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media Singapore

About this paper

Cite this paper

Bharath, M.B., Ashoka, D.V. (2017). Algorithm to Find the Dependent Variable in Large Virtualized Environment. In: Satapathy, S., Prasad, V., Rani, B., Udgata, S., Raju, K. (eds) Proceedings of the First International Conference on Computational Intelligence and Informatics . Advances in Intelligent Systems and Computing, vol 507. Springer, Singapore. https://doi.org/10.1007/978-981-10-2471-9_40

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-2471-9_40

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-2470-2

  • Online ISBN: 978-981-10-2471-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics