IPASJ International Journal of Computer Science (IIJCS

)
A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm Email: editoriijcs@ipasj.org ISSN 2321-5992

Dynamic And Efficient Resource Management In Large Cloud
Shilpa Maitra1, Ms. Preetha Mary Ann2, Dr. Saravanan3
1 2&3

Final Year MCA, Sathyabama University, Tamilnadu India Assistant Professor,Sathyabama University, Tamilnadu India

ABSTRACT
Cloud computing is emerging and widely used technology in which a pool of computing resources is available to users. Resource management put challenges in large-scale systems, such as process requests from a large number of clients. We mainly focus on the dynamic resource management in large cloud environment. Distributed middleware architecture is outlined and presented. One of its key advantages is that it allows resource owners to have control over the resource allocation, Schedulers offers SLA contracts for completing a job before deadline and SLA will provide only authorized users to access the application. Resource allocation problem is formalized, such that it dynamically maximizes the cloud utility. u. Initially presents a protocol that assumes static input and produced single output.

Keywords—Cloud computing, distributed computing, resource allocation, Rijndael Manager Encryption.

1. INTRODUCTION
Today’s world cloud computing is everywhere. Cloud computing refers to the delivery of computing resources over the internet. Instead of keeping data on your own hard drive or updating applications for your needs, you use a service over internet, at another location, to store your information or use its application. This work focus on the problem of resource management for a large-scale cloud environment. Such an environment includes the physical infrastructure and that enables the provisioning and management of cloud services. Cloud consumers request for resources. The resources may be software, operating system and applications. The cloud providers provide the resources according to the consumer’s requirement. They are responsible for checking the quality of service. Cloud computing requires a provisioning method for allocating resources to cloud consumers. Cloud computing consists of two provisioning plan for allocating resources in cloud. They are Reservation plan and On-demand plan. Reservation plan is long term plan and On-demand plan is a short term plan. In this paper we focus on On-demand plan, that the consumers can access resources at the time when they need. For on-demand pricing is done as pay-per-use basis. In this paper we also enhance software as a service such as encryption and decryption, which consider time factor, duration of software use.

2. PROBLEM DEFINATION
2.1. Existing System Previously studies captured the problem of gossip resource management. The problem mainly researches: Application management and load balancing in processor network. Application placement in data center is often done through mapping a set of machines (nodes) such as some utility function is maximized under resource constraints. Each node has a specific CPU capacity and memory capacity. When the node is allocated and user require smaller memory than available memory no provision is available, so the user has to pay a higher cost. The solutions from these works have been incorporated in middleware products. While these product solutions, in a similar way as our scheme does, allow for computing an allocation that maximizes the utility, they rely on centralized architectures, which do not scale to system sizes. These studies only based on static input and produced a single output value. 2.2. Proposed System This system, explore a resource provisioning strategy for cloud consumers to minimize resource allocation problems based on the uncertain demand and price in cloud computing environments. An optimal cloud Service Level Agreement (SLA) algorithm is used to minimize the total cost for provisioning resource in a time period. The uncertainty of demand ( cloud consumers side) and price (cloud providers sides) are analyzed to find an optimal solution for the problems that occurs in adjusting the tradeoff between on-demand and oversubscribed costs. Using SLA users can share the memory to any other users through par per basic or open source and user can use unused memory’s to use other applications, and the results show that SLA can minimize the total cost under uncertainty.

Volume 2 Issue 3 March 2014

Page 47

IPASJ International Journal of Computer Science (IIJCS)
A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm Email: editoriijcs@ipasj.org ISSN 2321-5992

Advantages: Number of users can be served simultaneously, Pay per usage model, Automatic Repayment, Allows Resource sharing with other users, Overcomes the problem of under provisioning and over provisioning of resources.

3. EXPERIMENTAL SETUP
3.1. Service Level Agreement Algorithm (SLA) A SLA is a part of a service contract where a service formally defined. SLA is signed between providers and consumer for accessing the service provided by the service provider over the internet. Here SLA is used to minimizing the total cost. 3.2. Rijndael Manager Algorithm It is a block cipher algorithm. Rijndeal uses a key for encryption that has a size of 128,192 or 256 bits, which provides high protection against brute force attacks. In cloud computing security is an important issue, so this method is used for securely exchange keys as well as transferring data. Procedure1: (AUTOMATIC REPAYMENT) Consider under provisioning ŨƤth and ŎƤth over provisioning threshold point measured by the past day performance of specific cloud service. Allocation of cloud service cost according to the level of ŨƤth and ŎƤth is carried out. For example, if the number of demand is more than the threshold point, then considering as an over provisioning and total cost is increased by the threshold point. And if the demand is less than the threshold point considering as under provisioning and decrease the cloud service cost based on threshold point. Here we check for Convergence checking of under provisioning and over provisioning customer. Based on the success outcome of convergence checking automatic repayment process is carried out. ŨƤth = ŎƤth= If n = ŨƤth , Set ŨƤcost = ŨƤcost1 Else if n> ŎƤth Set ŎƤcost= ŎƤcost2 Then set the customer at under provisioning and over provisioning region ŨƤcustomer ŎƤcustomer Automatic repayment is done through these calculations ƮƯ= ḂƯ= ƮɃ= ƮƯͯ ͯ ẋ C/U ṜᾸ= ḂƯ ẋ C/U Procedure 2: (ENCRYPTION) In this data in the plain text is substituted by some pre-defined values from a substitution box for encrypting the text. The substitution box is invertible. byte key <-[4*Nk], word <-w[Nb*(Nr+1)], Nk<- Key Size word temp i=0 while (i < Nk) w[i] = word(key[4*i], key[4*i+1] key[4*i+2]i+3]) i = i+1 end while Procedure 3: (DECRYPTION) Decrypting the block content with the block size and round values. i = Nk while (i < Nb * (Nr+1)]

