SlideShare a Scribd company logo
1 of 12
Download to read offline
International Journal of Electrical and Computer Engineering (IJECE)
Vol. 8, No. 6, December 2018, pp. 5359~5370
ISSN: 2088-8708, DOI: 10.11591/ijece.v8i6.pp5359-5370 ๏ฒ 5359
Journal homepage: http://iaescore.com/journals/index.php/IJECE
Prediction Based Efficient Resource Provisioning and Its
Impact on QoS Parameters in the Cloud Environment
Lata J Gadhavi, Madhuri D Bhavsar
Institute of Technology, Nirma University, India
Article Info ABSTRACT
Article history:
Received Jan 23, 2018
Revised Jun 29, 2018
Accepted Jul 24, 2018
The purpose of this paper is to provision the on demand resources to the end
users as per their need using prediction method in cloud computing
environment. The provisioning of virtualized resources to cloud consumers
according to their need is a crucial step in the deployment of applications on
the cloud. However, the dynamical management of resources for variable
workloads remains a challenging problem for cloud providers. This problem
can be solved by using a prediction based adaptive resource provisioning
mechanism, which can estimate the upcoming resource demands of
applications. The present research introduces a prediction based resource
provisioning model for the allocation of resources in advance. The proposed
approach facilitates the release of unused resources in the pool with quality
of service (QoS), which is defined based on prediction model to perform the
allocation of resources in advance. In this work, the model is used to
determine the future workload prediction for user requests on web servers,
and its impact toward achieving efficient resource provisioning in terms of
resource exploitation and QoS. The main contribution of this paper is to
develop the prediction model for efficient and dynamic resource provisioning
to meet the requirements of end users.
Keyword:
Dynamic resource provisioning
Efficient resource provisioning
Resources deployment
Resources exploitation
Workload prediction
Copyright ยฉ 2018 Institute of Advanced Engineering and Science.
All rights reserved.
Corresponding Author:
Lata J Gadhavi,
Institute of Technology,
Nirma University, Ahmedabad, Gujarat, India.
Email: 12extphde92@nirmauni.ac.in
1. INTRODUCTION
In the cloud computing environment, cloud users often have time-changing requirements for virtual
resources. To provision resources for dynamic and uncertain changes in the workload and to react to these
changes accordingly, the cloud provider should manage resources based on the requirement of the users. In
the present study, a workload prediction model for dynamic and efficient resource provisioning is proposed
to manage the number of user requests and the required resources.
One problem with such a resource provisioning scheme is the occurrence of thrashing, in which, due
to frequent variation of the workload (number of job requests), machines can be added and released to meet
each requirement while satisfying the QoS metrics. Solving this problem requires an ability to predict the
incoming workload on the system and to allocate resources a priori by using prediction methods for the
required resources. The main contributions in this paper are; (a) The design of a prediction mechanism and of
the flow of the prediction model for different periods; and (b) The use of prediction methods to determine the
workload based on a historical database.
The rest of the paper is organized as follows. Section II presents a summary of the related work in
this domain. Section III provides the domain analysis for the workload pattern. Section IV introduces the
prediction mechanism. Section V describes the case study used to validate the proposed approach and
๏ฒ ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370
5360
number of job request requirement for resources. In section VI, we present the evaluation results for the
resource provisioning and allocation. Finally, section VII presents the concluding remarks and future scope.
2. RELATED WORK
Cloud computing characterizes the delivery of computation as a service, in which resources, such as
the CPU, software, hardware, information, and devices, are granted to users as services through the Internet.
The characteristics of cloud computing, such as auto-scaling, the provisioning of services based on demand,
and the utility mechanism, has been largely adopted by different analysts [1]. Cloud computing provides a
scalable and flexible platform for providing high-performance computing requirements [2], [3], [4].
However, the pool of resource, flexible service provisioning, and elasticity are not the only potentials of the
cloud. The cloud computing system provisions a homogeneous and heterogeneous operating system
environment by using virtualization.
In the IT industry, multiple cloud providers deliver QoS to end users according to their demand.
However, an issue that emerges from the initial to the deployment stage is the reality that the pattern of
access to the application by various end users varies frequently. As a result, there is an unpredictable number
of users and variable workload during some periods. In a static and inefficient resource provisioning
mechanism, during periods of low demand for resources, there will be an overload of obtainable resources,
whereas during periods of high demand, the available resources will be inadequate. This issue leads to poor
QoS and high costs. A current research challenge is to develop an adaptive method of resource provisioning
in terms of cost and performance.
Cloud computing can address the above challenge by provisioning resources dynamically and
effectively to end-user applications based on the prediction of workload and resources according to the user
request arrival rate and the service response rate. This means that additional resources can be provided during
periods of high demand and released during periods of low demand, without loss of QoS to end users [5] The
challenge with such a dynamic resource provisioning strategy is the determination of the proper quantity of
resources to be set up and provisioned in a particular period to meet the expected QoS for a variable
workload. An ideal solution would require the capability to predict the incoming workload and required
resources in advance.
The expected outcome is the determination of the number of virtual machines that should be created,
configured, and provided to handle the variable workload. This challenge has been addressed through various
ways, such reactive [6], proactive [6], and predictive [7] approaches. Effective resource provisioning is not
an easy and uncomplicated task. To meet the above requirements, the following criteria should be considered
in developing the algorithm: (a) the computation of the user request rate, (b) the minimization of the request
rejection rate, (c) the average response time and the number of requests timed out, (d) the percentage of timed
out requests (PTOR) for a number of users, and (e) the accurate computation in advance of the resources
required for a variable workload. The current research presents an efficient and effective resource
provisioning algorithm that uses a prediction technique to provision and remove resources dynamically.
A strategy to improve the resource utilization is proposed and compared with the conventional approach.
3. DOMAIN ANALYSIS
The cloud computing format is mainly described by using three service models: (a) Infrastructure as
a Service (IaaS), which explains about the resources offering procedures by cloud providers; (b) Platform as
a Service (PaaS), which describes how cloud providers provide an entire cloud environment implemented
and deployed in a certain programming language for a speci๏ฌc type of applications; and (c) Software as a
Service (SaaS), which refers to applications that can be offered to customers according to their need. The
deployed cloud models are mainly classified into four forms: (a) public cloud, which is available for
everyone; (b) private cloud, which is hosted solely for one industry; (c) community cloud, which is a cloud
environment made accessible only to a certain group of industry or individuals in collaboration; and (d)
hybrid cloud, which refers to various clouds that are interconnected with the hosted applications deployed in
the cloud environment [8]. In the present work, the term โ€œworkloadโ€ refers to the number of arrived requests
to access the resource of the cloud system.
The application or jobs are need to be switched automatically which are accessed by users. In the
cloud computing scenario, the workload category, cloud service models, and deployment models are
interconnected with each other, as shown in Figure. 1. The application workload pattern describes diverse
user behaviors, which result in the utilization of IT resources in variable forms. The workload can be
determined based on the number of user requests, the load calculation on the servers, the network traffic, and
the data storage [9]. In the cloud computing environment, the resource provisioning depends on the incoming
Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ
Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi)
5361
workload [10]. For the prediction of the workload and resources in this study, the workload patterns are
categorized based on the incoming workload, which includes the number of user requests, the amount of
work over a specified period, the user request arrival rate, and the time between two consecutive requests
(inter-arrival time). According to the above characteristics, the workload is categorized into the five types:
static, periodic, unpredictable, continuously changing, and once in a lifetime [11].
3.1. Static Workload
The workload for resources with corresponding or equal usage of a hosted application is called static
workload. In this workload type, there is no requirement to increase or decrease the processing power,
network bandwidth, data storage, or memory because the workload is constant. A static workload does not
require the functionality of the cloud, such as elasticity. Private Websites and wikis are examples of sites
with a static workload.
3.2. Periodic Workload
Periodic jobs are very common in our daily routine. Yearly income tax pay, monthly utility bills,
traffic during rush hours etc are the examples of periodic tasks or jobs. It is observed that in the same
interval, many people using these tasks. During such periodic tasks, it is difficult to provide enough resources
for the peak load and to handle the unused resources for the non-peak load. This problem leads to over- or
under-provisioning of resources to the hosted application. Periodic tasks occur at the same interval of the day,
month, or year; however, they consist of a higher number of requests over a peak period. A periodic
workload often requires elasticity and scalability to handle the number of requests during the peak intervals.
The computimg workload pattern is depicted on Figure 1.
Figure 1. The Cloud Computing Workload Pattern
3.3. Unpredictable Workload
Similarly to a periodic workload, an unpredictable workload consists of increasing and decreasing
incoming workloads from the users. This workload is described as unpredictable because the variations occur
randomly. As a result, cloud providers have to deal with the unstructured and unplanned provisioning of
resources to meet the changing requirements. Accurate prediction is the main challenge to obtaining the
scaling requirements for resources for an unpredicted workload. To achieve accurate results, constant
observation of the workload is required for example, unpredictable traffic, forecasting etc.
๏ฒ ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370
5362
3.4. Continuously Changing Workload
The resource utilization may be maximized or minimized over time, and the workload may change
continuously. For many applications, there may be long-term changes in the workload. A continuously
changing workload can be considered as a constant escalation or declination of the resource utilization. The
elasticity of the cloud enables the provisioning or decommissioning of resources for a continuously
changing workload.
3.5. Once-in-a-lifetime Workload
The peak workload utilization may occur only once in a lifetime when the resources are distributed
equally. In such a special case, the resource provisioning and decommissioning can often be a manual or
dynamic task at a known point in time.
4. PREDICTION MECHANISM
To predict the incoming workload and to identify the workload type, the user requests have to be
analyzed. An analysis of the historical database is also needed to meet the resource requirements a priori.
Based on the user requests and their need analysis are considered for hosted application. Figure 2 shows the
procedure of prediction at time t-1 and interval t. The previous period for interval (t-1) and the live period for
interval t are observed for a number of active users. The resource requirements for the observed period are
monitored, collected, and entered into the historical database after the procedure. Based on the database, the
workload for time intervals t-1 and t are calculated, and prediction methods are applied to determine the
workload for the next period (t+1).
Figure 2. The Flow of the Prediction Model
Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ
Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi)
5363
As shown in the above Figure 2, prediction of workload for the resource demands is described in different
interval. For time interval t โˆ’ 1, the mean CPU, RAM workload, and number of active users are calculated as
follows:
ฮฑ ๐šโˆ’1(cpu)
๐š–
= CPU Workload Mean at the interval t โˆ’ 1
ฮฒ ๐šโˆ’1(RAM)
๐š–
= RAM Workload Mean at the interval t โˆ’ 1
ฮณ ๐šโˆ’1(active user)
๐š–
= Mean number of active users at time t โˆ’ 1
ฮป ๐šโˆ’1
๐š–โ€ฒ
=For whole scenario at time t-1 (1)
For time interval t, the mean CPU, RAM workload, and number of active users are calculated as follows:
ฮฑ ๐š(cpu)
๐š–
= Mean of CPU Workload at time t
ฮฒ ๐š(RAM)
๐š–
= Mean of RAM Workload at time t
ฮณ ๐š(active user)
๐š–
= Mean of number of active users at time t
ฮป ๐š
๐š–โ€ฒ
=For whole scenario at time t (2)
To consider the workload at the initial level, a pseudo-code is described in Algorithm 1.
Algorithm 1: Initial Level
Input: Number of requests
Requirement: Calculation of the inter arrival time for the periods ๐š-1 and ๐š period
1.Begin.
2. Monitor active user requests
3. While (time interval is ๐š-1).
4. Calculate the inter arrival time of active users.
5. For (each inter arrival time in period ๐š-1).
6. Monitor workload
7. Calculate mean value ฮป ๐šโˆ’1
๐š–โ€ฒ
for week1.
8. For (each inter arrival time of ๐š period).
9. Monitor the workload.
10. Calculate the mean value ฮป ๐š
๐š–โ€ฒ
for week2.
11. End for
12. End for
13.End.
Now for each week of the month, calculate the mean value of the workload and predict for next week based
on current and the historical database. Thus, the predicted value for time ๐š+ n is:
ฮป ๐š+ n
๐š–
= ฮป ๐šโˆ’1
๐š–โ€ฒ
+ ฮป ๐š
๐š–โ€ฒ
+ ฮป ๐š+1
๐š–โ€ฒ
+ โ‹ฏ + ฮป ๐š+(nโˆ’1)
๐š–โ€ฒ
(3)
ฮป ๐š+ n
๐š–
= โˆ‘ ฮป ๐š–โ€ฒ๐š+(nโˆ’1)
๐šโˆ’1 (4)
(3) and (4) express the summation of the previous workload to predict the resource demands for the next
period. The pseudo-code for the workload prediction is presented in Algorithm 2.
Algorithm 2: Workload Prediction
Input: Number of requests
Requirement: Calculation of the mean CPU, RAM, and number of active users at time interval ๐š-1 and
period ๐š
1.Begin.
2.Monitor the number of active user requests at time ๐š-1 and period ๐š.
3.Calculate ฮป ๐šโˆ’1
๐š–โ€ฒ
and ฮป ๐š
๐š–โ€ฒ
// by using (1) and (2).
4.For each week, calculate the mean workload.
5. Predict the workload for the next week ๐š+ n, โˆ‘ ฮป ๐š–โ€ฒ๐š+(nโˆ’1)
๐šโˆ’1 .
6.End for.
7.End.
๏ฒ ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370
5364
To allocate resources to the job, in this section number of job identification are considered for various regions
as shown in the Figure. 3.
Figure 3. The Flow of the Resource Allocation
๏‚ท Determination of the number of requests:
Job profile:
๏‚ง ๏ป ๏ฝnit jjJ ,......,๏€ฝ , where i=1...n, and tJ is number of jobs for the current time
๏‚ง ๏€จ ๏€ฉ ๏€จ ๏€ฉ ๏€จ ๏€ฉ ๏€จ ๏€ฉ๏ป ๏ฝLLocationAIPaddDDateTTimej ,,,1 ๏€ฝ
๏‚ง Let ๏€จ ๏€ฉ,.......,, 321 TTTT ๏€ฝ time series
๏‚ง ๏€จ ๏€ฉ...., 21 ddD ๏€ฝ Date of request arrived
๏‚ง ๏€จ ๏€ฉ ๏€จ ๏€ฉ๏ป ๏ฝnnii crcrL ,,........,๏€ฝ , where L is the location of the arrived request
๏‚ง cr, Region and country, respectively
Total number of job requests from one region= R
๏ƒฅ ๏€ฝR Number of requests per region (5)
Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ
Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi)
5365
Figure 4. Number of Requests by Region
Figure 4 shows the number of job requests by region (R). Different prediction models are applied for
the resource requirements in various periods, including the first and second moving average (FSMA),
weighted moving average (WMA), and exponential moving average (EMA) models [11]. The historical data
and prediction model output are used as input data, which are trained to improve the accuracy of the resource
provisioning strategy. The prediction model uses the output of the predicted value to provision the resources.
At the same time, provisioned resources results will be stored in the historical database repository for future
prediction. The prediction is done by applying various moving average methods. In particular, the moving
average methods FSMA and WMA are recommended to consider non-fluctuations in the short-term demand,
as shown in our previous work [12]. An ontology-based dynamic resource provisioning for public cloud was
implemented in the previous work [13].
First and Second Moving Average (FSMA) method:
In the first moving average method, the ith
user request for resource at time interval t is measured,
and N is considered as a moving average period for time interval t [9], as described in (6):
๐น๐‘ก+1 =
(๐‘ฆ ๐‘ก (๐‘–)+๐‘ฆ ๐‘กโˆ’1 (๐‘–)+โ‹ฏ+ ๐‘ฆ ๐‘กโˆ’๐‘› (๐‘–))
๐‘
(6)
Here, y is considered as the original value for each period, and t is regarded as the current period. In (6), Ft+1
denote the first moving average value for the ith
user at time t+1. The resource requirement of the ith
user at
time t+ฮด can be predicted as:
๐‘ฆ๐‘ก+๐›ฟ(i) = ๐ด ๐‘ก(i)+๐›ฟ๐ต๐‘ก(๐‘–) (7)
where ฮด is the predicted time sequence number, and ๐‘ฆ๐‘ก+๐›ฟ denotes the predicted value at time ๐‘ฆ๐‘ก+๐›ฟ, as shown
in (7). Then, to predict the ๐‘ฆ๐‘ก+๐›ฟ value, the second moving average value can be measured by applying (8):
๐‘†๐‘ก+1 =
๐น๐‘ก+1 (๐‘–)+๐น๐‘ก (๐‘–)+โ‹ฏ+๐น ๐‘กโˆ’(๐‘โˆ’1) (๐‘–)
๐‘
(8)
In (7), ๐ด ๐‘ก(๐‘–) and ๐ต๐‘ก(๐‘–) are calculated by using (9) and (10):
๐ด ๐‘ก(๐‘–) = 2๐น๐‘ก+1 (๐‘–) โˆ’ ๐‘†๐‘ก+1 (๐‘–) (9)
๐ต๐‘ก(๐‘–) =
2๐น๐‘ก+1 (๐‘–)โˆ’๐‘† ๐‘ก+1 (๐‘–)
๐‘โˆ’1
(10)
๏ฒ ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370
5366
Based on the above equation, the total number of resource requirements for n users is measured as:
๐‘ฆ๐‘ก+๐›ฟ = (11)
The total number of resources requested by all the n users at time ๐‘ก + ๐›ฟ can be calculated, and the predicted
value at time periods ๐‘ก and ๐‘ก + ๐›ฟ for for all users can be determined by using equation. (11). Further, the
resources are allocated to the users according to their actual need and based on the predicted value, and the
results are compared.
Weighted Moving Average Method (WMA):
Whereas the first and second moving average model allocates the same weight to each element of
the moving average database, the weighted moving average model allows any weight to be placed on each
element, and the sum of all weights equals 1 [11]. Here, the active user requests and the utilization of
resources for period Ft are described in (12):
F ๐‘ก = W๐‘– A ๐‘กโˆ’๐‘– + W๐‘–+1 A ๐‘กโˆ’(๐‘–+1) + โ€ฆ . W๐‘› A ๐‘กโˆ’๐‘› (12)
Where Ft = the forecast for the coming period,
n=the total number of periods in the forecast,
Ai = the actual occurrence for the period t-i,
Here, โˆ‘ W๐‘– = 1๐‘›
๐‘–=1
๐‘Š๐‘€๐ด
= โˆ‘((๐‘Š๐‘’๐‘–๐‘”โ„Ž๐‘ก ๐‘“๐‘œ๐‘Ÿ ๐‘๐‘’๐‘Ÿ๐‘–๐‘œ๐‘‘ ๐‘›)โˆ’(๐‘‘๐‘’๐‘š๐‘Ž๐‘›๐‘‘ ๐‘–๐‘› ๐‘๐‘’๐‘Ÿ๐‘–๐‘œ๐‘‘ ๐‘›))
โˆ‘ ๐‘Š๐‘’๐‘–๐‘”โ„Ž๐‘ก๐‘ 
(13)
Exponential Moving Average Method(EMA):
The exponential moving average (EMA) method is mainly logical and is the easiest approach for
predicting fluctuations in the short-term demand. This method is effective for both short-term and time-series
prediction. As each new piece of data is added, the oldest observation is dropped, and a new forecast is
calculated [14]. The predicted values are calculated by using the smoothing constant ฮฑ. The EMA method is
expressed as:
F ๐‘ก = F ๐‘กโˆ’1 + ฮฑ (A ๐‘กโˆ’1 โˆ’ F ๐‘กโˆ’1)
F ๐‘ก = ฮฑ A ๐‘กโˆ’1) + (1 โˆ’ ฮฑ ) F ๐‘กโˆ’1 (14)
where F ๐‘ก is the exponentially smoothed forecast for previous period t
F ๐‘กโˆ’1 is the exponentially smoothed forecast made for the prior period,
A ๐‘กโˆ’1 = The actual demand in the prior period,
ฮฑ = The desired response rate or smoothing constant, 0< ฮฑ < 1
This method gives to a higher weight to the later measured value and a lower weight to the earlier
measured value. The EMA method is able to respond quickly to fluctuations in the short-term demand. If
request from active user is greater than the defined period then it will be considered in the long-term period
and if it is less than then it will be considered as a short term period. Long-term and short-term periods are
defined as Lt and St, respectively.
5. NUMBER OF JOB REQUEST REQUIREMENT FOR RESOURCES
Here, the numbers of requests from various regions are calculated, as shown in (1) and (2). The
number of arrived user requests in the deployed cloud for education is evaluated, as shown in our previous
work, and the availability of resources in the specified regions is determined. The available resources are
generated and monitored by using the commercial Amazon EC2 cloud platform [15, 16, 17]. The capability
of the available VMs is calculated; then, the numbers of job requests are allocated to the resources. Once the
numbers of jobs are allocated to the VMs, the current load is calculated. If the VM becomes over- or under-
loaded, resources are automatically added or released as necessary. The whole procedure is described below.
Let VM={VM1,VM2,VM3,โ€ฆ,VMN} be a set of N virtual machines and
Task (number of job requests) = {task1, task2, task3, โ€ฆ, K} of K task to be regular and processed in VM.
Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ
Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi)
5367
Here, the fitness of the number of requests (i) may be determined by the capacity of VMj, which is
calculated by using (15):
(15)
job type length shows the how many tasks are submitted on VMj with the calculation of capacity of specific
VM to handle submitted jobs. The capacity of the VM is measured by applying (16):
(16)
where Num_proc is the number of processors in the VM, Num_MIPS indicates the number of MIPS, and
BW_VM represents bandwidth of the VM.
(17)
In (17), the input file length is also considered to determine the length of the job before execution. Tasks are
assigned to the virtual machine by using the most effective fitness value from the (17).
Load Calculation: When tasks are submitted to the beneath loaded VM, the present work of all offered VM
will be measured by victimization of knowledge which is received from the database [18]. To calculate the
deviations in load variance on VMs, the following standard deviation (SD) (18) is used:
(18)
where Xj is the processing time of the VM, as described in (19):
(19)
Then, the mean processing times for all VMs are calculated by applying (20):
(20)
If the SD of the loaded VM is smaller than or equal to the mean, then the system is in a balanced
state. On the other hand, if the SD is higher than the mean, then the system is in imbalance, and the auto-
scaling mechanism for resource provisioning will be applied. Here, one VM is considered to be capable of
serving 50 requests at a time. Thus, when the number of requests >= 50, then scale up new instance and
migrate requests on new instance. It is refreshing arrival of request for every 1 minute. Based on the
predicted value, the resources are scaled up or down according to the predicted demand. The pseudo-code for
scaling up and down is shown in Algorithm 3.
๏ฒ ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370
5368
Algorithm 3: Scaling up and down____________________________________
Begin.
Monitor ฮป ๐šโˆ’1
๐š–โ€ฒ
and ฮป ๐š
๐š–โ€ฒ
for the previous and the current time, respectively.
Predict workload ฮป ๐š+ n
๐š–
at time ๐š + n.
Let R= ri แดœ ri+1 แดœ ri+2 แดœ ri+3..... แดœ rm before scaling, where R is the set of virtual resources.
Let ฮป ๐š+ n
๐š–
= โˆ‘ ฮป ๐š–โ€ฒ๐š+(nโˆ’1)
๐šโˆ’1 = x.
Let ฮป ๐š+(nโˆ’1)
๐š–โ€ฒ
= y.
If > y, then // the workload increases.
Add r into the R (scale up the virtual resource);
else if < , then // the workload decreases.
Remove extra r from R (scale down the virtual resource);
else.
Refresh the resources.
End.
6. RESULTS OF THE QoS METRICS FOR RESOURCE ALLOCATION
Figure 6 shows the efficient resource provisioning with the use of the prediction model achieves
maximum CPU utilization compared with the existing (conventional) cloud. Here, the average CPU
utilization is obtained for 50 requests on the conventional cloud and 100 requests on the efficient cloud. The
results indicate that the efficient cloud uses a minimum number of instances but provides maximum
utilization. Figure 7 shows that an efficient response time is obtained for 50 requests on the conventional
cloud and 100 requests on the efficient cloud. Figure 8 indicates that efficient resource provisioning with the
use of the prediction model achieves the maximum throughput compared with the existing (conventional)
cloud. Here, the average throughput is measured for 50 requests on the conventional cloud and 100 requests
on the efficient cloud. The results show that the efficient cloud uses a minimum number of instances but
provides the maximum throughput.
Figure 6. Average CPU utilization for 50 requests on the conventional and 100 requests on the efficient cloud
Figure 7. Response time for 50 requests on the conventional cloud and 100 requests on the efficient cloud
Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ
Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi)
5369
Figure 8. Average throughputs for 50 requests on the conventional and 100 requests on the efficient cloud
7. CONCLUSIONS AND FUTURE WORK
In this research, the design of a prediction model for efficient resource provisioning is presented. A
prediction model is an essential part of the cloud environment, in which it is used to predict the number of
user requests and the corresponding resource requirements. In the present work, the FSMA, WMA, and EMA
models are used to predict the number of user requests for cloud resources. The cloud environment is set up
on the EC2 AWS cloud. In addition, the auto-scaling algorithm is used in resource provisioning based on the
prediction model. The experimental results of the QoS parameters are presented and compared between the
conventional cloud and the efficient cloud before and after prediction. Based on the findings, the proposed
prediction model has higher efficiency in resource allocation.
In future works, we will apply the ARIMA model to improve the prediction accuracy for resource
provisioning. Further, we plan to integrate the architecture for adaptive resource provisioning by using the
workload prediction strategy.
REFERENCES
[1] C. Ji, Y. Li, W. Qiu, U. Awada. โ€œBig data processing in cloud computing environmentsโ€, in Pervasive Systems,
Algorithms and Networksโ€™ (ISPAN), 12th
International Symposium on. , pp.17โ€“23. IEEE 2012.
[2] Changlong Li, Hang Zhuang, Kun Lu, Mingming Sun, Jinhong Zhou, Dong Dai, Xuehai Zhou. โ€œAn adaptive auto-
con๏ฌguration tool for Hadoopโ€, 19th International Conference on Engineering of Complex Computer Systems.
Pp.69-72. IEEE. 2014.
[3] Ficco, M. โ€œSecurity event correlation approach for cloud computingโ€, International Journal of High Performance
Computing and Networking (IJHPCN) 7(3). 2013.
[4] M. Banu, A. Aranganathan. โ€œStudy of Load Optimization and Performance Issues in Cloudโ€, Indonesian Journal of
Electrical Engineering and Computer Science (IJEECS), vol 11, no 3, 2018.
[5] M. Armbrust, A. Fox, R. Grif๏ฌth, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica,
M. Zaharia. โ€œA view of cloud computing, communicationโ€, vol. 53, no. 4, pp. 50โ€“58. ACM. 2010.
[6] Laura R. Moore, Kathryn Bean and Tariq Ellahi. โ€œTransforming Reactive Auto-scaling into Proactive Auto-scalingโ€,
CloudDP โ€™13, ACM. 2013.
[7] Rodrigo N. Calheiros, Enayat Masoumi, Rajiv Ranjan, Rajkumar Buyya. โ€œWorkload Prediction Using ARIMA
Model and Its Impact on Cloud Applicationsโ€™ QoSโ€, IEEE Transactions on cloud computing, Vol 3. No.4.IEEE.
2015.
[8] H. Muhasin, R. Atan, M.A. Jabar, S. Abdullah. โ€œThe Factors Affecting on Managing Sensitive Data in Cloud
Computingโ€, Indonesian Journal of Electrical Engineering and Computer Science (IJEECS), vol 11, no 3,2018.
[9] C. Fehling, F. Leymann, R. Retter, W. Schupeck, P. Arbitter. โ€œCloud Computing Patterns: Fundamentals to Designโ€,
Build, and Manage Cloud Applications, vol. XXVI, pp1-367, Springer. 2014.
[10] T. Zaidi, R. Rampratap. โ€œVirtual Machine Allocation Policy in Cloud Computing Environment using CloudSimโ€,
International Journal of Electrical and Computer Engineering (IJECE), vol 8, no 1, 2018.
[11] Petropoulos, F., Kourentzes, N. โ€œForecast combinations for intermittent demandโ€, Journal of the Operational
Research Society, 66 (6), 914โ€“924. 2015.
[12] Lata Gadhavi, Madhuri Bhavsar. โ€œEfficient and Dynamic Resource Provisioning Strategy for Data Processing Using
Cloud Computingโ€, International Review on Computers and Software (I.RE.CO.S.), Vol. 11, No. 8. 2016.
๏ฒ ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370
5370
[13] Lata Gadhavi, VIshakha Modi, Madhuri Bhavsar, โ€œProposed Ontology Framework for Dynamic Resource
Provisioning on Public Cloudโ€, International Journal of Advanced Research in Engineering and Technology
(IJARET) Volume 7, Issue 2, March-April 2016, pp. 118โ€“131.
[14] Fiorucci, J. A., Pellegrini, T. R., Louzada, F., Petropoulos, F., Koehler, A. B. โ€œModels for optimising the theta
method and their relationship to state space modelsโ€, International Journal of Forecasting, 32 (4), 1151โ€“1161.
2016.
[15] K. Kalyana Chakravarthi, Vaidhehi Vijayakumar. โ€œWorkflow Scheduling Techniques and Algorithms in IaaS
Cloud: A Surveyโ€, International Journal of Electrical and Computer Engineering (IJECE), vol 8, no 2, 2018.
[16] Marco A. S. Netto, Rodrigo N. Calheiros, Eduardo R. Rodrigues, Renato L. F. Cunha, and Rajkumar Buyya. โ€œHPC
Cloud for Scientific and Business Applications: Taxonomy, Vision, and Research Challengesโ€. ACM Comput.
Surv. 51, 1, Article 8, 2018.
[17] Lindstrom, J. Hermanson, A. Blomstedt, F. Kyosti, P. โ€œA Multi-Usable Cloud Service Platform: A Case Study on
Improved Development Pace and Efficiencyโ€. Appl. Sci., 8, 316, 2018.
[18] S. K. Suresh, J.R. Kannan. โ€œReview of Advancements in Multi-tenant Framework in Cloud Computingโ€, Indonesian
Journal of Electrical Engineering and Computer Science (IJEECS), vol 11, no 3, 2018.

