CONTRACT BASED RESOURCE ALLOCATION IN CLOUD ENVIRONMENT

A PROJECT REPORT Submitted by

AARTHI .R

Under the guidance of

AISHA BANU .W

in partial fulfillment for the award of the degree of MASTER OF TECHNOLOGY in

SOFTWARE ENGINEERING

B.S.ABDUR RAHMAN UNIVERSITY

(B.S. ABDUR RAHMAN INSTITUTE OF SCIENCE & TECHNOLOGY) (Estd. u/s 3 of the UGC Act. 1956) www.bsauniv.ac.in

May 2012

BONAFIDE CERTIFICATE

Certified that this project report CONTRACT BASED RESOURCE ALLOCATION IN CLOUD ENVIRONMENT is the bonafide work of AARTHI .R (RRN: 1026401) who carried out the project work under my supervision. Certified further, that to the best of my knowledge the work reported here in does not form part of any other project report or dissertation on the basis of which a degree or award was conferred on an earlier occasion on this or any other candidate.

SIGNATURE W. AISHA BANU SUPERVISOR Professor of Eminence Department of CSE B.S. Abdur Rahman University Vandalur, Chennai 600 048

SIGNATURE Dr. R. ANGELEENA GEETHA HEAD OF THE DEPARTMENT Professor & Head Department of CSE B.S. Abdur Rahman University Vandalur, Chennai 600 048

BONAFIDE CERTIFICATE
Certified that this project report CONTRACT BASED RESOURCE

ALLOCATION IN CLOUD ENVIRONMENT is the bonafide work of AARTHI .R (RRN: 1026401) who carried out the project work under my supervision. Certified further, that to the best of my knowledge the work reported herein does not form part of any other project report or dissertation on the basis of which a degree or award was conferred on an earlier occasion on this or any other candidate.

SIGNATURE W. AISHA BANU SUPERVISOR Professor of Eminence Department of CSE B.S. Abdur Rahman University Vandalur, Chennai 600 048

SIGNATURE Er. SARDAR MAHABOOB JAN JOINT SUPERVISOR Senior Vice President Coastal Energen Pvt. Ltd. No.5, Moores Road, Chennai 600 006

SIGNATURE Dr. R. ANGELEENA GEETHA HEAD OF THE DEPARTMENT Professor & Head Department of CSE B.S. Abdur Rahman University Vandalur, Chennai 600 048

Abstract The information and the resources present in the cloud computing paradigm can be easily accessed from a web browser by means of customers. The cloud offers services such as: Software as a Service (SaaS),platform as a service(PaaS),Infrastructure as a Service(IaaS).Haizea is a resource lease manager that uses resource leases as resource allocation and implements these leases by allocating Virtual Machines (VMs). Haizea supports four kinds of resource allocation policies: immediate, best effort, advanced reservation and deadline sensitive. It supports deadline sensitive leases in Haizea while minimizing the total number of leases rejected by it.

TABLE OF CONTENTS CHAPTER NO. TITLE ABSTRACT LIST OF TABLE LIST OF FIGURES LIST OF SYMBOLS 1. 1.1 1.2 1.3 1.4 INTRODUCTION Purpose Scope of the project Function point analysis Period planning PAGE NO. iii xvi xviii xxvii 1 45 58 69 75 99 100

2. LITERATURE OVERVIEW 2.1 GENERAL 2.2 .......... 2.2 . 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. PROBLEM DEFINITION (PROPOSED SYSTEM)

REQUIREMENT SPECIFICATION SYSTEM DESIGN IMPLEMENTATION RESULTS CONCLUSION SCOPE FOR FURTHER WORK REFERENCES APPENDICES TECHNICAL BIOGRAPHY (ALL DIAGRAMS)

List of Tables
1. Tab. 1 2. Tab. 2 3. Tab. 3

- Function Points Calculation Table - Period Planning - Period Planning

List of Figures
1. Fig. 1

- Flow Diagram - Flow Diagram - Working of the system

2. Fig. 2 3. Fig. 3

1.INTRODUCTION The Infrastructure as a Service (IaaS) clouds use simple resource allocation policies like immediate and best effort. Immediate allocation policy allocates the resources if available, otherwise the request is rejected. Best-effort policy also allocates the requested resources if available otherwise the request is placed in a FIFO queue. It is not possible for a cloud provider to satisfy all the requests due to finite resources at a time. Haizea uses resource leases as resource allocation abstraction and implements these leases by allocating Virtual Machines (VMs). Haizea supports four kinds of resource allocation policies: immediate, best effort, advanced reservation and deadline sensitive. This work provides a better way to support deadline sensitive leases in Haizea while minimizing the total number of leases rejected by it. Proposed dynamic planning based scheduling algorithm is implemented in Haizea that can admit new leases and prepare the schedule whenever a new lease can be accommodated. 1.1PURPOSE The purpose of this project specifies the requirements of the Policy Based Resource Allocation in IaaS Cloud, which is used to allocate the resources based on the deadline. Those leases that are placed in the queue are rescheduled and minimize the rejection rate of the newly arrived leases. 1.2 SCOPE OF THE PROJECT Immediate allocation policy allocates the resources if available, otherwise the request is rejected. Best-effort policy also allocates the requested resources if available otherwise the request is placed in a queue. The existing algorithm of Haizea to handle deadline sensitive leases tries to find a single time slot to satisfy the whole lease. Haizea is a resource lease manager that tries to address these issues by introducing complex resource allocation policies. Haizea uses resource leases as resource allocation abstraction and implements these leases by allocating Virtual

