Stochastic Markov Model Approach for Efficient Virtual Machines

Scheduling on Private Cloud

Richa Dixit, Research Scholar, Dr.AKT University,Lucknow

richavyadav@gmail.com

Vibhash Yadav, Associate Professor KIOT,Kanpur

vibhashds10@yahoo.com

Abstract: Cloud Computing is continuously making a large conversation always to user, developer, company
communities in their full infrastructure. Cloud computing is large an expansive adjustment of virtualized computing
resources in various infrastructures and different development stages. The main complication in cloud computing is
scheduling and allocation of virtual resource and virtual machine in cloud infrastructure. Efficient virtual machine
scheduling algorithm (EVMSA) is used for virtual machine scheduling in cloud infrastructure resource management
and allocation. EVMSA algorithm is proposed to improve throughput and minimize response time of system, used
to analyze the performance of scheduling and allocation on cloud Infrastructure. The stochastic model is proposed to
measure the scalability and tractability for infrastructure resource of private cloud. Stochastic Markov model is used
to change system randomly, the future state is only depends on the current state.

Keywords: Cloud Computing, Virtual Machine, Scheduling, Stochastic Markov Model, Eucalyptus Private Cloud.

I. Introduction

Cloud computing is nothing but parallel and distributed system with collection of interconnected and
virtualized computers. This system is presented as uniform computer resources based on service level agreement
settled between the service provider and user. There is four type of cloud computing environment 1) public 2)
private 3) hybrid 4) community. This research is only strength on a private cloud.Private cloud is defining as
computing services offered on either internet or private internet network. Private cloud is also called internal or
corporate cloud.in our research we only used private cloud environment.
In cloud computing allocation and scheduling is very hard using VM .It is exceptionally hard to evaluate
execution of scheduling & allocation approach on cloud infrastructures for different applications fluctuating
workload and system Size. In Cloud computing research, allocation and scheduling is creating issue and resource
prevision become more complex. The main weakness in existing system is single queue system that maximizes
execution time. for minimize response time of system we enhanced an efficient scheduling algorithm which is
known as virtual machine scheduling algorithm. In this algorithm there is multiple queue and it use to follow
principle first come first surved.in existing Eucalyptus’s default VM scheduler is greedy scheduler and round robin
scheduler, by using this algorithm it’s very hard to allocate resource. In efficient scheduler algorithm there is three
effective policies for resource allocation.

1) Used to decrease waiting time for large VM request.

2) Detached in all VM Request from all three queues.
3) Efficient usage of resources.

In decrease delay time for large VM request -it use three queues instead of single queue. In detached in all VM
request from all three queue - three queue are calculate arrival time of all VM request. In efficient utilization of
resources- if selected VM request not sufficient the resource the it will choose VM request from another queue. In
efficient virtual machine algorithm we used modeling approach using stochastic Markov model for measurement of
performance. Markov model is used to change VM system randomly according to response time, throughput and
resource usage.

II. Related Work

D. Nurmi, R.Wolski, C.Grzegorczyk, G. Obertelli, S.Soman, L.Youseff, and D. Zagorodnov present
EUCALYPTUS - an open source framework for cloud computing that applies what we commonly know
Infrastructures as a Service (IaaS); systems that provide users with the ability to run and control full virtual machine
instances implemented through a variety of physical resources [1].

G. Dhiman, G.Marchetti, T. Rosing show through real application of the system on a state-of-the-art testbed of
server machines that vGreen improves both average performance and system-level energy savings by close to 40%
across benchmarks with varying characteristics[2].

Hongbin Liang, Dijiang Huang, LinX.Cai, Xuemin (Sherman) Shen and Daiyuan Peng to propose a Semi-Markov
decision-making based security service model (SSAM) to shape the system's advantage for the cloud provider. First,
we define system states with a tuple expressed by the number of cloud users and its combined security services
division, and the type of current event. Then we are looking at the probability of stable system status and the
likelihood of blocking the service request using the SSAM proposal. Numerical results show that the theoretical
probabilities obtained are consistent with our simulation results [3].

K. S. Trivedi and R. Sahner discuss the modeling tool called SHARPE. SHARPE includes algorithms for fault tree
analysis, acyclic parallel cycle graphs, Markov and semi-Markov acyclic and cyclic models, generalized stochastic
network Petri and single-channel and multichannel networks [4].

L.Li we present the different quality of workforce requirements for cloud computing resource users, we build the
corresponding M / G / 1 preventive pricing template for jobs. So, considering the fate of cloud computing service
providers, which is to get the maximum benefits by offering cloud computing resources, we build the system cost
function for this code model [5].