More Related Content

What's hot

Blockchain enabled task and time sheet management for accounting services pro...
Blockchain enabled task and time sheet management for accounting services pro...Blockchain enabled task and time sheet management for accounting services pro...
Blockchain enabled task and time sheet management for accounting services pro...Conference Papers
ย 
Information Technology for the success of Infrastructure Projects
Information Technology for the success of Infrastructure ProjectsInformation Technology for the success of Infrastructure Projects
Information Technology for the success of Infrastructure ProjectsVSR *
ย 
A Secure Model for Cloud Computing Based Storage and Retrieval
A Secure Model for Cloud Computing Based Storage and  RetrievalA Secure Model for Cloud Computing Based Storage and  Retrieval
A Secure Model for Cloud Computing Based Storage and RetrievalIOSR Journals
ย 
Reminiscing cloud computing technology
Reminiscing cloud computing technologyReminiscing cloud computing technology
Reminiscing cloud computing technologyeSAT Publishing House
ย 
Data Security in Cloud Computing Using Linear Programming
Data Security in Cloud Computing Using Linear ProgrammingData Security in Cloud Computing Using Linear Programming
Data Security in Cloud Computing Using Linear ProgrammingIOSR Journals
ย 
Addressing the cloud computing security menace
Addressing the cloud computing security menaceAddressing the cloud computing security menace
Addressing the cloud computing security menaceeSAT Publishing House
ย 
Priority Based Prediction Mechanism for Ranking Providers in Federated Cloud ...
Priority Based Prediction Mechanism for Ranking Providers in Federated Cloud ...Priority Based Prediction Mechanism for Ranking Providers in Federated Cloud ...
Priority Based Prediction Mechanism for Ranking Providers in Federated Cloud ...IJERA Editor
ย 
Advance Computing Paradigm with the Perspective of Cloud Computing-An Analyti...
Advance Computing Paradigm with the Perspective of Cloud Computing-An Analyti...Advance Computing Paradigm with the Perspective of Cloud Computing-An Analyti...
Advance Computing Paradigm with the Perspective of Cloud Computing-An Analyti...Eswar Publications
ย 
Review of big data analytics (bda) architecture trends and analysis
Review of big data analytics (bda) architecture   trends and analysis Review of big data analytics (bda) architecture   trends and analysis
Review of big data analytics (bda) architecture trends and analysis Conference Papers
ย 
Implementing Proof of Retriavaibility for Multiple Replica of Data File using...
Implementing Proof of Retriavaibility for Multiple Replica of Data File using...Implementing Proof of Retriavaibility for Multiple Replica of Data File using...
Implementing Proof of Retriavaibility for Multiple Replica of Data File using...IRJET Journal
ย 
Security Issues in Cloud Computing Solution of DDOS and Introducing Two-Tier ...
Security Issues in Cloud Computing Solution of DDOS and Introducing Two-Tier ...Security Issues in Cloud Computing Solution of DDOS and Introducing Two-Tier ...
Security Issues in Cloud Computing Solution of DDOS and Introducing Two-Tier ...ijccsa
ย 
Cloud Computing Presentation
Cloud Computing PresentationCloud Computing Presentation
Cloud Computing Presentationmhalcrow
ย 
IEEE Cloud computing 2016 Title and Abstract
IEEE Cloud computing 2016 Title and AbstractIEEE Cloud computing 2016 Title and Abstract
IEEE Cloud computing 2016 Title and Abstracttsysglobalsolutions
ย 
Cloud Computing- Proposal (Autosaved)
Cloud Computing- Proposal (Autosaved)Cloud Computing- Proposal (Autosaved)
Cloud Computing- Proposal (Autosaved)Zuhair Haroon khan
ย 

