A New Service Mechanism for Profit Optimizations of a Cloud Provider and Its Users
A New Service Mechanism for Profit Optimizations of a Cloud Provider and Its Users
Project Title: | A New Service Mechanism for Profit Optimizations of a Cloud Provider and Its Users |
Implementation: | Java,MYSQL |
Project Cost: (In Indian Rupees) | Rs.3000/ |
Project Buy Link: | Buy Link |
IEEE BASE PAPER ABSTRACT:
In this paper, we try to design a service mechanism for profit optimizations of both a cloud provider and its multiple users. We consider the problem from a game theoretic perspective and characterize the relationship between the cloud provider and its multiple users as a Stackelberg game, in which the strategies of all users are subject to that of the cloud provider. The cloud provider tries to select and provision appropriate servers and configure a proper request allocation strategy to reduce energy cost while satisfying its cloud users at the same time. We approximate its servers selection space by adding a controlling parameter and configure an optimal request allocation strategy. For each user, we design a utility function which combines the net profit with time efficiency and try to maximize its value under the strategy of the cloud provider. We formulate the competitions among all users as a generalized Nash equilibrium problem (GNEP). We solve the problem by employing variational inequality (VI) theory and prove that there exists a generalized Nash equilibrium solution set for the formulated GNEP. Finally, we propose an iterative algorithm (IA), which characterizes the whole process of our proposed service mechanism. We conduct some numerical calculations to verify our theoretical analyses. The experimental results show that our IA algorithm can benefit both of a cloud provider and its multiple users by configuring proper strategies.
PROJECT OUTPUT VIDEO :
EXISTING SYSTEM:
-
To our knowledge, hardly any previous works investigate multiple users′ profit optimizations, let alone optimizing the profits of a cloud provider and its users at the same time.
-
Mei et al. proposed an energy-aware scheduling algorithm for sporadic tasks. The authors try to reduce energy consumption by using dynamic voltage frequency scaling (DVFS) technique.
-
In existing system, based on DVFS technique and the concept of slack sharing among processors, the authors also proposed two novel energy-aware scheduling algorithms.
DISADVANTAGES OF EXISTING SYSTEM:
-
Since multiple users will try to access the data application performance depends upon the user’s data requests.
-
The existing system unable to avoid the server energy cost.
PROPOSED SYSTEM:
-
In this paper, we try to design a new service mechanism for profit optimizations of both a cloud provider and its multiple users. We consider the problem from a game theoretic perspective and characterize the relationship between the cloud provider and its users as a Stackelberg game, in which the strategies of all users are subject to that of the cloud provider.
-
In our mechanism, the cloud provider tries to select appropriate servers and configure a proper request allocation strategy to reduce energy cost while satisfying its users at the same time.
ADVANTAGES OF PROPOSED SYSTEM:
-
Cost effectiveness will be provided.
-
Application performance will be improved.
-
In this work, we first try to optimize multiple users′ profits. Since multiple cloud users compete for using the resources of a cloud provider, and the utility of each user is affected by the decisions (service request strategies) of other users, it is natural to analyze the behaviors of such systems as strategic games.
-
We characterize the relationship between the cloud provider and its users as a Stackelberg game, and try to optimize the profits of both a cloud provider and its users at the same time.
-
We formulate the competitions among all users as a generalized Nash equilibrium problem (GNEP), and prove that there exists a generalized Nash equilibrium solution set for the formulated GNEP.
-
We solve the GNEP by employing varational inequality (VI) theory and propose an iterative algorithm (IA) to characterize the whole process of our proposed service mechanism.
SYSTEM ARCHITECTURE:
MODULES:
-
Customer
-
Cloud Provider
-
Admin
MODULES DESCRIPTION:
Customer:
In this module, we develop the Customer entity functionalities. Customer is important for a cloud provider to select appropriate servers to provide services, such that it reduces cost as much as possible while satisfying its users at the same time. The reason behind lies in that both of them are not just for the profit of a cloud provider, but for the appeals to more cloud users in the market to use cloud service and thus also impact the profit.
Cloud provider:
The experimental results show that our IA algorithm can benefit both of a cloud provider and its multiple users by configuring proper strategies. The reason behind lies in that both of them are not just for the profit of a cloud provider, but for the appeals to more cloud users in the market to use cloud service and thus also impact the profit.
Admin :
Administrator has the responsibility of ensuring that the administrative activities within an organization run efficiently, by providing structure to other employees throughout the organization. These activities can range from being responsible for the management of human resources, budgets and records, to undertaking the role of supervising other customer. These responsibilities can vary depending on the customer and level of education.
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
-
System : Pentium Dual Core.
-
Hard Disk : 120 GB.
-
Monitor : 15’’ LED
-
Input Devices : Keyboard, Mouse
-
Ram : 1 GB
SOFTWARE REQUIREMENTS:
-
Operating system : Windows 10.
-
Coding Language : JAVA/J2EE
-
Tool : Netbeans 7.2.1
-
Database : MYSQL
REFERENCE:
Chubo Liu, Kenli Li, Senior Member, IEEE, Keqin Li, Fellow, IEEE, and Rajkumar Buyya, Fellow, IEEE, “A New Service Mechanism for Profit Optimizations of a Cloud Provider and Its Users”, IEEE Transactions on Cloud Computing, 2021.
PROJECT COST: Rs.3000/
PROJECT BUY LINK: Click here to buy this project in Online