L.Wangy, G.V.Laszewskiy, M.Kunzez and J.Taoz shows templates for parallel activities and a virtual machine-
based SOA environment. A new parallel programming algorithm, the multidimensional programming algorithm
(MDSA) is designed and implemented in a SOA environment. The simulation results show improved M-DSA
performance compared to random allocation algorithm (RRAA). A case study, alignment application of the
sequence of bio-sequence, is performed in a real SOA environment programmed with M-DSA [6].

N.Bobroff, A.Kochut and K.Beaty has introduced dynamic server migration and a consolidation algorithm is
introduced. It has been shown that the algorithm provides a significant improvement over static server consolidation
by reducing the amount of required capacity and the level of violation of the service level agreement. Advantages
increase for variable workloads and can be expected at shorter intervals than the time scale of demand variability.
The management algorithm reduces the amount of physical capacity needed to support a certain percentage of SLA
violations for a given workload by up to 50% compared to the static consolidation approach [7].

O.Khalid,I.Maljevic and R.Anthony which provides better provisioning of the underlying resources and
customization of the running environment at run time. Despite the gains, the virtualization layer also has a
performance penalty and it is unclear how this overload will affect the performance of systems where jobs are
planned with tight deadlines. In our study, we have tried to address this issue by developing a smart programming
software for virtual machines that monitors load types and deadlines and calculates the system in real time to
maximize the number of jobs completed within the agreed terms [8].

R.Buyya, , C. S. Yeo and Venugopal have architecture proposed for allocation of market-oriented resources within
the clouds. We discussed some representative cloud computing platforms that cover the state of the art. We also
have a vision for creating a global trading platform for cloud services [9].

Rodrigo N. Calheiros, Rajiv Ranjany, and Rajkumar Buyya It has a provisioning technique that automatically adapts
to application workload modifications to facilitate adaptive system management and provides guaranteed quality of
service (QoS) to end users in large, autonomous and highly dynamic environments. We model the behavior and
performance of IT applications and cloud-based IT resources to tailor end-user requests in an adaptive manner. To
improve system efficiency, we use analytical performance (queue network system model) and workload information
 to provide smart system information to an application vendor with limited information on physical infrastructure
[10].

III. Proposed System

In proposed system we minimize the response time of system by using efficient scheduling algorithm. Efficient
scheduling algorithm is known as virtual machine scheduling algorithm. this algorithm is used to schedule VM
request in three queue, main advantages of this algorithm is less execution time because it use multiple queue and it
follows first in first serve principle. For analysis of performance of efficient scheduling and allocation on cloud
infrastructure we use stochastic Markov model approach. Markov model used to change the VM system randomly,
VM future state is only depends on Current state. In Markov model Markov decision process is used, this decision
process is used to apply action vector on VM for transition of state.

The Components of Eucalyptus Architecture:

User1 User1 User1

Amazon Web Services (EC2) UI

Cloud controller (CLC)

CLC, WS3 Walrus Storage controller (WS3)

Efficient Scheduler

Cluster Controller (CC)

Storage Server CC, EBS CC, EBS Elastic Block Storage (EBS)

VM VM VM VM VM VM VM VM

VM VM VM VM VM VM VM VM

VMM VMM VMM VMM

Fig1: Architecture of Proposed System

IV. Steps For Proposed Model

User Request

Efficient Scheduling Queue phase

Resource allocation Decision through

Markovian Model

Virtual machine instance Creation Waiting for resource allocation and

Servicing steps
(i) Resource allocation decision
(ii) Virtual usage (creation and
Deployment)
Virtual machine deployment (iii)VM run time execution

Virtual machine running

Translate these steps into

Analytical model

Virtual machine finishing

Fig2:-process of resource allocation with Markov chain

Three interactive sub-model for analyze the performance of the system based on Markov model
1) Decision model for resource allocation.
2) Usage model for virtual machine.
3) Execution model for virtual machine.
V. Mathematical Approach

1) Decision model for resource allocation.

Average request service unavailable probability (Service unavailable) that a user request will be rejecting due to
incomplete capacity.
n−1
p(1−Pp)(u,p)
Service unavailable= ∑ ( )
u=0 

(i) Measure of service show that user request will be available.

Service available=1- Service unavailable

(ii) Average delay time in resource allocation decision phase E[WRADP]=E[Wq-dec]

E[WRADP] =
n−1
1 (1 − Pr⁡)
∑ (∏(i, r) + ∏(i, p) +  ( + ))
r p
i=0