Machines (VMs). Haizea supports four kinds of resource allocation policies: immediate, best effort, advanced reservation and deadline sensitive.

1.3 Function Point Analysis (FPA) Introduction to Function Point Analysis One of the initial design criteria for function points was to provide a mechanism that both software developers and users could utilize to define functional requirements. It was determined that the best way to gain an understanding of the users' needs was to approach their problem from the perspective of how they view the results an automated system produces. Therefore, one of the primary goals of Function Point Analysis is to evaluate a system's capabilities from a user's point of view. The Five Components of Function Points Data Functions

Internal Logical Files External Interface Files

Transactional Functions

External Inputs External Outputs External Inquiries

FP Calculation Table Weighting Factor Simple Average * * * 3 4 3 4 5 4

Measurement

Count

Complex 6 7 6 = = = 16 10 12

Parameter No. Of user 4 inputs No. Of user 2 outputs No. Of user 3

inquiries No. Of files 3 No. Of 1 external interfaces Count total

* *

7 5

10 7

15 10

= =

30 7

75 Tab. 1

No. Of user inputs : Leaseno,Nodes Submit time(AM),Start time(PM),Duration Deadline(PM) (4) No. Of user outputs : acception rate,rejection rate (2) No. Of user inquiries : used resource,total resource ,utilisation of system(3) No. Of files : client,server,virtual machine (3) No. Of external interfaces : internet (1) FP = count total * [ 0.65 + 0.01 * ( Fi ) ] Count total = 75 ( Fi ) = 46 ( since this is a moderately complex project ) FP = 75 * [ 0.65 + 0.01 * 46 ] FP = 83

1.4 Period Planning PERIOD July 18 July 31 PLANS Understanding the Basic concepts in base paper and presentation of August 01 August 31 September 01 September 30 October 01 October 31 review Implementing scheduling Experimenting timeslot with process 0th in

timeslot

scheduling . (First Review) Implementation of deadline sensitive algorithm and schedules the resources by using swapping technique. Documentation work and Phase I demo

November 01 November 30

Tab. 2

PERIOD January 01 January 31 February 01 February 29 March 01 March 31 April 01 April 30 May 01 May 31 Tab. 3

PLANS Implementing backfilling algorithm Schedule the leases based on deadline Reschedule the leases based on backfilling algorithm Compare swapping algorithm Final Demo and and backfilling Phase II

Documentation work.

2. LITERATURE REVIEW The literature reviews are taken from the suggestions below. They are as follows, Title: Resource Leasing and the Art of Suspending Virtual Machines Using virtual machines as a resource provisioning mechanism offers multiple benefits, most recently exploited by infrastructure-as-a-service clouds, but also poses several scheduling challenges. More specifically, although we can use the suspend/resume/migrate capability of virtual machines to support advance reservation of resources efficiently, by using suspension/resumption as a pre-emption mechanism, this requires adequately modelling the time and resources consumed by these operations to ensure that pre-emptions are completed before the start of a reservation. A model for predicting various runtime overheads involved in using virtual machines, allowing us to efficiently support advance reservations. We extend our lease management software, Haizea, to use this new model in its scheduling decisions, and we use Haizea with the OpenNebula virtual infrastructure manager so the scheduling decisions will be enacted in a Xen cluster. We present both physical and simulated experimental results showing the degree of accuracy of our model and the long-term effects of variables in our model on several workloads.

Title:

An Open Source Solution for Virtual Infrastructure Management in The growing popularity of IaaS clouds, an ecosystem of tools and

Private and Hybrid Clouds technologies is emerging that can transform an organizations existing infrastructure into a private cloud or a hybrid cloud. OpenNebula, an open source virtual infrastructure manager that can be used to deploy virtualized services on both a local pool of resources and on external IaaS clouds, and Haizea, a resource lease manager that can act as a scheduling backend for OpenNebula providing features not found in other cloud software or virtualization-based datacenter management software, such as advance reservations and resource preemption, which we argue to be specially relevant for private and hybrid clouds. Title: Optimal resource allocation in clouds An important problem for such enterprise users is to understand how many and what kinds of virtual machines will be needed from clouds. We formulate demand for computing power and other resources as a resource allocation problem with multiplicity, where computations that have to be performed concurrently are represented as tasks and a later task can reuse resources released by an earlier task. We show that finding a minimized allocation is NP-complete. An approximation algorithm with a proof of its approximation bound that can yield close to optimum solutions in polynomial time. Enterprise users can exploit the solution to reduce the leasing cost and amortize the administration overhead Cloud providers may utilize the solution to share their resources among a larger number of users. 3.PROBLEM DEFINITION Infrastructure as a Service (IaaS) clouds use simple resource allocation policies like immediate and best effort. Immediate allocation policy allocates the resources if available, otherwise the request is rejected. Best-effort policy also allocates the requested resources if available otherwise the request is placed in a queue. The cloud provider does not satisfy all the requests at a time. The deadline sensitive lease in Haizea is used to minimizing the total number of leases rejected by it. Proposed dynamic planning based scheduling algorithm is implemented in Haizea that can admit new leases and prepare the schedule whenever a new lease can be

