Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/35972
Title: Combining Time Series Prediction Models Using Genetic Algorithm to Auto-scaling Web Applications Hosted in the Cloud Infrastructure
Authors: Messias, V. R.
Estrella, J. C.
Ehlers, R.
Santana, M. J.
Santana, R. C.
Reiff-Marganiec, Stephan
First Published: 12-Dec-2015
Citation: Neural Computing and Applications (Online first)
Abstract: In a cloud computing environment, companies have the ability to allocate resources according to demand. However, there is a delay that may take minutes between the request for a new resource and it being ready for using. This causes the reactive techniques, which request a new resource only when the system reaches a certain load threshold, to be not suitable for the resource allocation process. To address this problem, it is necessary to predict requests that arrive at the system in the next period of time to allocate the necessary resources, before the system becomes overloaded. There are several time series forecasting models to calculate the workload predictions based on history of monitoring data. However, it is difficult to know which is the best time series forecasting model to be used in each case. The work becomes even more complicated when the user does not have much historical data to be analyzed. Most related work considers only single methods to evaluate the results of the forecast. Other works propose an approach that selects suitable forecasting methods for a given context. But in this case, it is necessary to have a significant amount of data to train the classifier. Moreover, the best solution may not be a specific model, but rather a combination of models. In this paper we propose an adaptive prediction method using genetic algorithms to combine time series forecasting models. Our method does not require a previous phase of training, because it constantly adapts the extent to which the data are coming. To evaluate our proposal, we use three logs extracted from real Web servers. The results show that our proposal often brings the best result and is generic enough to adapt to various types of time series.
DOI Link: 10.1007/s00521-015-2133-3
ISSN: 0941-0643
eISSN: 1433-3058
Links: http://link.springer.com/article/10.1007%2Fs00521-015-2133-3
http://hdl.handle.net/2381/35972
Embargo on file until: 12-Dec-2016
Version: Post-print
Status: Peer-reviewed
Type: Journal Article
Rights: Copyright © 2015, Springer. All rights reserved. The final publication is available at Springer dx.doi.org/10.1007/s00521-015-2133-3
Description: The file associated with this record is under a 12-month embargo from publication in accordance with the publisher's self-archiving policy, available at http://www.springer.com/gp/open-access/authors-rights/self-archiving-policy/2124. The full text may be available through the publisher links provided above.
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
neural_review2.pdfPost-review (final submitted)1.24 MBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.