What's hot (15)

Blockchain enabled task and time sheet management for accounting services pro...
Blockchain enabled task and time sheet management for accounting services pro...Blockchain enabled task and time sheet management for accounting services pro...
Blockchain enabled task and time sheet management for accounting services pro...
ย 
Information Technology for the success of Infrastructure Projects
Information Technology for the success of Infrastructure ProjectsInformation Technology for the success of Infrastructure Projects
Information Technology for the success of Infrastructure Projects
ย 
A Secure Model for Cloud Computing Based Storage and Retrieval
A Secure Model for Cloud Computing Based Storage and  RetrievalA Secure Model for Cloud Computing Based Storage and  Retrieval
A Secure Model for Cloud Computing Based Storage and Retrieval
ย 
Reminiscing cloud computing technology
Reminiscing cloud computing technologyReminiscing cloud computing technology
Reminiscing cloud computing technology
ย 
Data Security in Cloud Computing Using Linear Programming
Data Security in Cloud Computing Using Linear ProgrammingData Security in Cloud Computing Using Linear Programming
Data Security in Cloud Computing Using Linear Programming
ย 
Addressing the cloud computing security menace
Addressing the cloud computing security menaceAddressing the cloud computing security menace
Addressing the cloud computing security menace
ย 
Priority Based Prediction Mechanism for Ranking Providers in Federated Cloud ...
Priority Based Prediction Mechanism for Ranking Providers in Federated Cloud ...Priority Based Prediction Mechanism for Ranking Providers in Federated Cloud ...
Priority Based Prediction Mechanism for Ranking Providers in Federated Cloud ...
ย 
50120140507005 2
50120140507005 250120140507005 2
50120140507005 2
ย 
Advance Computing Paradigm with the Perspective of Cloud Computing-An Analyti...
Advance Computing Paradigm with the Perspective of Cloud Computing-An Analyti...Advance Computing Paradigm with the Perspective of Cloud Computing-An Analyti...
Advance Computing Paradigm with the Perspective of Cloud Computing-An Analyti...
ย 
Review of big data analytics (bda) architecture trends and analysis
Review of big data analytics (bda) architecture   trends and analysis Review of big data analytics (bda) architecture   trends and analysis
Review of big data analytics (bda) architecture trends and analysis
ย 
Implementing Proof of Retriavaibility for Multiple Replica of Data File using...
Implementing Proof of Retriavaibility for Multiple Replica of Data File using...Implementing Proof of Retriavaibility for Multiple Replica of Data File using...
Implementing Proof of Retriavaibility for Multiple Replica of Data File using...
ย 
Security Issues in Cloud Computing Solution of DDOS and Introducing Two-Tier ...
Security Issues in Cloud Computing Solution of DDOS and Introducing Two-Tier ...Security Issues in Cloud Computing Solution of DDOS and Introducing Two-Tier ...
Security Issues in Cloud Computing Solution of DDOS and Introducing Two-Tier ...
ย 
Cloud Computing Presentation
Cloud Computing PresentationCloud Computing Presentation
Cloud Computing Presentation
ย 
IEEE Cloud computing 2016 Title and Abstract
IEEE Cloud computing 2016 Title and AbstractIEEE Cloud computing 2016 Title and Abstract
IEEE Cloud computing 2016 Title and Abstract
ย 
Cloud Computing- Proposal (Autosaved)
Cloud Computing- Proposal (Autosaved)Cloud Computing- Proposal (Autosaved)
Cloud Computing- Proposal (Autosaved)
ย 

