‎An Artificial Intelligence Framework for Supporting Coarse-Grained Workload Classification in Complex Virtual Environments

Cloud-based machine learning tools for enhanced Big Data applications}‎, ‎where the main idea is that of predicting the ``\emph{next}'' \emph{workload} occurring against the target Cloud infrastructure via an innovative \emph{ensemble-based approach} that combines the effectiveness of different well-known \emph{classifiers} in order to enhance the whole accuracy of the final classification‎, ‎which is very relevant at now in the specific context of \emph{Big Data}‎. ‎The so-called \emph{workload categorization problem} plays a critical role in improving the efficiency and reliability of Cloud-based big data applications‎. ‎Implementation-wise‎, ‎our method proposes deploying Cloud entities that participate in the distributed classification approach on top of \emph{virtual machines}‎, ‎which represent classical ``commodity'' settings for Cloud-based big data applications‎. ‎Given a number of known reference workloads‎, ‎and an unknown workload‎, ‎in this paper we deal with the problem of finding the reference workload which is most similar to the unknown one‎. ‎The depicted scenario turns out to be useful in a plethora of modern information system applications‎. ‎We name this problem as \emph{coarse-grained workload classification}‎, ‎because‎, ‎instead of characterizing the unknown workload in terms of finer behaviors‎, ‎such as CPU‎, ‎memory‎, ‎disk‎, ‎or network intensive patterns‎, ‎we classify the whole unknown workload as one of the (possible) reference workloads‎. ‎Reference workloads represent a category of workloads that are relevant in a given applicative environment‎. ‎In particular‎, ‎we focus our attention on the classification problem described above in the special case represented by \emph{virtualized environments}‎. ‎Today‎, ‎\emph{Virtual Machines} (VMs) have become very popular because they offer important advantages to modern computing environments such as cloud computing or server farms‎. ‎In virtualization frameworks‎, ‎workload classification is very useful for accounting‎, ‎security reasons‎, ‎or user profiling‎. ‎Hence‎, ‎our research makes more sense in such environments‎, ‎and it turns out to be very useful in a special context like Cloud Computing‎, ‎which is emerging now‎. ‎In this respect‎, ‎our approach consists of running several machine learning-based classifiers of different workload models‎, ‎and then deriving the best classifier produced by the \emph{Dempster-Shafer Fusion}‎, ‎in order to magnify the accuracy of the final classification‎. ‎Experimental assessment and analysis clearly confirm the benefits derived from our classification framework‎. ‎The running programs which produce unknown workloads to be classified are treated in a similar way‎. ‎A fundamental aspect of this paper concerns the successful use of data fusion in workload classification‎. ‎Different types of metrics are in fact fused together using the Dempster-Shafer theory of evidence combination‎, ‎giving a classification accuracy of slightly less than $80\%$‎. ‎The acquisition of data from the running process‎, ‎the pre-processing algorithms‎, ‎and the workload classification are described in detail‎. ‎Various classical algorithms have been used for classification to classify the workloads‎, ‎and the results are compared‎

Automating inventory composition management for bulk purchasing cloud brokerage strategy

Cloud providers offer end-users various pricing schemes to allow them to tailor VMs to their needs, e.g., a pay-as-you-go billing scheme, called on-demand, and a discounted contract scheme, called reserved instances. This work presents a cloud broker that offers users both the flexibility of on-demand instances and some discounts found in reserved instances. The broker employs a buy-low-and-sell-high strategy that places user requests into a resource pool of pre-purchased discounted cloud resources. A key challenge to buy-in-bulk-sell-individually cloud broker business models is to estimate user requests accurately and then optimise the stock level accordingly. Given the complexity and variety of the cloud computing market space, the number of the regression model and inherently optimisation search space can be intricate. In this thesis, we propose two solutions to the problem. The first solution is a risk-based decision model. The broker takes a risk-oriented approach to dynamically adjust the resource pool by analysing user request time series data. This approach does not require a training process which is useful at processing the large data stream. The broker is evaluated with high-frequency real cloud datasets from Alibaba. The results show that the overall profit of the broker is closely related to the optimal case. Additionally, the risk factors work as intended. The system hires more reserved instances when it can afford while leaning to the on-demand otherwise. We can also conclude that there is a correlation between the risk factors and the profit. On the other hand, the risk factor possesses some limitations, i.e. manual risk configuration, limited broker setting. Secondly, we propose a broker system that utilises the concept of causal discovery. From the risk-based solution, we can see that if there are parameters correlated with the profit, then by adjusting those parameters, we can manipulate the profit. We infer a function mapping from the extracted key entities of broker data to an objective of a broker, e.g. profit. The technique is similar to the additive noise model, causal discovery method. These functions are assumed to describe an actual underlying behaviour of the profit with respect to the parameters. Similar to the risk-based, we use the Alibaba trace data to simulate long term user requests. Our results show that the system can infer the underlying interaction model between variables unlock the profit model behaviour of the broker system