(1- Service unavailable)

2) Usage model for virtual machine.

This model guess total Hr NCs in the running pool, the arrival rate r to each running NC is given by:


r =
Hr

(i) The constant state probability ( r ) that a running NC cannot accept a job for all request VM type
provisioning:
m−1

∏ = ∑ (∏r(Qr, l, i) + ∏r(Qr, 0, M))

i=0

(ii) Probability for all VM request type that a user request can be confirmed in the running pool

Pr = 1 - (∏r)Hr

(iii) The appearance rate p pending NC is given by:

(1−Pr)
p =
Hp

Average waiting time is-

E([Wusage])=(E[Wvm_q])(queuing delay) + (E[Wprov])(provision delay)

Average response time is-

E[Tresp ]= E([Wusage]) + E[WRADP]

 3) Execution model for virtual machine.

1-Po 1-P1

1
CPU I/O Operation waiting for I/O operation

P1 1

Po

Finishing

Fig3:-Virtual machine execution model for each virtual machine request

1 1 (1−Po) (1−Po)(1−P1)
The VM service time is calculated using –⁡⁡⁡⁡⁡⁡⁡⁡⁡⁡⁡⁡⁡⁡⁡⁡ = +⁡ +
µ Poµc PoP1µ1 PoP1µw

VI. Result and Discussion

In propose system we evaluated user VM request services in two Solutions such as service request available
possibility and mean response time for resource allocation. We can see the job request changing appearance rates,
job service time and system capacity.
An illustration two plan are accept for this model output. Initial one is maximum of one VM on every NC, buffer
size estimate before RADP to be 20, and buffer size within every NC to be zero. In this stochastic model, resource
allocation choice model and VM usage models are analyze in this system.

Table 1. Values of key parameters.

Symbol Meaning Value

1/r,1/p Mean search 4 seconds
delays for
resource
allocation
decision phase:
from a
particular pool
(running and
pending)
1/βr Mean time to 8 minutes
VM for
instantiation and
deployment a
VM on a
running server
1/βp Mean time to 12 minutes
VM for
instantiation and
deployment a
VM on a
pending server
 1/γp Mean time to 20 seconds
prepare on
pending state for
ready to use
1/µ Mean VM 15-30 minutes
service time
λ Cloud user 300-500
request VM request/hr
arrival time
Ηr Number of 8-16 NCs
running NC in
running pool
Ηp Number of 8-16 NCs
pending NC in
pending pool

Here Table 2 indicates numerical result of a settled mean supply and distinct appearance rate at particular number of
node controller. In this experiment, fall client ask for benefit accessible likelihood at developing appearance
rate.Observe arrival rate at 300, 350, 400, 450 and 500 user request VM an hour, for an raise in capacity from 8 to
16 node controller in each pool.

Table2. User request service present probability at various arrival rate

Comparison of service availability result in
Arriv running and pending pools
al (8,8) (12,12) (16,16)
rate( Ser Serv Servi Ser Serv Servi
VMs vic icea ceava vic icea ceava
reque eav vaila ilable eav vaila ilable
st/hr) ail ble (1V aila ble (8VM
abl (8V M) ble (1V s)
e Ms) (8V M)
(1 Ms)
V
M)
300 0.6 0.995 0.977 1 0.999 1
95 85 6 986
350 0.6 0.986 0.949 1 0.999 1
20 20 5 749
400 0.5 0.967 0.909 0.99 0.998 1
37 10 0 999 870
9
450 0.4 0.937 0.861 0.99 0.992 1
42 70 0 999 190
0
500 0.3 0.897 0.809 0.99 0.986 1
73 00 0 983 200
6
Distinctive service time and set up arrival rate comes about are appeared in Table 3. In these tables result, benefit
increment rate increment at expanding number of VM in each pool.
 Table3. User request service available probability at different service time
Comparison of service availability result in
Arri running and pending pools
val (8,8) (12,12) (16,16)
rate( Ser Serv Servi Ser Serv Servi
VM vic icea ceava vic icea ceava
s eav vaila ilable eav vaila ilable
requ ail ble (1V aila ble (8VM
est/ abl (8V M) ble (1V s)
hr) e Ms) (8V M)
(1 Ms)
V
M)
15 0.6 0.986 0.949 1 0.999 1
20 20 5 749
20 0.5 0.921 0.917 1 0.998 1
63 04 5 670
25 0.4 0.081 0.864 0.99 0.993 1
93 63 0 999 460
9
30 0.4 0.046 0.806 0.99 0.980 1
04 30 0 998 700
7
In our experiment for first situation, figure (a) appears, at a settled beginning rate (350 cloud client request for
VM/hr) and mean response time increment at growing service time. . Figure (b) shows that with expanding entry
rate, mean return time increments for a fixed number of NCs in each pool. In Figure (b), detect arrival rate at 300,
350, 400, 450 and 500 user request VM an hour, for an increase in capacity from 8 to 16 NCs in each pool.
600