accommodated. Experiments results show that it maximizes resource utilization and acceptance of leases compared to the existing algorithm of Haizea. 4.REQUIREMENT SPECIFICATION 4.1 Software Requirements

Language Front End Back End

: Java1.6 : Java Swing : SQL Server 2000

Operating System : Windows XP.

4.2 Hardware Requirements

Hard disk RAM Processor

: 60GB : 1GB : P IV

5.SYSTEM DESIGN 5.1 FLOW DIAGRAM:

Fig. 1

Fig.2 5.2 WORKING OF A SYSTEM:

Fig.3

6. IMPLEMENTATION In this analysis phase, we are going to determine whether the clients request is from the local systems or from the global systems. After that the client request the resources from the server, they request the duration for how long they wants to utilize the resources. Schedule the leases by using Immediate Allocation policy and best effort policies. Immediate allocation policy allocates the requested resources if available. Otherwise the request is rejected. But in Haizea the Immediate lease will lead to Deadline sensitivity, if there is situation to reject the request. Best Effort Allocation policy allocates the requested resources if available. Otherwise the request is placed in a queue. The request has to wait for specific time slots The rescheduling processes have been splitted into two processes: Swapping and Backfilling. Swapping is the process of making consecutive lease to swap, if the resource of first lease request for fewer resource than the second lease. Backfilling process finds leases space for the new lease by rescheduling the existing scheduled lease 7. RESULTS The results obtained from this project are: 1. Client registration form is designed for allocating the space in cloud environment. 2. The input is retrieved from the clients. 3. The clients details are stored in the cloud server. 4. Resource on process field was designed and it shows about currently running process details. 5. After finishing the deadline it automatically take next requested client process. 6. The swapping and backfilling algorithm are implemented and schedule the client requests.

7. Finally, this algorithm makes a space for the newly arrived leases and

minimizes the rejection rates of the client requests.

8. CONCLUSION The deadline sensitive algorithm finds multiple slots in addition to finding single slot while scheduling a deadline sensitive lease. It also applies two concepts (swapping and backfilling) in addition to pre-emption, while rescheduling already accommodated leases to make space for a newly arrived lease. Swapping uses the information available about leases to be rescheduled, to decide the order in which they should be rescheduled. When swapping and pre-emption both fails to schedule a lease, the proposed algorithm applies the concept of backfilling. Backfilling can fill up the idle resources, which cannot be filled up by consecutive lease. Backfilling has a disadvantage of requiring more pre-emption, which increases overall overhead of the system. By applying rescheduling when an advance reservation or immediate lease gets rejected, it tries to increase acceptance of leases. 9. SCOPE FOR FURTHER WORK The contribution of my project is finding the timeslot for the newly arrived leases. Split up the timeslot for the larger resources. Using swapping algorithm we have to swap the leases, and make a space for the newly arrived leases. The above mentioned processes are continued periodically for minimizing the resource rejection rate and maximize the resource allocation. 10. REFERENCES [1]. Amit Nathani a, Sanjay Chaudharya, Gaurav Somanib, Policy based resource allocation in IaaS cloud, Future Generation Computer Systems,Elsevier 2011. [2]. B. Sotomayor, R. Montero, I. Llorente, I. Foster, Resource leasing and the art of suspending virtual machines, IEEE International Conference on HPCC-09,June 2009, pp. 19.

[3]. B. Sotomayor, R. Montero, I. Llorente, I. Foster, An Open Source Solution for Virtual Infrastructure Management in Private and Hybrid Clouds, IEEE Internet Computing, 2009, pp. 58. [4]. F. Chang, J. Ren, R. Viswanathan, Optimal resource allocation in clouds, IEEE 3rd International Conference on Cloud Computing (2010) 18. 11.APPENDICES APPENDIX 1 APPENDIX 2A APPENDIX 2B APPENDIX 3 APPENDIX 4 12. TECHNICAL BIOGRAPHY Cover Page and Title Bonafide Certificate Bonafide Certificate Table of Contents Technical Biography

MISS. AARTHI R. (RRN. 1026401)

was born on 23th June 1989, in Paramakudi,

Ramnad (dist). She did her schooling in K.J.E.M and secured 72% in the Higher Secondary Examination.She received B.E. degree in Computer Science and Engineering from Pandian Saraswathi Yadav Engineering College in the year 2010 from Anna University.She is currently pursuing her M.Tech. Degree in Software Engineering in the Department of Computer Science and Engineering of B.S. Abdur Rahman University. Her area of interests include Cloud computing,Database management and systems. The e-mail ID is : aarthiram.89@gmail.com and the contact number is : 9095631292