Volume 2 Issue 3 March 2014

Page 48

IPASJ International Journal of Computer Science (IIJCS)
A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014
temp = w[i-1] if (i mod Nk = 0) temp = SubWord(RotWord(temp)) xor Rcon[i/Nk] else if (Nk > 6 and i mod Nk = 4) temp = SubWord(temp) end if i=i+1 end while

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm Email: editoriijcs@ipasj.org ISSN 2321-5992

ŨƤth ŎƤth RC N ŨƤcost1 ŎƤcost2 ƮƯ CU ḂƯ C/U ƮɃ ṜᾸ Nk, Nb, Nr

Table 1. Abbreviations List Under Provisioning threshold point Over Provisioning threshold point Resource Consumer number of registered cloud resource consumers Under Provisioning Cost Over Provisioning Cost Total Usage Consumed Units Unconsumed Units Bending Usage Cost per Units Total Bill Repayable Amount. Key size, Block size, Round Length

4. EXPERIMENTAL RESULTS
In this paper, the authorized user can buy and use the available cloud storage service and web service. In cloud storage service user can upload files, download files and also view the consumed and unconsumed memory information. Based on the consumed memory automatic repayment was done. In web service enhancing software as a service such as encryption and decryption of data and consider time factor, duration of the software use. Based on these automatic repayment was done.

Fig 1 User Registered Cloud Storage Service and Web service

Volume 2 Issue 3 March 2014

Page 49

IPASJ International Journal of Computer Science (IIJCS)
A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm Email: editoriijcs@ipasj.org ISSN 2321-5992

Fig 2 Upload Files to Cloud Storage

Fig 3.Download Files from Cloud storage

Fig 4. View Memory Information of Cloud Storage

Fig 6. Data Encryption through Web Service

Fig 7. Data Decryption through Web Service

Volume 2 Issue 3 March 2014

Page 50

IPASJ International Journal of Computer Science (IIJCS)
A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014 5. CONCLUSION AND FUTURE ENHANCEMENT

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm Email: editoriijcs@ipasj.org ISSN 2321-5992

Dynamic resource management in large cloud environments is made possible through a Service level Agreement. This mechanism ensures fair resource allocation between sites and users. It also provides minimization of the total cost for resources provisioning under specified time period. Overcomes the demand uncertainty and price uncertainty. Pursuing this goal, we plan to address the following issues in future work. Develop a distributed mechanism that efficiently places new sites, Extend the middleware design to become robust to various types of failures, provide provisioning on reservation plan.

References
[1] A.Filali,A.S. Hafid, and M. Gendreau, “Adaptive Resources Provisioning for Grid Applications and Services,”Proc. IEEE Int’l Conf. Comm., 2008. [2] D.Saravanan, Dr.S.Srinivasan, “Data Mining Framework for Video Data”, In the Proc.of International Conference on Recent Advances in Space Technology Services & Climate Change (RSTS&CC-2010), held at Sathyabama University, Chennai, November 13-15, 2010.Pages 196-198. [3] F. Wuhib, M. Dam, R. Stadler, and A. Clem, “Robust monitoring of network-wide aggregates through gossiping,” IEEE Trans. Network and Service Management, vol. 6, no. 2, pp. 95–109, June 2009. [4] D.Saravanan, Dr.S.Srinivasan, ”Matrix Based Indexing Technique for Video Data “, International journal of Computer Science”, 9 (5): 534-542, 2013,pp 534-542. [5] Y. Kee and C. Kesselman,“Grid Resource Abstraction, Virtualization, and Provisioning for Time-Target Applications,”Proc. IEEE Int’l Symp.Cluster Computing and the Grid, 2008. [6] Y. Jie, Q. Jie, and L. Ying, “A Profile-Based Approach to Just-in-Time Scalability for Cloud Applications,”Proc. IEEE Int’l Conf. Cloud Computing (CLOUD ’09), 2009. [7] D.Saravanan, Dr.S.Srinivasan,“Video Image Retrieval Using Data Mining Techniques “Journal of Computer Applications, Volume V, Issue No.1. Jan-Mar 2012. Pages39-42. ISSN: 0974-1925. [8] D.Saravanan, Dr.S.Srinivasan, “ A proposed New Algorithm for Hierarchical Clustering suitable for Video Data mining.”, International journal of Data Mining and Knowledge Engineering”, Volume 3, Number 9, July 2011.Pages 569 [9] Z. Huang, C. He, and J. Wu, “On- Demand Service in Grid: Architecture Design, Implementation,” Proc.11th Int’l Conf. Parallel and Distributed Systems (ICPADS’05), 2005.

Volume 2 Issue 3 March 2014

Page 51

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.