Please use this identifier to cite or link to this item:
|Title:||LICENSE MANAGEMENT IN CLOUD COMPUTING|
|Keywords:||CLOUD COMPUTING;PROTOCOLS;LICENSE MANAGEMENT;ELECTRONICS AND COMPUTER ENGINEERING|
|Abstract:||Cloud computing is a highly scalable distributed computing platform, and an emerging technology in IT industry, in which computing resources are offered 'as a. service'. These services are categorized in three services software-as-a-service (SaaS), platform-as-a-service (PaaS) and infrastructure-as-a-service (IaaS). We access these services with some specific protocols. So these protocols are bind together and are put together into the form of license by service provider. To access these services we require license, a legal authorization through which a cloud service provider authorized the user to use its resources on pay-per-basis and resources are provided on demand by the service provider. Different auction policies are used to issue the license but no one guarantees that a user will get the license to execute its job. So, due to not being able to make the highest bid for getting license user may stick in starvation condition. So this thesis presents an auction policy in which no user will go in starvation and will get the license. In addition a rejection count is maintained for each user. This' count determines. the number of consecutive rejections for license allocation for use of resources for each user. A threshold value is set on rejection count to prevent very high rejection count for each user. This helps in avoiding starvation and exceedingly high waiting times, for users: In addition this thesis provides authenticated access to the resources through remote license server. Simulation results show that the proposed technique is successfully able to authenticate users and avoid starvation by always allocating resources to users reaching threshold.|
|Research Supervisor/ Guide:||Kumar, Padam|
|Appears in Collections:||MASTERS' DISSERTATIONS (E & C)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.