580

560
16 NCs in
540 each pool
12NCs in
520 each pool
8NCs in
500
each pool
480

460
15 20 25 30

Figure (a). Mean response time for different service time and fixed arrival rate (350 user request VM/hr) at different
number of NCs
 700

600

500
16 NCs in
400 each pool
12NCs in
300 each pool
8NCs in
200 each pool

100

0
300 350 400 450 500

Figure (b). Mean responce time for distinct entry rate and fixed mean service time (15 minutes) at various number of
NCs. In second situation, figure (a) demonstrates that a set up arrival rate and, developing mean responce time at
expanding mean service period. And furthermore, Figure (b) demonstrates that with developing arrival rate, mean
responce time increments for a fixed no. of NCs in each pool. As indicated by these sort, the more number of VM in
every NC the more execution for this system.
600

580

560
16 NCs in
540 each pool
12NCs in
520 each pool
8NCs in
500 each pool

480

460
15 20 25 30

Fig (c). Mean response time for multiple service time and fixed arrival rate (350 user request VM /hr) at different
number of NCs
 550

540

530
16 NCs in
520 each pool
12NCs in
510 each pool
8NCs in
500 each pool

490

480
300 350 400 450 500

Figure (d). Mean response time for distinct arrival rate and fixed mean service time (15 minutes) at different number
of NCs.

VII. Conclusion

It has been widely acknowledged that virtual machines can be utilized as computing resource for high performance
computing. Subsequently, virtual machine scheduling and resource allocation is fundamental in distributed
computing environment. Because of this we represent stochastic Markov model to analyze performance of efficient
scheduling algorithm for resource allocation and scheduling in private cloud system.in this experiment we measure
the impact of variation in workload and system capacity on cloud service quality Variation in work load is depends
upon total user request arrival rate service rate of VM. Our main approach is tractable and caches the Big realistic
feature of large size cloud with decreased complexity of analysis.

REFERENCES

[1] D. Nurmi, R.Wolski, C.Grzegorczyk, G. Obertelli, S.Soman, L.Youseff, and D. Zagorodnov.“The

Eucalyptus open-source cloud-computing system”, In Proceedings of Cloud Computing and Its
Applications, 2008.
[2] G. Dhiman, G.Marchetti, T. Rosing. “vGreen: A System for Energy Efficient Computing in Virtualized
Environments”, ACM, In Proc.ISLPED,2009.
[3] Hongbin Liang, Dijiang Huang, LinX.Cai, Xuemin (Sherman) Shen and Daiyuan Peng, “Resource
Allocation for Security Services in Mobile Cloud Computing”, IEEE,pp. 191-195 ,May 2011.
[4] K. S. Trivedi and R. Sahner, “SHARPE at the age of twenty two,” ACM Sigmetrics Performance
Evaluation Review, vol. 36, no. 4, pp. 52–57, March 2009.
[5] L.Li “An Optimistic Differentiated Service Job Scheduling System for Cloud Computing Service Users and
Providers”, IEEE Third International Conference on Multimedia and Ubiquitous Engineering, pp.295-299,
2009.
[6] L.Wangy, G.V.Laszewskiy, M.Kunzez and J.Taoz “Schedule Distributed Virtual Machines in a Service
Orientedent Environment”, 2009.
[7] N.Bobroff, A.Kochut and K.Beaty “Dynamic placement of virtual machines for managing SLA
violations”,2009
[8] O.Khalid,I.Maljevic and R.Anthony. “Dynamic Scheduling of Virtual Machines Running HPC Workloads
in Scientific Grids”IEEE,2009.
[9] R.Buyya, , C. S. Yeo and Venugopal, “Market oriented cloud computing: Vision, hype, and reality for
delivering IT services as computing utilities”. Proceeding of the 10th IEEE International Conference on the
High Performance Computing and Communications,2008.
[10] Rodrigo N. Calheiros, Rajiv Ranjany, and Rajkumar Buyya, “Virtual Machine Provisioning Based on
Analytical Performance and QoS in Cloud Computing Environments”, 2011.