Font Size: a A A

Research On Resource Allocation And Privacy Protection Strategy In Cloud Environment

Posted on:2022-05-01Degree:MasterType:Thesis
Country:ChinaCandidate:H H ZhangFull Text:PDF
GTID:2518306755951329Subject:Computer technology
Abstract/Summary:PDF Full Text Request
With the rapid development and popularization of the Internet and mobile terminal equipment,cloud computing technology and Location-based Service(LBS)are widely used,bringing great convenience to human industrial production and daily life.At the same time,for cloud service providers that provide LBS services,how to reasonably allocate limited resources(funds)to maximize the throughput of the system and the throughput of a single server is an unsolved problem;Secondly,as it is a location-based service,how to protect users' location privacy when accessing the service is also a widely concerned issue.To solve the above problems,this paper combines game theory and K-anonymity to study resource allocation and privacy protection strategies in the cloud environment.The main work of this paper is as follows:1)Game theory is introduced to solve the contradiction between the overall throughput of the system and the throughput of a single server,maximize the throughput of the system as a whole and of individual servers when resources(funds)are limited;We use K-anonymity to solve the problem of service access location privacy protection issues.2)In order to study the problem of resource(funds)allocation,a task model,cost model,and funding model are constructed for multi-server systems.On this basis,we propose a framework of fund allocation based on cooperative game,then,convex optimization and Lagrangian techniques are used to solve the optimal solution of capital allocation based on the framework proposed in this paper;In the study of privacy protection,a new location privacy protection model based on K-anonymity is proposed,which comprehensively considers the user's query privacy and location privacy.3)Based on the model presented in this paper,we proposed a multi-service fund allocation algorithm to solve the contradiction between the overall system throughput and the throughput of a single server.we propose a location privacy protection algorithm based on K-anonymity to solve the contradiction between privacy protection and service quality.Finally,the validity of the two algorithms is verified by experiments.
Keywords/Search Tags:resource allocation, game theory, convex optimization, location service, privacy protection
PDF Full Text Request
Related items