Similar to Prediction Based Efficient Resource Provisioning and Its Impact on QoS Parameters in the Cloud Environment

A latency-aware max-min algorithm for resource allocation in cloud
A latency-aware max-min algorithm for resource  allocation in cloud A latency-aware max-min algorithm for resource  allocation in cloud
A latency-aware max-min algorithm for resource allocation in cloud IJECEIAES
ย 
QoS Based Scheduling Techniques in Cloud Computing: Systematic Review
QoS Based Scheduling Techniques in Cloud Computing: Systematic ReviewQoS Based Scheduling Techniques in Cloud Computing: Systematic Review
QoS Based Scheduling Techniques in Cloud Computing: Systematic ReviewIJCSIS Research Publications
ย 
Allocation Strategies of Virtual Resources in Cloud-Computing Networks
Allocation Strategies of Virtual Resources in Cloud-Computing NetworksAllocation Strategies of Virtual Resources in Cloud-Computing Networks
Allocation Strategies of Virtual Resources in Cloud-Computing NetworksIJERA Editor
ย 
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTINGGROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTINGAIRCC Publishing Corporation
ย 
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTINGGROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTINGijcsit
ย 
A survey on various resource allocation policies in cloud computing environment
A survey on various resource allocation policies in cloud computing environmentA survey on various resource allocation policies in cloud computing environment
A survey on various resource allocation policies in cloud computing environmenteSAT Journals
ย 
A survey on various resource allocation policies in cloud computing environment
A survey on various resource allocation policies in cloud computing environmentA survey on various resource allocation policies in cloud computing environment
A survey on various resource allocation policies in cloud computing environmenteSAT Publishing House
ย 
An efficient resource sharing technique for multi-tenant databases
An efficient resource sharing technique for multi-tenant databases An efficient resource sharing technique for multi-tenant databases
An efficient resource sharing technique for multi-tenant databases IJECEIAES
ย 
PROPOSED ONTOLOGY FRAMEWORK FOR DYNAMIC RESOURCE PROVISIONING ON PUBLIC CLOUD
PROPOSED ONTOLOGY FRAMEWORK FOR DYNAMIC RESOURCE PROVISIONING ON PUBLIC CLOUDPROPOSED ONTOLOGY FRAMEWORK FOR DYNAMIC RESOURCE PROVISIONING ON PUBLIC CLOUD
PROPOSED ONTOLOGY FRAMEWORK FOR DYNAMIC RESOURCE PROVISIONING ON PUBLIC CLOUDIAEME Publication
ย 
Iaetsd effective fault toerant resource allocation with cost
Iaetsd effective fault toerant resource allocation with costIaetsd effective fault toerant resource allocation with cost
Iaetsd effective fault toerant resource allocation with costIaetsd Iaetsd
ย 
IRJET- Optimization of Completion Time through Efficient Resource Allocation ...
IRJET- Optimization of Completion Time through Efficient Resource Allocation ...IRJET- Optimization of Completion Time through Efficient Resource Allocation ...
IRJET- Optimization of Completion Time through Efficient Resource Allocation ...IRJET Journal
ย 
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTINGA SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTINGijccsa
ย 
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTINGA SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTINGijccsa
ย 
A Survey on Resource Allocation in Cloud Computing
A Survey on Resource Allocation in Cloud ComputingA Survey on Resource Allocation in Cloud Computing
A Survey on Resource Allocation in Cloud Computingneirew J
ย 
Pre-allocation Strategies of Computational Resources in Cloud Computing using...
Pre-allocation Strategies of Computational Resources in Cloud Computing using...Pre-allocation Strategies of Computational Resources in Cloud Computing using...
Pre-allocation Strategies of Computational Resources in Cloud Computing using...ijccsa
ย 
A compendium on load forecasting approaches and models
A compendium on load forecasting approaches and modelsA compendium on load forecasting approaches and models
A compendium on load forecasting approaches and modelseSAT Publishing House
ย 
Hybrid Based Resource Provisioning in Cloud
Hybrid Based Resource Provisioning in CloudHybrid Based Resource Provisioning in Cloud
Hybrid Based Resource Provisioning in CloudEditor IJCATR
ย 

Similar to Prediction Based Efficient Resource Provisioning and Its Impact on QoS Parameters in the Cloud Environment (20)

A latency-aware max-min algorithm for resource allocation in cloud
A latency-aware max-min algorithm for resource  allocation in cloud A latency-aware max-min algorithm for resource  allocation in cloud
A latency-aware max-min algorithm for resource allocation in cloud
ย 
QoS Based Scheduling Techniques in Cloud Computing: Systematic Review
QoS Based Scheduling Techniques in Cloud Computing: Systematic ReviewQoS Based Scheduling Techniques in Cloud Computing: Systematic Review
QoS Based Scheduling Techniques in Cloud Computing: Systematic Review
ย 
Allocation Strategies of Virtual Resources in Cloud-Computing Networks
Allocation Strategies of Virtual Resources in Cloud-Computing NetworksAllocation Strategies of Virtual Resources in Cloud-Computing Networks
Allocation Strategies of Virtual Resources in Cloud-Computing Networks
ย 
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTINGGROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
ย 
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTINGGROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
GROUP BASED RESOURCE MANAGEMENT AND PRICING MODEL IN CLOUD COMPUTING
ย 
A survey on various resource allocation policies in cloud computing environment
A survey on various resource allocation policies in cloud computing environmentA survey on various resource allocation policies in cloud computing environment
A survey on various resource allocation policies in cloud computing environment
ย 
A survey on various resource allocation policies in cloud computing environment
A survey on various resource allocation policies in cloud computing environmentA survey on various resource allocation policies in cloud computing environment
A survey on various resource allocation policies in cloud computing environment
ย 
An efficient resource sharing technique for multi-tenant databases
An efficient resource sharing technique for multi-tenant databases An efficient resource sharing technique for multi-tenant databases
An efficient resource sharing technique for multi-tenant databases
ย 
PROPOSED ONTOLOGY FRAMEWORK FOR DYNAMIC RESOURCE PROVISIONING ON PUBLIC CLOUD
PROPOSED ONTOLOGY FRAMEWORK FOR DYNAMIC RESOURCE PROVISIONING ON PUBLIC CLOUDPROPOSED ONTOLOGY FRAMEWORK FOR DYNAMIC RESOURCE PROVISIONING ON PUBLIC CLOUD
PROPOSED ONTOLOGY FRAMEWORK FOR DYNAMIC RESOURCE PROVISIONING ON PUBLIC CLOUD
ย 
Iaetsd effective fault toerant resource allocation with cost
Iaetsd effective fault toerant resource allocation with costIaetsd effective fault toerant resource allocation with cost
Iaetsd effective fault toerant resource allocation with cost
ย 
IRJET- Optimization of Completion Time through Efficient Resource Allocation ...
IRJET- Optimization of Completion Time through Efficient Resource Allocation ...IRJET- Optimization of Completion Time through Efficient Resource Allocation ...
IRJET- Optimization of Completion Time through Efficient Resource Allocation ...
ย 
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTINGA SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
ย 
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTINGA SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTING
ย 
A Survey on Resource Allocation in Cloud Computing
A Survey on Resource Allocation in Cloud ComputingA Survey on Resource Allocation in Cloud Computing
A Survey on Resource Allocation in Cloud Computing
ย 
Pre-allocation Strategies of Computational Resources in Cloud Computing using...
Pre-allocation Strategies of Computational Resources in Cloud Computing using...Pre-allocation Strategies of Computational Resources in Cloud Computing using...
Pre-allocation Strategies of Computational Resources in Cloud Computing using...
ย 
CPET- Project Report
CPET- Project ReportCPET- Project Report
CPET- Project Report
ย 
1732 1737
1732 17371732 1737
1732 1737
ย 
1732 1737
1732 17371732 1737
1732 1737
ย 
A compendium on load forecasting approaches and models
A compendium on load forecasting approaches and modelsA compendium on load forecasting approaches and models
A compendium on load forecasting approaches and models
ย 
Hybrid Based Resource Provisioning in Cloud
Hybrid Based Resource Provisioning in CloudHybrid Based Resource Provisioning in Cloud
Hybrid Based Resource Provisioning in Cloud
ย 

More from IJECEIAES

