• In this paper, I am investigate the burstiness-aware server consolidation problem from the perspective of resource reservation, i.e., reserving a certain amount of extra resources on each PM to avoid live migrations, and propose a novel server consolidation algorithm, QUEUE. QUEUE improves the consolidation ratio by up to 45 percent with large spike size and around 30 percent with normal spike size compared with the strategy that provisions for peak workload, and achieves a better balance between performance and energy consumption in comparison with other commonly-used consolidation algorithms.

1. 28-Jan-17 1
Sri Venkateswara College of Engineering & Technology
[AUTONOMOUS]
To Minimize Energy Consumption In a Virtualization
Based On Computing Cloud
Presented by
14781F0031
N.ARUMUGAM
Guided by:Mrs T.RAMATHULASI (Asst.prof)
Sri Venkateswara College of Engineering & Technology

2. 28-Jan-17 2Sri Venkateswara College of Engineering & Technology
Contents
1. Introduction of the Project / Problem Definition
2. Scope of the Project
3. Literature Review
4. System Requirements
5. System Framework / Module Description
6. System Analysis and Design

3. 28-Jan-17 3Sri Venkateswara College of Engineering & Technology
Introduction of the Project/problem definition
• Cloud computing has been gaining more and more traction in the past few years, and it is
changing the way we access and retrieve information.
• A computing cloud where Virtual machines running various applications are aggregated
together to improve resource utilization. That is the cost of energy consumption.
• Making optimal utilization of underlying resources to reduce the energy consumption is
becoming an important issue. To cut back the energy consumption in clouds, server
consolidation is proposed to tightly pack VMs to reduce the number of running
PM’s.However,VMs’ performance may be seriously affected if VMs are not
appropriately placed, especially in a highly consolidated cloud.
• Most of prior studies on server consolidation focused on minimizing the number of
active PMs from the perspective of bin packing (BP).
• Some other research studied the SBP problem assuming VM workload follows normal
distribution. Several other studies focused on workload prediction while the application.

4. 28-Jan-17 4Sri Venkateswara College of Engineering & Technology
Scope of the project
• In this paper, I am investigating the burstiness-aware server consolidation problem
from the perspective of resource reservation.
• That is reserving a certain amount of extra resources on each PM to avoid live
migrations, and propose a novel server consolidation algorithm, QUEUE.
• The resource requirement pattern of each VM as a two-state Markov chain to capture
burstiness, then we design a resource reservation strategy for each PM based on the
stationary distribution of a Markov chain.
• QUEUE improves the consolidation ratio by up to 45 percent with large spike size and
around 30 percent with normal spike size .
• That is compared with the strategy that provisions for peak workload, and achieves a
better balance between performance and energy consumption in comparison with
other commonly-used consolidation algorithms.
• Finally here presenting QUEUE a complete server consolidation algorithm with a
reasonable time complexity and also show how to cope with heterogeneous spikes and
provide remarks on several extensions.

5. 28-Jan-17 5Sri Venkateswara College of Engineering & Technology
Literature review
AUTHOR TITLE DESCRIPTION PUBLICATION
Moreno Marzolla,
Ozalp Babaoglu,
Fabio Panzieri
Server Consolidation in
Clouds through Gossiping
Reducing the cost low
power consumption
modes
20-june-2011
Ningfang Mi,
Giuliano Casale,
Ludmila Cherkasova
Injecting Realistic
Burstiness to a
Traditional Client-Server
Benchmark
client-server
benchmarks do not
provide mechanisms
for injecting burstiness
15-june-2009
Norman Bobroff,
Andrzej Kochut,
Kirk Beaty
Dynamic Placement of
Virtual Machines for
Managing SLA Violations
Server consolidation in
reducing the amount
of required capacity
and the rate of service
level agreement
violations
21-may-2007

6. 28-Jan-17 6Sri Venkateswara College of Engineering & Technology
System requirements
• A structured collection of information that embodies the requirements of a system.
• business analyst, system analyst,
• Business requirements describe in business terms what must be delivered or
accomplished to provide value.
• Product requirements describe properties of a system or product.
• Process requirements describe activities performed by the developing organization.
• Product and process requirements are closely linked. Process requirements often
specify the activities that will be performed to satisfy a product requirement.
• a requirement that the product be maintainable (a Product requirement) often is addressed
by imposing requirements to follow particular development styles

7. 28-Jan-17 7Sri Venkateswara College of Engineering & Technology
System framework/module description
1. Network Formation
2. Two-State Markov Chain Model
3 QUEUE Algorithm
 Network Formation
In this module, we form the computing cloud based on lot of virtual machines (VM)
with lot of Physical Machines (PM).Each virtual and physical machine has a unique id,
each physical machines are connected with any virtual machines. Then we generate the
users and give the unique id for each user. Here each users are connected with our
computing cloud.
 Two-State Markov Chain Model
In this module, we are the first to quantify the amount of reserved resources with
consideration of workload burstiness. Here, we propose to use the two-state Markov chain
model to capture workload burstiness.

8. 28-Jan-17 8Sri Venkateswara College of Engineering & Technology
 QUEUE Algorithm
In this module, we develop a novel algorithm, QUEUE, for burstiness-aware resource
reservation, based on the stationary distribution of a Markov chain. Here, we also show
how to cope with heterogeneous spikes to further improve the performance of QUEUE.

9. 28-Jan-17 9Sri Venkateswara College of Engineering & Technology
System analysis and design
• Technical Feasibility
• Economical Feasibility
TECHNICAL FEASIBILITY
• The technical issue usually raised during the feasibility stage of the investigation includes
in Earlier no system existed to cater to the needs of ‘Secure Infrastructure
Implementation System.
• The current system developed is technically feasible. It is a web based user interface for
audit workflow at NIC-CSD. Thus it provides an easy access to the users.
• The database’s purpose is to create, establish and maintain a workflow among various
entities in order to facilitate all concerned users in their various capacities or roles.
• It provides the technical guarantee of accuracy, reliability and security

10. 28-Jan-17 10Sri Venkateswara College of Engineering & Technology
ECONOMICAL FEASIBILITY
• A system can be developed technically and that will be used if installed must still be a good
investment for the organization.
• In the economical feasibility, the development cost in creating the system is evaluated
against the ultimate benefit derived from the new systems.
• Financial benefits must equal or increase the cost .The system is economically feasible. It
does not require any addition hardware or software.
• Economically It will provide google service and amazon web services.

11. 28-Jan-17 11Sri Venkateswara College of Engineering & Technology
SDLC METHODOLOGY
Spiral Model
• Spiral model was defined by Barry Boehm in his 1988 article, “A spiral Model of
Software Development and Enhancement. This model was not the first model to
discuss iterative development, but it was the first model to explain why the iteration
models.

12. 28-Jan-17 12Sri Venkateswara College of Engineering & Technology
UML DIAGRAMS
Use Case Diagram
User
Allocator
VM Details
Calculate Transition Matrix
Stationary Distribution
Minimum no of Blocks
Cluster VM
Sort PM
First Fit Decrease
VM to PM Allocation

13. 28-Jan-17 13Sri Venkateswara College of Engineering & Technology
Thank you