Cloud service ranking with an integration of k-means algorithm and decision-m...
Cloud service ranking with an integration of k-means algorithm and decision-m...Cloud service ranking with an integration of k-means algorithm and decision-m...
Cloud service ranking with an integration of k-means algorithm and decision-m...IJECEIAES
ย 
Prediction of the risk of developing heart disease using logistic regression
Prediction of the risk of developing heart disease using logistic regressionPrediction of the risk of developing heart disease using logistic regression
Prediction of the risk of developing heart disease using logistic regressionIJECEIAES
ย 
Predictive analysis of terrorist activities in Thailand's Southern provinces:...
Predictive analysis of terrorist activities in Thailand's Southern provinces:...Predictive analysis of terrorist activities in Thailand's Southern provinces:...
Predictive analysis of terrorist activities in Thailand's Southern provinces:...IJECEIAES
ย 
Optimal model of vehicular ad-hoc network assisted by unmanned aerial vehicl...
Optimal model of vehicular ad-hoc network assisted by  unmanned aerial vehicl...Optimal model of vehicular ad-hoc network assisted by  unmanned aerial vehicl...
Optimal model of vehicular ad-hoc network assisted by unmanned aerial vehicl...IJECEIAES
ย 
Improving cyberbullying detection through multi-level machine learning
Improving cyberbullying detection through multi-level machine learningImproving cyberbullying detection through multi-level machine learning
Improving cyberbullying detection through multi-level machine learningIJECEIAES
ย 
Comparison of time series temperature prediction with autoregressive integrat...
Comparison of time series temperature prediction with autoregressive integrat...Comparison of time series temperature prediction with autoregressive integrat...
Comparison of time series temperature prediction with autoregressive integrat...IJECEIAES
ย 
Strengthening data integrity in academic document recording with blockchain a...
Strengthening data integrity in academic document recording with blockchain a...Strengthening data integrity in academic document recording with blockchain a...
Strengthening data integrity in academic document recording with blockchain a...IJECEIAES
ย 
Design of storage benchmark kit framework for supporting the file storage ret...
Design of storage benchmark kit framework for supporting the file storage ret...Design of storage benchmark kit framework for supporting the file storage ret...
Design of storage benchmark kit framework for supporting the file storage ret...IJECEIAES
ย 
Detection of diseases in rice leaf using convolutional neural network with tr...
Detection of diseases in rice leaf using convolutional neural network with tr...Detection of diseases in rice leaf using convolutional neural network with tr...
Detection of diseases in rice leaf using convolutional neural network with tr...IJECEIAES
ย 
A systematic review of in-memory database over multi-tenancy
A systematic review of in-memory database over multi-tenancyA systematic review of in-memory database over multi-tenancy
A systematic review of in-memory database over multi-tenancyIJECEIAES
ย 
Agriculture crop yield prediction using inertia based cat swarm optimization
Agriculture crop yield prediction using inertia based cat swarm optimizationAgriculture crop yield prediction using inertia based cat swarm optimization
Agriculture crop yield prediction using inertia based cat swarm optimizationIJECEIAES
ย 
Three layer hybrid learning to improve intrusion detection system performance
Three layer hybrid learning to improve intrusion detection system performanceThree layer hybrid learning to improve intrusion detection system performance
Three layer hybrid learning to improve intrusion detection system performanceIJECEIAES
ย 
Non-binary codes approach on the performance of short-packet full-duplex tran...
Non-binary codes approach on the performance of short-packet full-duplex tran...Non-binary codes approach on the performance of short-packet full-duplex tran...
Non-binary codes approach on the performance of short-packet full-duplex tran...IJECEIAES
ย 
Improved design and performance of the global rectenna system for wireless po...
Improved design and performance of the global rectenna system for wireless po...Improved design and performance of the global rectenna system for wireless po...
Improved design and performance of the global rectenna system for wireless po...IJECEIAES
ย 
Advanced hybrid algorithms for precise multipath channel estimation in next-g...
Advanced hybrid algorithms for precise multipath channel estimation in next-g...Advanced hybrid algorithms for precise multipath channel estimation in next-g...
Advanced hybrid algorithms for precise multipath channel estimation in next-g...IJECEIAES
ย 
Performance analysis of 2D optical code division multiple access through unde...
Performance analysis of 2D optical code division multiple access through unde...Performance analysis of 2D optical code division multiple access through unde...
Performance analysis of 2D optical code division multiple access through unde...IJECEIAES
ย 
On performance analysis of non-orthogonal multiple access downlink for cellul...
On performance analysis of non-orthogonal multiple access downlink for cellul...On performance analysis of non-orthogonal multiple access downlink for cellul...
On performance analysis of non-orthogonal multiple access downlink for cellul...IJECEIAES
ย 
Phase delay through slot-line beam switching microstrip patch array antenna d...
Phase delay through slot-line beam switching microstrip patch array antenna d...Phase delay through slot-line beam switching microstrip patch array antenna d...
Phase delay through slot-line beam switching microstrip patch array antenna d...IJECEIAES
ย 
A simple feed orthogonal excitation X-band dual circular polarized microstrip...
A simple feed orthogonal excitation X-band dual circular polarized microstrip...A simple feed orthogonal excitation X-band dual circular polarized microstrip...
A simple feed orthogonal excitation X-band dual circular polarized microstrip...IJECEIAES
ย 
A taxonomy on power optimization techniques for fifthgeneration heterogenous ...
A taxonomy on power optimization techniques for fifthgeneration heterogenous ...A taxonomy on power optimization techniques for fifthgeneration heterogenous ...
A taxonomy on power optimization techniques for fifthgeneration heterogenous ...IJECEIAES
ย 

More from IJECEIAES (20)

Cloud service ranking with an integration of k-means algorithm and decision-m...
Cloud service ranking with an integration of k-means algorithm and decision-m...Cloud service ranking with an integration of k-means algorithm and decision-m...
Cloud service ranking with an integration of k-means algorithm and decision-m...
ย 
Prediction of the risk of developing heart disease using logistic regression
Prediction of the risk of developing heart disease using logistic regressionPrediction of the risk of developing heart disease using logistic regression
Prediction of the risk of developing heart disease using logistic regression
ย 
Predictive analysis of terrorist activities in Thailand's Southern provinces:...
Predictive analysis of terrorist activities in Thailand's Southern provinces:...Predictive analysis of terrorist activities in Thailand's Southern provinces:...
Predictive analysis of terrorist activities in Thailand's Southern provinces:...
ย 
Optimal model of vehicular ad-hoc network assisted by unmanned aerial vehicl...
Optimal model of vehicular ad-hoc network assisted by  unmanned aerial vehicl...Optimal model of vehicular ad-hoc network assisted by  unmanned aerial vehicl...
Optimal model of vehicular ad-hoc network assisted by unmanned aerial vehicl...
ย 
Improving cyberbullying detection through multi-level machine learning
Improving cyberbullying detection through multi-level machine learningImproving cyberbullying detection through multi-level machine learning
Improving cyberbullying detection through multi-level machine learning
ย 
Comparison of time series temperature prediction with autoregressive integrat...
Comparison of time series temperature prediction with autoregressive integrat...Comparison of time series temperature prediction with autoregressive integrat...
Comparison of time series temperature prediction with autoregressive integrat...
ย 
Strengthening data integrity in academic document recording with blockchain a...
Strengthening data integrity in academic document recording with blockchain a...Strengthening data integrity in academic document recording with blockchain a...
Strengthening data integrity in academic document recording with blockchain a...
ย 
Design of storage benchmark kit framework for supporting the file storage ret...
Design of storage benchmark kit framework for supporting the file storage ret...Design of storage benchmark kit framework for supporting the file storage ret...
Design of storage benchmark kit framework for supporting the file storage ret...
ย 
Detection of diseases in rice leaf using convolutional neural network with tr...
Detection of diseases in rice leaf using convolutional neural network with tr...Detection of diseases in rice leaf using convolutional neural network with tr...
Detection of diseases in rice leaf using convolutional neural network with tr...
ย 
A systematic review of in-memory database over multi-tenancy
A systematic review of in-memory database over multi-tenancyA systematic review of in-memory database over multi-tenancy
A systematic review of in-memory database over multi-tenancy
ย 
Agriculture crop yield prediction using inertia based cat swarm optimization
Agriculture crop yield prediction using inertia based cat swarm optimizationAgriculture crop yield prediction using inertia based cat swarm optimization
Agriculture crop yield prediction using inertia based cat swarm optimization
ย 
Three layer hybrid learning to improve intrusion detection system performance
Three layer hybrid learning to improve intrusion detection system performanceThree layer hybrid learning to improve intrusion detection system performance
Three layer hybrid learning to improve intrusion detection system performance
ย 
Non-binary codes approach on the performance of short-packet full-duplex tran...
Non-binary codes approach on the performance of short-packet full-duplex tran...Non-binary codes approach on the performance of short-packet full-duplex tran...
Non-binary codes approach on the performance of short-packet full-duplex tran...
ย 
Improved design and performance of the global rectenna system for wireless po...
Improved design and performance of the global rectenna system for wireless po...Improved design and performance of the global rectenna system for wireless po...
Improved design and performance of the global rectenna system for wireless po...
ย 
Advanced hybrid algorithms for precise multipath channel estimation in next-g...
Advanced hybrid algorithms for precise multipath channel estimation in next-g...Advanced hybrid algorithms for precise multipath channel estimation in next-g...
Advanced hybrid algorithms for precise multipath channel estimation in next-g...
ย 
Performance analysis of 2D optical code division multiple access through unde...
Performance analysis of 2D optical code division multiple access through unde...Performance analysis of 2D optical code division multiple access through unde...
Performance analysis of 2D optical code division multiple access through unde...
ย 
On performance analysis of non-orthogonal multiple access downlink for cellul...
On performance analysis of non-orthogonal multiple access downlink for cellul...On performance analysis of non-orthogonal multiple access downlink for cellul...
On performance analysis of non-orthogonal multiple access downlink for cellul...
ย 
Phase delay through slot-line beam switching microstrip patch array antenna d...
Phase delay through slot-line beam switching microstrip patch array antenna d...Phase delay through slot-line beam switching microstrip patch array antenna d...
Phase delay through slot-line beam switching microstrip patch array antenna d...
ย 
A simple feed orthogonal excitation X-band dual circular polarized microstrip...
A simple feed orthogonal excitation X-band dual circular polarized microstrip...A simple feed orthogonal excitation X-band dual circular polarized microstrip...
A simple feed orthogonal excitation X-band dual circular polarized microstrip...
ย 
A taxonomy on power optimization techniques for fifthgeneration heterogenous ...
A taxonomy on power optimization techniques for fifthgeneration heterogenous ...A taxonomy on power optimization techniques for fifthgeneration heterogenous ...
A taxonomy on power optimization techniques for fifthgeneration heterogenous ...
ย 

Recently uploaded

VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Bookingdharasingh5698
ย 
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...ranjana rawat
ย 
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINEDJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINEslot gacor bisa pakai pulsa
ย 
Glass Ceramics: Processing and Properties
Glass Ceramics: Processing and PropertiesGlass Ceramics: Processing and Properties
Glass Ceramics: Processing and PropertiesPrabhanshu Chaturvedi
ย 
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Christo Ananth
ย 
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete RecordCCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete RecordAsst.prof M.Gokilavani
ย 
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...roncy bisnoi
ย 
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...ranjana rawat
ย 
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...ranjana rawat
ย 
Top Rated Pune Call Girls Budhwar Peth โŸŸ 6297143586 โŸŸ Call Me For Genuine Se...
Top Rated  Pune Call Girls Budhwar Peth โŸŸ 6297143586 โŸŸ Call Me For Genuine Se...Top Rated  Pune Call Girls Budhwar Peth โŸŸ 6297143586 โŸŸ Call Me For Genuine Se...
Top Rated Pune Call Girls Budhwar Peth โŸŸ 6297143586 โŸŸ Call Me For Genuine Se...Call Girls in Nagpur High Profile
ย 
MANUFACTURING PROCESS-II UNIT-1 THEORY OF METAL CUTTING
MANUFACTURING PROCESS-II UNIT-1 THEORY OF METAL CUTTINGMANUFACTURING PROCESS-II UNIT-1 THEORY OF METAL CUTTING
MANUFACTURING PROCESS-II UNIT-1 THEORY OF METAL CUTTINGSIVASHANKAR N
ย 
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...ranjana rawat
ย 
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7Call Girls in Nagpur High Profile Call Girls
ย 
KubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghlyKubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghlysanyuktamishra911
ย 
UNIT - IV - Air Compressors and its Performance
UNIT - IV - Air Compressors and its PerformanceUNIT - IV - Air Compressors and its Performance
UNIT - IV - Air Compressors and its Performancesivaprakash250
ย 
Introduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxIntroduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxupamatechverse
ย 
Porous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writingPorous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writingrakeshbaidya232001
ย 
Russian Call Girls in Nagpur Grishma Call 7001035870 Meet With Nagpur Escorts
Russian Call Girls in Nagpur Grishma Call 7001035870 Meet With Nagpur EscortsRussian Call Girls in Nagpur Grishma Call 7001035870 Meet With Nagpur Escorts
Russian Call Girls in Nagpur Grishma Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur High Profile
ย 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Christo Ananth
ย 

Recently uploaded (20)

VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
ย 
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
ย 
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINEDJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
DJARUM4D - SLOT GACOR ONLINE | SLOT DEMO ONLINE
ย 
Glass Ceramics: Processing and Properties
Glass Ceramics: Processing and PropertiesGlass Ceramics: Processing and Properties
Glass Ceramics: Processing and Properties
ย 
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
ย 
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete RecordCCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
ย 
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
ย 
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
ย 
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
ย 
Top Rated Pune Call Girls Budhwar Peth โŸŸ 6297143586 โŸŸ Call Me For Genuine Se...
Top Rated  Pune Call Girls Budhwar Peth โŸŸ 6297143586 โŸŸ Call Me For Genuine Se...Top Rated  Pune Call Girls Budhwar Peth โŸŸ 6297143586 โŸŸ Call Me For Genuine Se...
Top Rated Pune Call Girls Budhwar Peth โŸŸ 6297143586 โŸŸ Call Me For Genuine Se...
ย 
MANUFACTURING PROCESS-II UNIT-1 THEORY OF METAL CUTTING
MANUFACTURING PROCESS-II UNIT-1 THEORY OF METAL CUTTINGMANUFACTURING PROCESS-II UNIT-1 THEORY OF METAL CUTTING
MANUFACTURING PROCESS-II UNIT-1 THEORY OF METAL CUTTING
ย 
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
ย 
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
ย 
Roadmap to Membership of RICS - Pathways and Routes
Roadmap to Membership of RICS - Pathways and RoutesRoadmap to Membership of RICS - Pathways and Routes
Roadmap to Membership of RICS - Pathways and Routes
ย 
KubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghlyKubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghly
ย 
UNIT - IV - Air Compressors and its Performance
UNIT - IV - Air Compressors and its PerformanceUNIT - IV - Air Compressors and its Performance
UNIT - IV - Air Compressors and its Performance
ย 
Introduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxIntroduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptx
ย 
Porous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writingPorous Ceramics seminar and technical writing
Porous Ceramics seminar and technical writing
ย 
Russian Call Girls in Nagpur Grishma Call 7001035870 Meet With Nagpur Escorts
Russian Call Girls in Nagpur Grishma Call 7001035870 Meet With Nagpur EscortsRussian Call Girls in Nagpur Grishma Call 7001035870 Meet With Nagpur Escorts
Russian Call Girls in Nagpur Grishma Call 7001035870 Meet With Nagpur Escorts
ย 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
ย 

Prediction Based Efficient Resource Provisioning and Its Impact on QoS Parameters in the Cloud Environment

  • 1. International Journal of Electrical and Computer Engineering (IJECE) Vol. 8, No. 6, December 2018, pp. 5359~5370 ISSN: 2088-8708, DOI: 10.11591/ijece.v8i6.pp5359-5370 ๏ฒ 5359 Journal homepage: http://iaescore.com/journals/index.php/IJECE Prediction Based Efficient Resource Provisioning and Its Impact on QoS Parameters in the Cloud Environment Lata J Gadhavi, Madhuri D Bhavsar Institute of Technology, Nirma University, India Article Info ABSTRACT Article history: Received Jan 23, 2018 Revised Jun 29, 2018 Accepted Jul 24, 2018 The purpose of this paper is to provision the on demand resources to the end users as per their need using prediction method in cloud computing environment. The provisioning of virtualized resources to cloud consumers according to their need is a crucial step in the deployment of applications on the cloud. However, the dynamical management of resources for variable workloads remains a challenging problem for cloud providers. This problem can be solved by using a prediction based adaptive resource provisioning mechanism, which can estimate the upcoming resource demands of applications. The present research introduces a prediction based resource provisioning model for the allocation of resources in advance. The proposed approach facilitates the release of unused resources in the pool with quality of service (QoS), which is defined based on prediction model to perform the allocation of resources in advance. In this work, the model is used to determine the future workload prediction for user requests on web servers, and its impact toward achieving efficient resource provisioning in terms of resource exploitation and QoS. The main contribution of this paper is to develop the prediction model for efficient and dynamic resource provisioning to meet the requirements of end users. Keyword: Dynamic resource provisioning Efficient resource provisioning Resources deployment Resources exploitation Workload prediction Copyright ยฉ 2018 Institute of Advanced Engineering and Science. All rights reserved. Corresponding Author: Lata J Gadhavi, Institute of Technology, Nirma University, Ahmedabad, Gujarat, India. Email: 12extphde92@nirmauni.ac.in 1. INTRODUCTION In the cloud computing environment, cloud users often have time-changing requirements for virtual resources. To provision resources for dynamic and uncertain changes in the workload and to react to these changes accordingly, the cloud provider should manage resources based on the requirement of the users. In the present study, a workload prediction model for dynamic and efficient resource provisioning is proposed to manage the number of user requests and the required resources. One problem with such a resource provisioning scheme is the occurrence of thrashing, in which, due to frequent variation of the workload (number of job requests), machines can be added and released to meet each requirement while satisfying the QoS metrics. Solving this problem requires an ability to predict the incoming workload on the system and to allocate resources a priori by using prediction methods for the required resources. The main contributions in this paper are; (a) The design of a prediction mechanism and of the flow of the prediction model for different periods; and (b) The use of prediction methods to determine the workload based on a historical database. The rest of the paper is organized as follows. Section II presents a summary of the related work in this domain. Section III provides the domain analysis for the workload pattern. Section IV introduces the prediction mechanism. Section V describes the case study used to validate the proposed approach and
  • 2. ๏ฒ ISSN: 2088-8708 Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370 5360 number of job request requirement for resources. In section VI, we present the evaluation results for the resource provisioning and allocation. Finally, section VII presents the concluding remarks and future scope. 2. RELATED WORK Cloud computing characterizes the delivery of computation as a service, in which resources, such as the CPU, software, hardware, information, and devices, are granted to users as services through the Internet. The characteristics of cloud computing, such as auto-scaling, the provisioning of services based on demand, and the utility mechanism, has been largely adopted by different analysts [1]. Cloud computing provides a scalable and flexible platform for providing high-performance computing requirements [2], [3], [4]. However, the pool of resource, flexible service provisioning, and elasticity are not the only potentials of the cloud. The cloud computing system provisions a homogeneous and heterogeneous operating system environment by using virtualization. In the IT industry, multiple cloud providers deliver QoS to end users according to their demand. However, an issue that emerges from the initial to the deployment stage is the reality that the pattern of access to the application by various end users varies frequently. As a result, there is an unpredictable number of users and variable workload during some periods. In a static and inefficient resource provisioning mechanism, during periods of low demand for resources, there will be an overload of obtainable resources, whereas during periods of high demand, the available resources will be inadequate. This issue leads to poor QoS and high costs. A current research challenge is to develop an adaptive method of resource provisioning in terms of cost and performance. Cloud computing can address the above challenge by provisioning resources dynamically and effectively to end-user applications based on the prediction of workload and resources according to the user request arrival rate and the service response rate. This means that additional resources can be provided during periods of high demand and released during periods of low demand, without loss of QoS to end users [5] The challenge with such a dynamic resource provisioning strategy is the determination of the proper quantity of resources to be set up and provisioned in a particular period to meet the expected QoS for a variable workload. An ideal solution would require the capability to predict the incoming workload and required resources in advance. The expected outcome is the determination of the number of virtual machines that should be created, configured, and provided to handle the variable workload. This challenge has been addressed through various ways, such reactive [6], proactive [6], and predictive [7] approaches. Effective resource provisioning is not an easy and uncomplicated task. To meet the above requirements, the following criteria should be considered in developing the algorithm: (a) the computation of the user request rate, (b) the minimization of the request rejection rate, (c) the average response time and the number of requests timed out, (d) the percentage of timed out requests (PTOR) for a number of users, and (e) the accurate computation in advance of the resources required for a variable workload. The current research presents an efficient and effective resource provisioning algorithm that uses a prediction technique to provision and remove resources dynamically. A strategy to improve the resource utilization is proposed and compared with the conventional approach. 3. DOMAIN ANALYSIS The cloud computing format is mainly described by using three service models: (a) Infrastructure as a Service (IaaS), which explains about the resources offering procedures by cloud providers; (b) Platform as a Service (PaaS), which describes how cloud providers provide an entire cloud environment implemented and deployed in a certain programming language for a speci๏ฌc type of applications; and (c) Software as a Service (SaaS), which refers to applications that can be offered to customers according to their need. The deployed cloud models are mainly classified into four forms: (a) public cloud, which is available for everyone; (b) private cloud, which is hosted solely for one industry; (c) community cloud, which is a cloud environment made accessible only to a certain group of industry or individuals in collaboration; and (d) hybrid cloud, which refers to various clouds that are interconnected with the hosted applications deployed in the cloud environment [8]. In the present work, the term โ€œworkloadโ€ refers to the number of arrived requests to access the resource of the cloud system. The application or jobs are need to be switched automatically which are accessed by users. In the cloud computing scenario, the workload category, cloud service models, and deployment models are interconnected with each other, as shown in Figure. 1. The application workload pattern describes diverse user behaviors, which result in the utilization of IT resources in variable forms. The workload can be determined based on the number of user requests, the load calculation on the servers, the network traffic, and the data storage [9]. In the cloud computing environment, the resource provisioning depends on the incoming
  • 3. Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi) 5361 workload [10]. For the prediction of the workload and resources in this study, the workload patterns are categorized based on the incoming workload, which includes the number of user requests, the amount of work over a specified period, the user request arrival rate, and the time between two consecutive requests (inter-arrival time). According to the above characteristics, the workload is categorized into the five types: static, periodic, unpredictable, continuously changing, and once in a lifetime [11]. 3.1. Static Workload The workload for resources with corresponding or equal usage of a hosted application is called static workload. In this workload type, there is no requirement to increase or decrease the processing power, network bandwidth, data storage, or memory because the workload is constant. A static workload does not require the functionality of the cloud, such as elasticity. Private Websites and wikis are examples of sites with a static workload. 3.2. Periodic Workload Periodic jobs are very common in our daily routine. Yearly income tax pay, monthly utility bills, traffic during rush hours etc are the examples of periodic tasks or jobs. It is observed that in the same interval, many people using these tasks. During such periodic tasks, it is difficult to provide enough resources for the peak load and to handle the unused resources for the non-peak load. This problem leads to over- or under-provisioning of resources to the hosted application. Periodic tasks occur at the same interval of the day, month, or year; however, they consist of a higher number of requests over a peak period. A periodic workload often requires elasticity and scalability to handle the number of requests during the peak intervals. The computimg workload pattern is depicted on Figure 1. Figure 1. The Cloud Computing Workload Pattern 3.3. Unpredictable Workload Similarly to a periodic workload, an unpredictable workload consists of increasing and decreasing incoming workloads from the users. This workload is described as unpredictable because the variations occur randomly. As a result, cloud providers have to deal with the unstructured and unplanned provisioning of resources to meet the changing requirements. Accurate prediction is the main challenge to obtaining the scaling requirements for resources for an unpredicted workload. To achieve accurate results, constant observation of the workload is required for example, unpredictable traffic, forecasting etc.
  • 4. ๏ฒ ISSN: 2088-8708 Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370 5362 3.4. Continuously Changing Workload The resource utilization may be maximized or minimized over time, and the workload may change continuously. For many applications, there may be long-term changes in the workload. A continuously changing workload can be considered as a constant escalation or declination of the resource utilization. The elasticity of the cloud enables the provisioning or decommissioning of resources for a continuously changing workload. 3.5. Once-in-a-lifetime Workload The peak workload utilization may occur only once in a lifetime when the resources are distributed equally. In such a special case, the resource provisioning and decommissioning can often be a manual or dynamic task at a known point in time. 4. PREDICTION MECHANISM To predict the incoming workload and to identify the workload type, the user requests have to be analyzed. An analysis of the historical database is also needed to meet the resource requirements a priori. Based on the user requests and their need analysis are considered for hosted application. Figure 2 shows the procedure of prediction at time t-1 and interval t. The previous period for interval (t-1) and the live period for interval t are observed for a number of active users. The resource requirements for the observed period are monitored, collected, and entered into the historical database after the procedure. Based on the database, the workload for time intervals t-1 and t are calculated, and prediction methods are applied to determine the workload for the next period (t+1). Figure 2. The Flow of the Prediction Model
  • 5. Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi) 5363 As shown in the above Figure 2, prediction of workload for the resource demands is described in different interval. For time interval t โˆ’ 1, the mean CPU, RAM workload, and number of active users are calculated as follows: ฮฑ ๐šโˆ’1(cpu) ๐š– = CPU Workload Mean at the interval t โˆ’ 1 ฮฒ ๐šโˆ’1(RAM) ๐š– = RAM Workload Mean at the interval t โˆ’ 1 ฮณ ๐šโˆ’1(active user) ๐š– = Mean number of active users at time t โˆ’ 1 ฮป ๐šโˆ’1 ๐š–โ€ฒ =For whole scenario at time t-1 (1) For time interval t, the mean CPU, RAM workload, and number of active users are calculated as follows: ฮฑ ๐š(cpu) ๐š– = Mean of CPU Workload at time t ฮฒ ๐š(RAM) ๐š– = Mean of RAM Workload at time t ฮณ ๐š(active user) ๐š– = Mean of number of active users at time t ฮป ๐š ๐š–โ€ฒ =For whole scenario at time t (2) To consider the workload at the initial level, a pseudo-code is described in Algorithm 1. Algorithm 1: Initial Level Input: Number of requests Requirement: Calculation of the inter arrival time for the periods ๐š-1 and ๐š period 1.Begin. 2. Monitor active user requests 3. While (time interval is ๐š-1). 4. Calculate the inter arrival time of active users. 5. For (each inter arrival time in period ๐š-1). 6. Monitor workload 7. Calculate mean value ฮป ๐šโˆ’1 ๐š–โ€ฒ for week1. 8. For (each inter arrival time of ๐š period). 9. Monitor the workload. 10. Calculate the mean value ฮป ๐š ๐š–โ€ฒ for week2. 11. End for 12. End for 13.End. Now for each week of the month, calculate the mean value of the workload and predict for next week based on current and the historical database. Thus, the predicted value for time ๐š+ n is: ฮป ๐š+ n ๐š– = ฮป ๐šโˆ’1 ๐š–โ€ฒ + ฮป ๐š ๐š–โ€ฒ + ฮป ๐š+1 ๐š–โ€ฒ + โ‹ฏ + ฮป ๐š+(nโˆ’1) ๐š–โ€ฒ (3) ฮป ๐š+ n ๐š– = โˆ‘ ฮป ๐š–โ€ฒ๐š+(nโˆ’1) ๐šโˆ’1 (4) (3) and (4) express the summation of the previous workload to predict the resource demands for the next period. The pseudo-code for the workload prediction is presented in Algorithm 2. Algorithm 2: Workload Prediction Input: Number of requests Requirement: Calculation of the mean CPU, RAM, and number of active users at time interval ๐š-1 and period ๐š 1.Begin. 2.Monitor the number of active user requests at time ๐š-1 and period ๐š. 3.Calculate ฮป ๐šโˆ’1 ๐š–โ€ฒ and ฮป ๐š ๐š–โ€ฒ // by using (1) and (2). 4.For each week, calculate the mean workload. 5. Predict the workload for the next week ๐š+ n, โˆ‘ ฮป ๐š–โ€ฒ๐š+(nโˆ’1) ๐šโˆ’1 . 6.End for. 7.End.
  • 6. ๏ฒ ISSN: 2088-8708 Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370 5364 To allocate resources to the job, in this section number of job identification are considered for various regions as shown in the Figure. 3. Figure 3. The Flow of the Resource Allocation ๏‚ท Determination of the number of requests: Job profile: ๏‚ง ๏ป ๏ฝnit jjJ ,......,๏€ฝ , where i=1...n, and tJ is number of jobs for the current time ๏‚ง ๏€จ ๏€ฉ ๏€จ ๏€ฉ ๏€จ ๏€ฉ ๏€จ ๏€ฉ๏ป ๏ฝLLocationAIPaddDDateTTimej ,,,1 ๏€ฝ ๏‚ง Let ๏€จ ๏€ฉ,.......,, 321 TTTT ๏€ฝ time series ๏‚ง ๏€จ ๏€ฉ...., 21 ddD ๏€ฝ Date of request arrived ๏‚ง ๏€จ ๏€ฉ ๏€จ ๏€ฉ๏ป ๏ฝnnii crcrL ,,........,๏€ฝ , where L is the location of the arrived request ๏‚ง cr, Region and country, respectively Total number of job requests from one region= R ๏ƒฅ ๏€ฝR Number of requests per region (5)
  • 7. Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi) 5365 Figure 4. Number of Requests by Region Figure 4 shows the number of job requests by region (R). Different prediction models are applied for the resource requirements in various periods, including the first and second moving average (FSMA), weighted moving average (WMA), and exponential moving average (EMA) models [11]. The historical data and prediction model output are used as input data, which are trained to improve the accuracy of the resource provisioning strategy. The prediction model uses the output of the predicted value to provision the resources. At the same time, provisioned resources results will be stored in the historical database repository for future prediction. The prediction is done by applying various moving average methods. In particular, the moving average methods FSMA and WMA are recommended to consider non-fluctuations in the short-term demand, as shown in our previous work [12]. An ontology-based dynamic resource provisioning for public cloud was implemented in the previous work [13]. First and Second Moving Average (FSMA) method: In the first moving average method, the ith user request for resource at time interval t is measured, and N is considered as a moving average period for time interval t [9], as described in (6): ๐น๐‘ก+1 = (๐‘ฆ ๐‘ก (๐‘–)+๐‘ฆ ๐‘กโˆ’1 (๐‘–)+โ‹ฏ+ ๐‘ฆ ๐‘กโˆ’๐‘› (๐‘–)) ๐‘ (6) Here, y is considered as the original value for each period, and t is regarded as the current period. In (6), Ft+1 denote the first moving average value for the ith user at time t+1. The resource requirement of the ith user at time t+ฮด can be predicted as: ๐‘ฆ๐‘ก+๐›ฟ(i) = ๐ด ๐‘ก(i)+๐›ฟ๐ต๐‘ก(๐‘–) (7) where ฮด is the predicted time sequence number, and ๐‘ฆ๐‘ก+๐›ฟ denotes the predicted value at time ๐‘ฆ๐‘ก+๐›ฟ, as shown in (7). Then, to predict the ๐‘ฆ๐‘ก+๐›ฟ value, the second moving average value can be measured by applying (8): ๐‘†๐‘ก+1 = ๐น๐‘ก+1 (๐‘–)+๐น๐‘ก (๐‘–)+โ‹ฏ+๐น ๐‘กโˆ’(๐‘โˆ’1) (๐‘–) ๐‘ (8) In (7), ๐ด ๐‘ก(๐‘–) and ๐ต๐‘ก(๐‘–) are calculated by using (9) and (10): ๐ด ๐‘ก(๐‘–) = 2๐น๐‘ก+1 (๐‘–) โˆ’ ๐‘†๐‘ก+1 (๐‘–) (9) ๐ต๐‘ก(๐‘–) = 2๐น๐‘ก+1 (๐‘–)โˆ’๐‘† ๐‘ก+1 (๐‘–) ๐‘โˆ’1 (10)
  • 8. ๏ฒ ISSN: 2088-8708 Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370 5366 Based on the above equation, the total number of resource requirements for n users is measured as: ๐‘ฆ๐‘ก+๐›ฟ = (11) The total number of resources requested by all the n users at time ๐‘ก + ๐›ฟ can be calculated, and the predicted value at time periods ๐‘ก and ๐‘ก + ๐›ฟ for for all users can be determined by using equation. (11). Further, the resources are allocated to the users according to their actual need and based on the predicted value, and the results are compared. Weighted Moving Average Method (WMA): Whereas the first and second moving average model allocates the same weight to each element of the moving average database, the weighted moving average model allows any weight to be placed on each element, and the sum of all weights equals 1 [11]. Here, the active user requests and the utilization of resources for period Ft are described in (12): F ๐‘ก = W๐‘– A ๐‘กโˆ’๐‘– + W๐‘–+1 A ๐‘กโˆ’(๐‘–+1) + โ€ฆ . W๐‘› A ๐‘กโˆ’๐‘› (12) Where Ft = the forecast for the coming period, n=the total number of periods in the forecast, Ai = the actual occurrence for the period t-i, Here, โˆ‘ W๐‘– = 1๐‘› ๐‘–=1 ๐‘Š๐‘€๐ด = โˆ‘((๐‘Š๐‘’๐‘–๐‘”โ„Ž๐‘ก ๐‘“๐‘œ๐‘Ÿ ๐‘๐‘’๐‘Ÿ๐‘–๐‘œ๐‘‘ ๐‘›)โˆ’(๐‘‘๐‘’๐‘š๐‘Ž๐‘›๐‘‘ ๐‘–๐‘› ๐‘๐‘’๐‘Ÿ๐‘–๐‘œ๐‘‘ ๐‘›)) โˆ‘ ๐‘Š๐‘’๐‘–๐‘”โ„Ž๐‘ก๐‘  (13) Exponential Moving Average Method(EMA): The exponential moving average (EMA) method is mainly logical and is the easiest approach for predicting fluctuations in the short-term demand. This method is effective for both short-term and time-series prediction. As each new piece of data is added, the oldest observation is dropped, and a new forecast is calculated [14]. The predicted values are calculated by using the smoothing constant ฮฑ. The EMA method is expressed as: F ๐‘ก = F ๐‘กโˆ’1 + ฮฑ (A ๐‘กโˆ’1 โˆ’ F ๐‘กโˆ’1) F ๐‘ก = ฮฑ A ๐‘กโˆ’1) + (1 โˆ’ ฮฑ ) F ๐‘กโˆ’1 (14) where F ๐‘ก is the exponentially smoothed forecast for previous period t F ๐‘กโˆ’1 is the exponentially smoothed forecast made for the prior period, A ๐‘กโˆ’1 = The actual demand in the prior period, ฮฑ = The desired response rate or smoothing constant, 0< ฮฑ < 1 This method gives to a higher weight to the later measured value and a lower weight to the earlier measured value. The EMA method is able to respond quickly to fluctuations in the short-term demand. If request from active user is greater than the defined period then it will be considered in the long-term period and if it is less than then it will be considered as a short term period. Long-term and short-term periods are defined as Lt and St, respectively. 5. NUMBER OF JOB REQUEST REQUIREMENT FOR RESOURCES Here, the numbers of requests from various regions are calculated, as shown in (1) and (2). The number of arrived user requests in the deployed cloud for education is evaluated, as shown in our previous work, and the availability of resources in the specified regions is determined. The available resources are generated and monitored by using the commercial Amazon EC2 cloud platform [15, 16, 17]. The capability of the available VMs is calculated; then, the numbers of job requests are allocated to the resources. Once the numbers of jobs are allocated to the VMs, the current load is calculated. If the VM becomes over- or under- loaded, resources are automatically added or released as necessary. The whole procedure is described below. Let VM={VM1,VM2,VM3,โ€ฆ,VMN} be a set of N virtual machines and Task (number of job requests) = {task1, task2, task3, โ€ฆ, K} of K task to be regular and processed in VM.
  • 9. Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi) 5367 Here, the fitness of the number of requests (i) may be determined by the capacity of VMj, which is calculated by using (15): (15) job type length shows the how many tasks are submitted on VMj with the calculation of capacity of specific VM to handle submitted jobs. The capacity of the VM is measured by applying (16): (16) where Num_proc is the number of processors in the VM, Num_MIPS indicates the number of MIPS, and BW_VM represents bandwidth of the VM. (17) In (17), the input file length is also considered to determine the length of the job before execution. Tasks are assigned to the virtual machine by using the most effective fitness value from the (17). Load Calculation: When tasks are submitted to the beneath loaded VM, the present work of all offered VM will be measured by victimization of knowledge which is received from the database [18]. To calculate the deviations in load variance on VMs, the following standard deviation (SD) (18) is used: (18) where Xj is the processing time of the VM, as described in (19): (19) Then, the mean processing times for all VMs are calculated by applying (20): (20) If the SD of the loaded VM is smaller than or equal to the mean, then the system is in a balanced state. On the other hand, if the SD is higher than the mean, then the system is in imbalance, and the auto- scaling mechanism for resource provisioning will be applied. Here, one VM is considered to be capable of serving 50 requests at a time. Thus, when the number of requests >= 50, then scale up new instance and migrate requests on new instance. It is refreshing arrival of request for every 1 minute. Based on the predicted value, the resources are scaled up or down according to the predicted demand. The pseudo-code for scaling up and down is shown in Algorithm 3.
  • 10. ๏ฒ ISSN: 2088-8708 Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370 5368 Algorithm 3: Scaling up and down____________________________________ Begin. Monitor ฮป ๐šโˆ’1 ๐š–โ€ฒ and ฮป ๐š ๐š–โ€ฒ for the previous and the current time, respectively. Predict workload ฮป ๐š+ n ๐š– at time ๐š + n. Let R= ri แดœ ri+1 แดœ ri+2 แดœ ri+3..... แดœ rm before scaling, where R is the set of virtual resources. Let ฮป ๐š+ n ๐š– = โˆ‘ ฮป ๐š–โ€ฒ๐š+(nโˆ’1) ๐šโˆ’1 = x. Let ฮป ๐š+(nโˆ’1) ๐š–โ€ฒ = y. If > y, then // the workload increases. Add r into the R (scale up the virtual resource); else if < , then // the workload decreases. Remove extra r from R (scale down the virtual resource); else. Refresh the resources. End. 6. RESULTS OF THE QoS METRICS FOR RESOURCE ALLOCATION Figure 6 shows the efficient resource provisioning with the use of the prediction model achieves maximum CPU utilization compared with the existing (conventional) cloud. Here, the average CPU utilization is obtained for 50 requests on the conventional cloud and 100 requests on the efficient cloud. The results indicate that the efficient cloud uses a minimum number of instances but provides maximum utilization. Figure 7 shows that an efficient response time is obtained for 50 requests on the conventional cloud and 100 requests on the efficient cloud. Figure 8 indicates that efficient resource provisioning with the use of the prediction model achieves the maximum throughput compared with the existing (conventional) cloud. Here, the average throughput is measured for 50 requests on the conventional cloud and 100 requests on the efficient cloud. The results show that the efficient cloud uses a minimum number of instances but provides the maximum throughput. Figure 6. Average CPU utilization for 50 requests on the conventional and 100 requests on the efficient cloud Figure 7. Response time for 50 requests on the conventional cloud and 100 requests on the efficient cloud
  • 11. Int J Elec & Comp Eng ISSN: 2088-8708 ๏ฒ Prediction Based Efficient Resource Provisioning and Its Impact on QoS โ€ฆ (Lata J Gadhavi) 5369 Figure 8. Average throughputs for 50 requests on the conventional and 100 requests on the efficient cloud 7. CONCLUSIONS AND FUTURE WORK In this research, the design of a prediction model for efficient resource provisioning is presented. A prediction model is an essential part of the cloud environment, in which it is used to predict the number of user requests and the corresponding resource requirements. In the present work, the FSMA, WMA, and EMA models are used to predict the number of user requests for cloud resources. The cloud environment is set up on the EC2 AWS cloud. In addition, the auto-scaling algorithm is used in resource provisioning based on the prediction model. The experimental results of the QoS parameters are presented and compared between the conventional cloud and the efficient cloud before and after prediction. Based on the findings, the proposed prediction model has higher efficiency in resource allocation. In future works, we will apply the ARIMA model to improve the prediction accuracy for resource provisioning. Further, we plan to integrate the architecture for adaptive resource provisioning by using the workload prediction strategy. REFERENCES [1] C. Ji, Y. Li, W. Qiu, U. Awada. โ€œBig data processing in cloud computing environmentsโ€, in Pervasive Systems, Algorithms and Networksโ€™ (ISPAN), 12th International Symposium on. , pp.17โ€“23. IEEE 2012. [2] Changlong Li, Hang Zhuang, Kun Lu, Mingming Sun, Jinhong Zhou, Dong Dai, Xuehai Zhou. โ€œAn adaptive auto- con๏ฌguration tool for Hadoopโ€, 19th International Conference on Engineering of Complex Computer Systems. Pp.69-72. IEEE. 2014. [3] Ficco, M. โ€œSecurity event correlation approach for cloud computingโ€, International Journal of High Performance Computing and Networking (IJHPCN) 7(3). 2013. [4] M. Banu, A. Aranganathan. โ€œStudy of Load Optimization and Performance Issues in Cloudโ€, Indonesian Journal of Electrical Engineering and Computer Science (IJEECS), vol 11, no 3, 2018. [5] M. Armbrust, A. Fox, R. Grif๏ฌth, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, M. Zaharia. โ€œA view of cloud computing, communicationโ€, vol. 53, no. 4, pp. 50โ€“58. ACM. 2010. [6] Laura R. Moore, Kathryn Bean and Tariq Ellahi. โ€œTransforming Reactive Auto-scaling into Proactive Auto-scalingโ€, CloudDP โ€™13, ACM. 2013. [7] Rodrigo N. Calheiros, Enayat Masoumi, Rajiv Ranjan, Rajkumar Buyya. โ€œWorkload Prediction Using ARIMA Model and Its Impact on Cloud Applicationsโ€™ QoSโ€, IEEE Transactions on cloud computing, Vol 3. No.4.IEEE. 2015. [8] H. Muhasin, R. Atan, M.A. Jabar, S. Abdullah. โ€œThe Factors Affecting on Managing Sensitive Data in Cloud Computingโ€, Indonesian Journal of Electrical Engineering and Computer Science (IJEECS), vol 11, no 3,2018. [9] C. Fehling, F. Leymann, R. Retter, W. Schupeck, P. Arbitter. โ€œCloud Computing Patterns: Fundamentals to Designโ€, Build, and Manage Cloud Applications, vol. XXVI, pp1-367, Springer. 2014. [10] T. Zaidi, R. Rampratap. โ€œVirtual Machine Allocation Policy in Cloud Computing Environment using CloudSimโ€, International Journal of Electrical and Computer Engineering (IJECE), vol 8, no 1, 2018. [11] Petropoulos, F., Kourentzes, N. โ€œForecast combinations for intermittent demandโ€, Journal of the Operational Research Society, 66 (6), 914โ€“924. 2015. [12] Lata Gadhavi, Madhuri Bhavsar. โ€œEfficient and Dynamic Resource Provisioning Strategy for Data Processing Using Cloud Computingโ€, International Review on Computers and Software (I.RE.CO.S.), Vol. 11, No. 8. 2016.
  • 12. ๏ฒ ISSN: 2088-8708 Int J Elec & Comp Eng, Vol. 8, No. 6, December 2018 : 5359 - 5370 5370 [13] Lata Gadhavi, VIshakha Modi, Madhuri Bhavsar, โ€œProposed Ontology Framework for Dynamic Resource Provisioning on Public Cloudโ€, International Journal of Advanced Research in Engineering and Technology (IJARET) Volume 7, Issue 2, March-April 2016, pp. 118โ€“131. [14] Fiorucci, J. A., Pellegrini, T. R., Louzada, F., Petropoulos, F., Koehler, A. B. โ€œModels for optimising the theta method and their relationship to state space modelsโ€, International Journal of Forecasting, 32 (4), 1151โ€“1161. 2016. [15] K. Kalyana Chakravarthi, Vaidhehi Vijayakumar. โ€œWorkflow Scheduling Techniques and Algorithms in IaaS Cloud: A Surveyโ€, International Journal of Electrical and Computer Engineering (IJECE), vol 8, no 2, 2018. [16] Marco A. S. Netto, Rodrigo N. Calheiros, Eduardo R. Rodrigues, Renato L. F. Cunha, and Rajkumar Buyya. โ€œHPC Cloud for Scientific and Business Applications: Taxonomy, Vision, and Research Challengesโ€. ACM Comput. Surv. 51, 1, Article 8, 2018. [17] Lindstrom, J. Hermanson, A. Blomstedt, F. Kyosti, P. โ€œA Multi-Usable Cloud Service Platform: A Case Study on Improved Development Pace and Efficiencyโ€. Appl. Sci., 8, 316, 2018. [18] S. K. Suresh, J.R. Kannan. โ€œReview of Advancements in Multi-tenant Framework in Cloud Computingโ€, Indonesian Journal of Electrical Engineering and Computer Science (IJEECS), vol 11, no 3, 2018.