Nothing Special   »   [go: up one dir, main page]

CN107168797A - Resource regulating method based on dynamic game under cloud environment - Google Patents

Resource regulating method based on dynamic game under cloud environment Download PDF

Info

Publication number
CN107168797A
CN107168797A CN201710335668.5A CN201710335668A CN107168797A CN 107168797 A CN107168797 A CN 107168797A CN 201710335668 A CN201710335668 A CN 201710335668A CN 107168797 A CN107168797 A CN 107168797A
Authority
CN
China
Prior art keywords
user
resource scheduling
game
strategy
cloud environment
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201710335668.5A
Other languages
Chinese (zh)
Inventor
张恒巍
王娜
韩继红
郭松辉
孙磊
李作辉
方晨
熊选东
李瑞峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
PLA Information Engineering University
Original Assignee
PLA Information Engineering University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by PLA Information Engineering University filed Critical PLA Information Engineering University
Priority to CN201710335668.5A priority Critical patent/CN107168797A/en
Publication of CN107168797A publication Critical patent/CN107168797A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5038Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • G06F9/5072Grid computing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • G06F9/5077Logical partitioning of resources; Management or configuration of virtualized resources
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/5021Priority

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Economics (AREA)
  • Tourism & Hospitality (AREA)
  • General Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Mathematical Physics (AREA)
  • Health & Medical Sciences (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明属于基于云计算的资源调度技术领域,具体涉及一种云环境下基于动态博弈的资源调度方法,包括以下步骤:构建云环境下基于动态博弈的资源调度模型;基于动态博弈的资源调度模型,根据各用户任务的属性高低分配选择资源的优先权;对任务属性相同的用户采取先申请先选择分配优先权的策略,并将各用户的收益定义为其QoS的满意度;利用逆向归纳法求解博弈的纳什均衡解。本发明针对云环境下多个用户由于同时提交任务而引起的资源竞争问题,建立云环境动态博弈资源调度模型,利用动态博弈理论对各个用户之间的资源竞争进行建模和分析,尽可能地满足所有用户的QoS需求;从而在最大程度上满足各个用户的需求;利用逆向归纳法求解动态博弈模型的纳什均衡解,从而实现了资源最合理有效的配置。

The invention belongs to the technical field of resource scheduling based on cloud computing, and specifically relates to a resource scheduling method based on a dynamic game in a cloud environment, comprising the following steps: constructing a resource scheduling model based on a dynamic game in a cloud environment; a resource scheduling model based on a dynamic game , allocate the priority of resource selection according to the attributes of each user task; for users with the same task attributes, adopt the strategy of applying first and choosing first to allocate priority, and define the income of each user as its QoS satisfaction; use the reverse induction method Find the Nash equilibrium solution of the game. Aiming at the problem of resource competition caused by multiple users submitting tasks at the same time in the cloud environment, the present invention establishes a dynamic game resource scheduling model in the cloud environment, uses dynamic game theory to model and analyze resource competition among users, and maximizes Meet the QoS requirements of all users; thus satisfy the needs of each user to the greatest extent; use the reverse induction method to solve the Nash equilibrium solution of the dynamic game model, thereby realizing the most reasonable and effective allocation of resources.

Description

云环境下基于动态博弈的资源调度方法Resource scheduling method based on dynamic game in cloud environment

技术领域technical field

本发明属于基于云计算的资源调度技术领域,具体涉及一种云环境下基于动态博弈的资源调度方法。The invention belongs to the technical field of resource scheduling based on cloud computing, and in particular relates to a dynamic game-based resource scheduling method in a cloud environment.

背景技术Background technique

云计算是在网格计算、并行计算和P2P等技术基础上发展起来的一种新兴计算模型。它将存储在数据中心集群上的大量计算资源、存储资源与软件资源链接在一起(包括CPU,内存,硬盘等硬件资源,以及开发环境、应用程序等软件资源),进行集中统一管理,形成大规模的共享虚拟资源池,按需提供给用户使用,为其提供“召之即来,挥之即去”且似乎“能力无限”的云服务。随着分布式技术的飞速发展,云计算已经成为一个关键的研究领域。云计算是建立在体系结构(Service Oriented Architecture,SOA)之上,以服务的方式提供计算资源,用户可以按需获取云服务。Cloud computing is a new computing model developed on the basis of grid computing, parallel computing and P2P technologies. It links together a large number of computing resources, storage resources and software resources stored on the data center cluster (including hardware resources such as CPU, memory, hard disk, and software resources such as development environment and application programs), and performs centralized and unified management to form a large Large-scale shared virtual resource pools are provided to users on demand, providing them with cloud services that are "on call, go away" and seem to have "unlimited capabilities". With the rapid development of distributed technology, cloud computing has become a key research field. Cloud computing is based on Service Oriented Architecture (SOA), which provides computing resources in the form of services, and users can obtain cloud services on demand.

随着云计算的快速发展,海量资源融入云中,用户需求不断增加,云计算中心提供的服务不断增多,面临着巨大的资源调度压力。由于云计算系统处于一个动态的环境中,并且用户群体十分庞大,每个应用程序有着持续不断变化的资源需求,导致它的性能需要动态的被满足[8]。另一方面,云计算使用虚拟化技术屏蔽了底层硬件的复杂性,提高了灵活性。在多用户环境下,大量用户的应用程序运行在一台物理设备上,共享硬件和存储设备。云计算的按需资源供应和多用户资源共享,导致云计算资源调度问题成为继云计算中安全问题之后的第二大难题。With the rapid development of cloud computing, massive resources are integrated into the cloud, user demands continue to increase, and the services provided by cloud computing centers continue to increase, facing huge pressure on resource scheduling. Because the cloud computing system is in a dynamic environment, and the user group is very large, each application program has continuously changing resource requirements, resulting in its performance needs to be dynamically satisfied [8] . On the other hand, cloud computing uses virtualization technology to shield the complexity of the underlying hardware and improve flexibility. In a multi-user environment, a large number of user applications run on one physical device, sharing hardware and storage devices. The on-demand resource supply and multi-user resource sharing of cloud computing make the resource scheduling problem of cloud computing become the second biggest problem after the security problem in cloud computing.

在云计算服务资源调度过程中,多个用户先后提交任务请求,根据请求的时间节点可以划分成多个用户组。它们要求使用同一类资源,但是调度过程中又要保证先提交的用户组不能独占该类资源,这就形成了不同用户组之间的资源竞争。为了满足每个用户组的需求,符合用户组提出的约束条件如任务完成时间、完成任务所需开销等等,同时达到资源的最合理有效的使用和配置,就需要建立基于动态博弈的竞争模型,设计一种公平有效的资源调度方法,用于解决云服务资源调度中多用户非同时申请资源的竞争问题,既提高资源调度效率又保证资源分配公平性。In the process of cloud computing service resource scheduling, multiple users submit task requests successively, and can be divided into multiple user groups according to the time node of the request. They require the same type of resources, but during the scheduling process, it must be ensured that the user group submitted first cannot monopolize this type of resource, which forms resource competition among different user groups. In order to meet the needs of each user group, meet the constraints proposed by the user group, such as task completion time, the cost of completing the task, etc., and at the same time achieve the most reasonable and effective use and allocation of resources, it is necessary to establish a competition model based on dynamic games , to design a fair and effective resource scheduling method, which is used to solve the competition problem of multi-user non-simultaneous application resources in cloud service resource scheduling, which not only improves the efficiency of resource scheduling but also ensures the fairness of resource allocation.

现有技术一般采用基于智能优化算法的资源调度,从调度中心整体利益出发,把智能算法运用于云计算资源调度,提高了资源调度效率,保证了系统的性能。但不足之处是以调度中心整体利益为主,不能满足所有用户的资源需求,不能保证资源分配公平性。The existing technology generally adopts resource scheduling based on intelligent optimization algorithms. Starting from the overall interests of the scheduling center, intelligent algorithms are applied to cloud computing resource scheduling, which improves resource scheduling efficiency and ensures system performance. However, the shortcoming is that the overall interests of the dispatching center are the main priority, and it cannot meet the resource needs of all users, and cannot guarantee the fairness of resource allocation.

另外一种是基于博弈论的资源调度,满足了个体理性与激励兼容特性,不足之处是过分追求云计算资源价格,未保证用户其他的需求,即未保证用户的服务质量QoS(Quality of Service)。The other is resource scheduling based on game theory, which satisfies the characteristics of individual rationality and incentive compatibility. The shortcoming is that the price of cloud computing resources is excessively pursued, and other needs of users are not guaranteed, that is, the quality of service QoS (Quality of Service) of users is not guaranteed. ).

博弈论是经济学最基本的理论之一,用于解决不同个体之间的竞争与相互制衡问题,在西方社会科学中被认为是20世纪社会科学领域取得的最大成果。而博弈论是用于解决不同个体之间的竞争与相互制衡问题,在西方社会科学中被认为是20世纪社会科学领域取得的最大成果。博弈论作为研究参与者竞争的理论,在对不同个体之间的竞争进行建模和分析方面具有非常高的价值。针对云服务资源调度中多用户非同时申请资源的竞争问题,本发明基于动态博弈论,提出一种合理有效的资源调度模型及方法,用于解决云环境中多用户资源竞争问题,提高资源调度效率。Game theory is one of the most basic theories in economics. It is used to solve the competition and mutual checks and balances between different individuals. It is considered in the western social sciences to be the greatest achievement in the field of social sciences in the 20th century. Game theory is used to solve the competition and mutual checks and balances between different individuals, and is considered to be the greatest achievement in the field of social science in the 20th century in Western social science. Game theory, as a theory of competition among participants, has very high value in modeling and analyzing the competition among different individuals. Aiming at the competition problem of multi-user non-simultaneous application for resources in cloud service resource scheduling, the present invention proposes a reasonable and effective resource scheduling model and method based on dynamic game theory, which is used to solve the problem of multi-user resource competition in cloud environment and improve resource scheduling. efficiency.

发明内容Contents of the invention

本发明针对现有技术基于智能优化算法的资源调度存在以调度中心整体利益为主,不能满足所有用户的资源需求,不能保证资源分配公平性问题和基于博弈论的资源调度,存在过分追求云计算资源价格,未保证用户其他的需求,即未保证用户的服务质量问题,提出一种云环境下基于动态博弈的资源调度方法。The present invention aims at resource scheduling based on intelligent optimization algorithm in the prior art, which mainly focuses on the overall interests of the scheduling center, cannot meet the resource requirements of all users, cannot guarantee the fairness of resource allocation, and resource scheduling based on game theory, there is an excessive pursuit of cloud computing The price of resources does not guarantee the other needs of users, that is, the quality of service of users is not guaranteed. A resource scheduling method based on dynamic game in cloud environment is proposed.

本发明的技术方案是:一种云环境下基于动态博弈的资源调度方法,包括以下步骤:The technical solution of the present invention is: a resource scheduling method based on dynamic game in a cloud environment, comprising the following steps:

步骤1:构建云环境下基于动态博弈的资源调度模型;Step 1: Build a resource scheduling model based on dynamic games in the cloud environment;

步骤2:基于动态博弈的资源调度模型,根据各用户任务的属性高低分配选择资源的优先权;Step 2: Based on the resource scheduling model of dynamic game, assign the priority of selecting resources according to the attributes of each user task;

步骤3:对任务属性相同的用户采取先申请先选择分配优先权的策略,并将各用户的收益定义为其QoS的满意度;Step 3: For users with the same task attributes, adopt the strategy of applying first and choosing first to allocate priority, and define the income of each user as its QoS satisfaction;

步骤4:利用逆向归纳法求解博弈的纳什均衡解。Step 4: Solve the Nash equilibrium solution of the game by using the reverse induction method.

所述的云环境下基于动态博弈的资源调度方法,所述步骤1中云环境下资源调度是指在资源虚拟化基础上,资源调度中心动态地分配各用户执行任务所需的计算资源,为执行任务提供可行性环境;云环境下资源调度过程中,物理资源被云系统虚拟化成虚拟单元,作为执行任务的载体。In the resource scheduling method based on dynamic game in the cloud environment, the resource scheduling in the cloud environment in the step 1 means that on the basis of resource virtualization, the resource scheduling center dynamically allocates the computing resources required by each user to perform tasks, for The execution task provides a feasible environment; in the process of resource scheduling in the cloud environment, the physical resources are virtualized into virtual units by the cloud system as the carrier of the execution task.

所述的云环境下基于动态博弈的资源调度方法,所述云环境动态博弈资源调度模型是一个五元组,即MCED-GRSM=(N,T,S,I,U),其中:N=(N1,N2,…,Nn)是博弈的参与者集合,参与者是某一时间片段所有发送任务请求的用户;T=(T1,T2,…,Tn)是参与者的行动顺序,即在某一时间片段用户选择资源的先后顺序;S=(S1,S2,…,Sn)是参与者的策略空间,表示参与者Ni的策略空间,每个参与者都应有1种以上的策略,即h≥1;In the resource scheduling method based on dynamic game in the cloud environment, the dynamic game resource scheduling model in the cloud environment is a quintuple, that is, MCED-GRSM=(N, T, S, I, U), wherein: N= (N 1 ,N 2 ,…,N n ) is the set of participants in the game, and the participants are all users who send task requests in a certain time segment; T=(T 1 ,T 2 ,…,T n ) is the participant The sequence of actions of the user, that is, the order in which the user selects resources in a certain time segment; S = ( S 1 , S 2 ,…,S n ) is the strategy space of the participants, Represents the strategy space of the participant N i , each participant should have more than one strategy, that is h≥1;

I=(I1,I2,…,In)是参与者的信息集,表示参与者Ni的信息集,每个参与者都应有1种以上的策略,即k≥1;I=(I 1 ,I 2 ,…, In ) is the participant’s information set, Represents the information set of participant N i , each participant should have more than one strategy, that is, k≥1;

U=(U1,U2,…,Un)是参与者的收益函数集合,表示用户n在用户1,2,…,n-1行动之后选择策略sn的收益;收益函数表示参与者从博弈中可以得到的收益水平,由所有参与者的策略共同决定,参与者不同的策略组合所得到的收益不同。U=(U 1 ,U 2 ,…,U n ) is the set of profit functions of the participants, Indicates the income of user n choosing strategy s n after user 1, 2, ..., n-1 actions; the income function indicates the level of income that participants can get from the game, which is jointly determined by the strategies of all participants, and different participants The benefits obtained by the strategy combination are different.

所述的云环境下基于动态博弈的资源调度方法,所述调度模型满足三个假设,即:理性假设:假设各用户是完全理性的,不会因要获得最大收益而发送毫无意义、恶意占用资源的任务请求;类型假设:假设不同用户的需求不同,提出的QoS不同;收益假设:假设所有用户的目标都是在满足自己QoS的前提下,请求资源来完成任务,资源调度中心的目标是尽可能满足所有用户提出的需求,反馈资源完成其任务。In the resource scheduling method based on dynamic game in the cloud environment, the scheduling model satisfies three assumptions, namely: rational assumption: it is assumed that each user is completely rational and will not send meaningless, malicious Resource-occupied task requests; type assumption: assuming that different users have different requirements, and propose different QoS; revenue assumption: assuming that all users’ goals are to request resources to complete tasks under the premise of satisfying their own QoS, the goal of the resource scheduling center It is to meet the needs of all users as much as possible, and feedback resources to complete their tasks.

所述的云环境下基于动态博弈的资源调度方法,所述步骤3中用户的收益定义为其QoS的满意度利用云环境资源调度博弈树来衡量,云环境资源调度博弈树用一个三元组表示(N,S,U)表示,其中N表示所有节点集合,代表资源调度中所有用户的集合;S是博弈树中有向边的集合,代表资源调度中用户的策略;U则是用户收益的集合,代表在不同策略下取得的收益。In the resource scheduling method based on dynamic game in the cloud environment, the user's income in step 3 is defined as its QoS satisfaction using the cloud environment resource scheduling game tree to measure, and the cloud environment resource scheduling game tree uses a triplet Represents (N, S, U) representation, where N represents the set of all nodes, representing the set of all users in resource scheduling; S is the set of directed edges in the game tree, representing the user's strategy in resource scheduling; U is the user's income A collection of , representing the gains obtained under different strategies.

所述的云环境下基于动态博弈的资源调度方法,所述QoS的满意度用各用户的收益来衡量,即,Ui(s1,…,si)=ε1Q12Q2+...+εnQn+…,其中Q代表服务质量指标,ε12,…,εn代表用户对各类指标的权重,ε12,…,εn∈(0,1)。εiQi代表了用户对i类型资源服务质量的满意度;而资源调度中心的收益是所有用户的总收益,即: In the resource scheduling method based on dynamic game in the cloud environment, the QoS satisfaction is measured by the income of each user, that is, U i (s 1 ,...,s i )=ε 1 Q 12 Q 2 +...+ε n Q n +…, where Q represents the service quality index, ε 1 , ε 2 ,…,ε n represent the user’s weight on various indexes, ε 12 ,…,ε n ∈ (0,1). ε i Q i represents the user's satisfaction with the service quality of i-type resources; and the revenue of the resource scheduling center is the total revenue of all users, namely:

所述的云环境下基于动态博弈的资源调度方法,所述步骤4具体为:从博弈终点节的直接前行节开始,然后通过博弈树逆向归纳的方法,被称为博弈中的逆向归纳法;求解是从扩展博弈树的底端开始,考虑用户n的子博弈,如果用户n-1选择策略则对于用户n来说选择策略优于选择其他任何一个策略,同样的,当用户n-1选择策略时,用户n的最优策略是各用户知道这些信息,因此用户n-1会选择策略来最大化自己的利益,这样,求解出子均衡博弈解以此类推,最终求解出均衡博弈解 In the resource scheduling method based on a dynamic game in the cloud environment, the step 4 is specifically: start from the node directly preceding the end node of the game, and then use the game tree reverse induction method, which is called the reverse induction method in the game ; The solution is to start from the bottom of the extended game tree, considering the subgame of user n, if user n-1 chooses a strategy Then for user n the choice strategy Better than choosing any other strategy. Similarly, when user n-1 chooses strategy When , the optimal strategy for user n is Each user knows this information, so user n-1 will choose a strategy To maximize their own interests, in this way, solve the sub-equilibrium game solution By analogy, the equilibrium game solution is finally solved

所述的云环境下基于动态博弈的资源调度方法,所述云环境动态博弈资源调度模型中,策略是一个纳什均衡,如果对于所有的i∈N,的一个最优反应,也即对于所有的si∈Si和所有的i∈N,有:其中,表示用户i在用户i-1行动之后选择最优策略的收益,表示用户i在用户i-1行动之后选择非最优策略si的收益。In the resource scheduling method based on dynamic game in the cloud environment, in the dynamic game resource scheduling model in the cloud environment, the strategy is a Nash equilibrium if for all i∈N, yes An optimal response for , that is, for all s i ∈ S i and all i ∈ N, is: in, Indicates that user i chooses the optimal strategy after the action of user i-1 income, Denotes the benefit of user i choosing non-optimal strategy si after user i-1 takes action.

本发明的有益效果是:本发明针对云环境下多个用户由于同时提交任务而引起的资源竞争问题,建立云环境动态博弈资源调度模型,利用动态博弈理论对各个用户之间的资源竞争进行建模和分析,尽可能地满足所有用户的QoS需求;基于用户对各类指标的权重建立收益函数,全方位考虑了各用户对资源的类型及需求程度的差异;设计了最优资源选择策略,优先保障任务级别高的用户先选择任务资源,对于任务级别相同的用户采取先申请先选择的原则,从而在最大程度上满足各个用户的需求;利用逆向归纳法求解动态博弈模型的纳什均衡解,从而实现了资源最合理有效的配置。The beneficial effects of the present invention are: the present invention aims at the problem of resource competition caused by multiple users submitting tasks at the same time in the cloud environment, establishes a dynamic game resource scheduling model in the cloud environment, and utilizes dynamic game theory to construct resource competition among users Model and analysis, to meet the QoS requirements of all users as much as possible; establish a revenue function based on the weight of users on various indicators, comprehensively consider the differences in resource types and demand levels of each user; design the optimal resource selection strategy, Prioritize the selection of task resources by users with high task levels, and adopt the principle of first application and first selection for users with the same task level, so as to meet the needs of each user to the greatest extent; use the reverse induction method to solve the Nash equilibrium solution of the dynamic game model, So as to achieve the most reasonable and effective allocation of resources.

附图说明Description of drawings

图1为本发明的调度方法框图;Fig. 1 is a block diagram of the scheduling method of the present invention;

图2为云环境资源调度博弈树结构示意图;Fig. 2 is a schematic diagram of the cloud environment resource scheduling game tree structure;

图3为云环境资源调度结构示意图;FIG. 3 is a schematic diagram of a cloud environment resource scheduling structure;

图4为高级别任务的云环境资源调度博弈树结构示意图;Fig. 4 is a schematic diagram of the game tree structure of cloud environment resource scheduling for high-level tasks;

图5为低级别任务云环境资源调度博弈树结构示意图;Figure 5 is a schematic diagram of the low-level task cloud environment resource scheduling game tree structure;

具体实施方式detailed description

实施例1:结合图1-图5,一种云环境下基于动态博弈的资源调度方法,包括以下步骤:Embodiment 1: In combination with Fig. 1-Fig. 5, a resource scheduling method based on dynamic game in a cloud environment includes the following steps:

步骤1:构建云环境下基于动态博弈的资源调度模型;步骤2:基于动态博弈的资源调度模型,根据各用户任务的属性高低分配选择资源的优先权;步骤3:对任务属性相同的用户采取先申请先选择分配优先权的策略,并将各用户的收益定义为其QoS的满意度;步骤4:利用逆向归纳法求解博弈的纳什均衡解。Step 1: Construct a resource scheduling model based on dynamic game in the cloud environment; Step 2: Based on the resource scheduling model of dynamic game, assign the priority of selecting resources according to the attribute level of each user task; Step 3: Take the same task attribute for users Apply first and choose the strategy of assigning priority first, and define the income of each user as its QoS satisfaction; Step 4: Use the reverse induction method to find the Nash equilibrium solution of the game.

具体的,步骤1中云环境下资源调度是指在资源虚拟化基础上,资源调度中心动态地分配各用户执行任务所需的计算资源,为执行任务提供可行性环境;云环境下资源调度过程中,物理资源被云系统虚拟化成虚拟单元,作为执行任务的载体。Specifically, resource scheduling in the cloud environment in step 1 refers to the resource scheduling center dynamically allocating the computing resources required by each user to perform tasks on the basis of resource virtualization, and providing a feasible environment for task execution; the resource scheduling process in the cloud environment In the cloud system, physical resources are virtualized into virtual units, which serve as carriers for executing tasks.

具体的,云环境动态博弈资源调度模型是一个五元组,即MCED-GRSM=(N,T,S,I,U),其中:N=(N1,N2,…,Nn)是博弈的参与者集合,参与者是某一时间片段所有发送任务请求的用户;T=(T1,T2,…,Tn)是参与者的行动顺序,即在某一时间片段用户选择资源的先后顺序;S=(S1,S2,…,Sn)是参与者的策略空间,表示参与者Ni的策略空间,每个参与者都应有1种以上的策略,即h≥1;Specifically, the cloud environment dynamic game resource scheduling model is a quintuple, that is, MCED-GRSM=(N,T,S,I,U), where: N=(N 1 ,N 2 ,…,N n ) is The set of participants in the game, the participants are all users who send task requests in a certain time period; T=(T 1 ,T 2 ,…,T n ) is the action sequence of the participants, that is, the user chooses resources in a certain time period sequence; S= ( S 1 ,S 2 ,…,S n ) is the strategy space of the participants, Represents the strategy space of the participant N i , each participant should have more than one strategy, that is h≥1;

I=(I1,I2,…,In)是参与者的信息集,表示参与者Ni的信息集,每个参与者都应有1种以上的策略,即k≥1;I=(I 1 ,I 2 ,…, In ) is the participant’s information set, Represents the information set of participant N i , each participant should have more than one strategy, that is, k≥1;

U=(U1,U2,…,Un)是参与者的收益函数集合,表示用户n在用户1,2,…,n-1行动之后选择策略sn的收益;收益函数表示参与者从博弈中可以得到的收益水平,由所有参与者的策略共同决定,参与者不同的策略组合所得到的收益不同。U=(U 1 ,U 2 ,…,U n ) is the set of profit functions of the participants, Indicates the income of user n choosing strategy s n after user 1, 2, ..., n-1 actions; the income function indicates the level of income that participants can get from the game, which is jointly determined by the strategies of all participants, and different participants The benefits obtained by the strategy combination are different.

所述的云环境下基于动态博弈的资源调度方法,所述调度模型满足三个假设,即:理性假设:假设各用户是完全理性的,不会因要获得最大收益而发送毫无意义、恶意占用资源的任务请求;类型假设:假设不同用户的需求不同,提出的QoS不同;收益假设:假设所有用户的目标都是在满足自己QoS的前提下,请求资源来完成任务,资源调度中心的目标是尽可能满足所有用户提出的需求,反馈资源完成其任务。In the resource scheduling method based on dynamic game in the cloud environment, the scheduling model satisfies three assumptions, namely: rational assumption: it is assumed that each user is completely rational and will not send meaningless, malicious Resource-occupied task requests; type assumption: assuming that different users have different requirements, and propose different QoS; revenue assumption: assuming that all users’ goals are to request resources to complete tasks under the premise of satisfying their own QoS, the goal of the resource scheduling center It is to meet the needs of all users as much as possible, and feedback resources to complete their tasks.

具体的,步骤3中用户的收益定义为其QoS的满意度利用云环境资源调度博弈树来衡量,云环境资源调度博弈树用一个三元组表示(N,S,U)表示,其中N表示所有节点集合,代表资源调度中所有用户的集合;S是博弈树中有向边的集合,代表资源调度中用户的策略;U则是用户收益的集合,代表在不同策略下取得的收益。Specifically, in step 3, the user's benefit is defined as its QoS satisfaction, which is measured by the cloud environment resource scheduling game tree, which is represented by a triplet representation (N, S, U), where N represents The set of all nodes represents the set of all users in resource scheduling; S is the set of directed edges in the game tree, representing the user's strategy in resource scheduling; U is the set of user benefits, representing the benefits obtained under different strategies.

具体的,QoS的满意度用各用户的收益来衡量,即,Ui(s1,…,si)=ε1Q12Q2+...+εnQn+…,其中Q代表服务质量指标,ε12,…,εn代表用户对各类指标的权重,ε12,…,εn∈(0,1)。εiQi代表了用户对i类型资源服务质量的满意度;而资源调度中心的收益是所有用户的总收益,即: Specifically, the QoS satisfaction is measured by the income of each user, that is, U i (s 1 ,...,s i )=ε 1 Q 12 Q 2 +...+ε n Q n +..., Among them, Q represents the service quality index, ε 1 , ε 2 ,…,ε n represent the user’s weight on various indexes, ε 1 , ε 2 ,…,ε n ∈(0,1). ε i Q i represents the user's satisfaction with the service quality of i-type resources; and the revenue of the resource scheduling center is the total revenue of all users, namely:

具体的,步骤4具体为:从博弈终点节的直接前行节开始,然后通过博弈树逆向归纳的方法,被称为博弈中的逆向归纳法;求解是从扩展博弈树的底端开始,考虑用户n的子博弈,如果用户n-1选择策略则对于用户n来说选择策略优于选择其他任何一个策略,同样的,当用户n-1选择策略时,用户n的最优策略是各用户知道这些信息,因此用户n-1会选择策略来最大化自己的利益,这样,求解出子均衡博弈解以此类推,最终求解出均衡博弈解 Specifically, step 4 is specifically: start from the node directly preceding the end node of the game, and then use the game tree reverse induction method, which is called the reverse induction method in the game; the solution starts from the bottom of the extended game tree, considering A subgame for user n, if user n-1 chooses a strategy Then for user n the choice strategy Better than choosing any other strategy. Similarly, when user n-1 chooses strategy When , the optimal strategy for user n is Each user knows this information, so user n-1 will choose a strategy To maximize their own interests, in this way, solve the sub-equilibrium game solution By analogy, the equilibrium game solution is finally solved

具体的,云环境动态博弈资源调度模型中,策略是一个纳什均衡,如果对于所有的i∈N,的一个最优反应,也即对于所有的si∈Si和所有的i∈N,有:其中,表示用户i在用户i-1行动之后选择最优策略的收益,表示用户i在用户i-1行动之后选择非最优策略si的收益。Specifically, in the cloud environment dynamic game resource scheduling model, the strategy is a Nash equilibrium if for all i∈N, yes An optimal response for , that is, for all s i ∈ S i and all i ∈ N, is: in, Indicates that user i chooses the optimal strategy after the action of user i-1 income, Denotes the benefit of user i choosing non-optimal strategy si after user i-1 takes action.

实施例2,结合图1-图5,一种云环境下基于动态博弈的资源调度方法,云环境下资源调度是指在资源虚拟化基础上,资源调度中心动态地分配各用户执行任务所需的计算资源,为执行任务提供可行性环境,是各类任务顺利实施的基础。即在云环境资源调度过程中,物理资源被云系统虚拟化成虚拟单元,作为执行任务的载体。用户执行任务往往对应一种最佳的虚拟单元类型,而任意充足的物理资源(如各类传感器、计算机、数据库等)都可以创建这些对应的虚拟单元,进而可以分配给各用户来完成其任务。但不同的创建方案直接影响用户获得的服务质量QoS(Quality of Service),即影响用户执行任务的效率,因此QoS是各用户争夺的主要目标。Embodiment 2, in combination with Fig. 1-Fig. 5, a resource scheduling method based on dynamic game in cloud environment. Resource scheduling in cloud environment means that resource scheduling center dynamically allocates resources required by each user to perform tasks on the basis of resource virtualization. Computing resources provide a feasible environment for the execution of tasks, which is the basis for the smooth implementation of various tasks. That is, in the resource scheduling process of the cloud environment, physical resources are virtualized into virtual units by the cloud system, which are used as carriers for executing tasks. The user's execution of tasks often corresponds to an optimal type of virtual unit, and any sufficient physical resources (such as various sensors, computers, databases, etc.) can create these corresponding virtual units, and then can be assigned to each user to complete their tasks . However, different creation schemes directly affect the QoS (Quality of Service) obtained by users, that is, affect the efficiency of users in performing tasks, so QoS is the main goal for users to compete for.

动态博弈论是指参与人的行动有先后顺序,而且行动在后者可以观察到前者的选择,并据此做出相应的选择。而扩展博弈是通过树的形式来描述一组博弈序列,完全信息博弈是指在博弈的过程中,每个博弈参与者都了解其他参与者选择不同策略的收益情况,也知道之前所有发生过的决策。而多用户服务资源调度的特点如下:(1)用户根据各自的需求在不同时间节点提交任务请求,可以认为是先后顺序进行,根据用户的请求时间划分为不同的用户组;(2)虽然云计算资源池趋近无限大,但资源性能有差别。某个高性能资源如果被多个用户使用就会大大降低该资源性能,所以前一个用户的策略会影响后一个用户的策略选择,即用户策略相互制约;(3)云计算调度中心掌握用户申请的先后顺序、请求内容及收益函数。因此,多用户服务资源调度的过程可以看作是动态博弈中完全信息扩展博弈的过程,所以本发明是在云计算资源调度中心建立基于完全信息扩展博弈的多用户资源调度模型。Dynamic game theory means that the actions of the participants have a sequence, and the actions of the latter can observe the choices of the former, and make corresponding choices accordingly. The extended game is to describe a set of game sequences in the form of a tree. The complete information game means that in the process of the game, each game participant knows the benefits of other participants choosing different strategies, and also knows all the previous events. decision making. The characteristics of multi-user service resource scheduling are as follows: (1) Users submit task requests at different time nodes according to their own needs, which can be regarded as sequential, and are divided into different user groups according to the user's request time; (2) Although the cloud The computing resource pool approaches infinity, but resource performance varies. If a high-performance resource is used by multiple users, the performance of the resource will be greatly reduced, so the policy of the former user will affect the policy selection of the latter user, that is, the user policies restrict each other; (3) the cloud computing scheduling center grasps the user application sequence, request content and revenue function. Therefore, the process of multi-user service resource scheduling can be regarded as the process of complete information extended game in the dynamic game, so the present invention establishes a multi-user resource scheduling model based on complete information extended game in the cloud computing resource scheduling center.

模型假设,假设1.理性假设:假设各用户是完全理性的,不会因要获得最大收益而发送毫无意义、恶意占用资源的任务请求。假设2.类型假设:假设不同用户的需求不同,提出的QoS不同。假设3.收益假设:假设所有用户的目标都是在满足自己QoS的前提下,请求资源来完成任务。资源调度中心的目标是尽可能满足所有用户提出的需求,反馈资源完成其任务。Model assumptions, assumption 1. Rational assumption: Assume that each user is completely rational and will not send meaningless task requests that occupy resources maliciously in order to obtain the maximum benefit. Assumption 2. Type assumption: It is assumed that different users have different requirements and proposed different QoS. Assumption 3. Profit assumption: Assume that the goal of all users is to request resources to complete tasks under the premise of satisfying their own QoS. The goal of the resource scheduling center is to meet the needs of all users as much as possible, and feedback resources to complete their tasks.

模型定义model definition

定义1、云环境动态博弈资源调度模型MCED-GRSM(Military Cloud EnvironmentDynamic Game Resource Scheduling Model)是一个五元组MCED-GRSM=(N,T,S,I,U),其中:Definition 1. MCED-GRSM (Military Cloud EnvironmentDynamic Game Resource Scheduling Model) is a five-tuple MCED-GRSM=(N,T,S,I,U), where:

1)N=(N1,N2,…,Nn)是博弈的参与者集合。参与者是参与博弈的独立决策、独立承担结果的个人或组织,在不同的场合中,参与者的定义是不同的。在本文中,参与者是某一时间片段所有发送任务请求的用户。1) N=(N 1 ,N 2 ,...,N n ) is the set of game participants. A participant is an individual or organization that participates in the independent decision-making of the game and bears the results independently. In different occasions, the definition of a participant is different. In this paper, participants are all users who send task requests in a certain period of time.

2)T=(T1,T2,…,Tn)是参与者的行动顺序。即在某一时间片段用户选择资源的先后顺序,在云环境中首先根据任务属性高低进行资源选择排序,即任务级别高的用户先选择可用资源来完成任务;然后任务级别相同的用户采取先申请先选择的排序原则。2) T=(T 1 ,T 2 ,...,T n ) is the action sequence of the participants. That is, the order in which users choose resources in a certain time segment, in the cloud environment, resource selection is first sorted according to the task attributes, that is, users with higher task levels first select available resources to complete the task; then users with the same task level apply first The ordering principle of first choice.

3)S=(S1,S2,…,Sn)是参与者的策略空间。Si表示参与者Ni的策略空间,每个参与者都应有1种以上的策略,即h≥1。在云环境中,各用户的策略采取选择最优资源原则。3) S=(S 1 , S 2 ,...,S n ) is the strategy space of the participants. S i represents the strategy space of participant N i , and each participant should have more than one strategy, that is, h≥1. In the cloud environment, each user's strategy adopts the principle of selecting the optimal resource.

4)I=(I1,I2,…,In)是参与者的信息集。表示参与者Ni的信息集,每个参与者都应有1种以上的策略,即k≥1。在本文中,用户选择资源时知道前一个用户的选择策略。4) I=(I 1 , I 2 ,..., In ) is the information set of the participants. Represents the information set of participants N i , each participant should have more than one strategy, that is, k≥1. In this paper, when a user selects a resource, he knows the previous user's selection strategy.

5)U=(U1,U2,…,Un)是参与者的收益函数集合。表示用户n在用户1,2,…,n-1行动之后选择策略sn的收益。收益函数表示参与者从博弈中可以得到的收益水平,由所有参与者的策略共同决定,参与者不同的策略组合所得到的收益不同。在云环境中,参与者收益函数是用户QoS的满意度。5) U=(U 1 , U 2 ,...,U n ) is the set of profit functions of the participants. Indicates the benefit of user n choosing strategy s n after user 1, 2, ..., n-1 actions. The profit function represents the profit level that the participants can obtain from the game, which is determined by the strategies of all the participants, and the profit obtained by different strategy combinations of the participants is different. In the cloud environment, the participant benefit function is the user's QoS satisfaction.

定义2、云环境资源调度博弈树是常常用于表示调度过程中实现每个收益的策略路径表现形式。它具有一般树的结构,用一个三元组表示(N,S,U)表示,如图2所示。其中N表示所有节点集合,代表资源调度中所有用户的集合;S是博弈树中有向边的集合,代表资源调度中用户的策略;U则是用户收益的集合,代表在不同策略下取得的收益。Definition 2. Cloud environment resource scheduling Game tree is often used to express the expression form of the strategy path to realize each benefit in the scheduling process. It has a general tree structure, represented by a triple (N, S, U), as shown in Figure 2. Among them, N represents the set of all nodes, representing the set of all users in resource scheduling; S is the set of directed edges in the game tree, representing the user's strategy in resource scheduling; U is the set of user benefits, representing the benefits obtained under different strategies income.

云环境下基于动态博弈的收益量化计算及均衡分析,包括,(1)收益量化计算:Income quantitative calculation and equilibrium analysis based on dynamic game in cloud environment, including (1) income quantitative calculation:

云环境资源调度中用户收益的量化计算是后续调度博弈分析的基础,且直接影响资源调度的结果。因此,对各用户的策略进行合理地收益量化是非常有必要的。在实际的资源调度过程中,资源调度中心资源趋近无限多,资源性能有优良差别;申请不同任务的用户对资源性能权重不同。而资源调度中心是尽可能满足所有用户的QoS,反馈资源执行其任务,从而获得收益。相反如果不能尽可能满足所有用户的QoS,就会降低效益,得到损失。The quantitative calculation of user benefits in cloud environment resource scheduling is the basis of subsequent scheduling game analysis and directly affects the results of resource scheduling. Therefore, it is very necessary to reasonably quantify the benefits of each user's strategy. In the actual resource scheduling process, the resources of the resource scheduling center approach to infinite, and the resource performance is different; users who apply for different tasks have different weights on resource performance. The resource scheduling center is to satisfy the QoS of all users as far as possible, and feedback resources to perform their tasks, so as to obtain benefits. On the contrary, if the QoS of all users cannot be satisfied as much as possible, the benefits will be reduced and losses will be incurred.

本文认为各用户的收益是其QoS的满意度,即:This paper considers that the benefit of each user is its QoS satisfaction, namely:

Ui(s1,…,si)=ε1Q12Q2+...+εnQn+…U i (s 1 ,…,s i )=ε 1 Q 12 Q 2 +...+ε n Q n +…

其中Q代表服务质量指标,例如响应时间、可靠性、保密性等等。ε12,…,εn代表用户对各类指标的权重,ε12,…,εn∈(0,1)。εiQi代表了用户对i类型资源服务质量的满意度。Among them, Q represents the service quality index, such as response time, reliability, confidentiality and so on. ε 1 , ε 2 ,…,ε n represent the user’s weight on various indicators, ε 12 ,…,ε n ∈(0,1). ε i Q i represents the user's satisfaction with the service quality of i type resources.

而资源调度中心的收益是所有用户的总收益,即:The revenue of the resource scheduling center is the total revenue of all users, namely:

(2)均衡分析:任何一个用户申请资源都希望获得资源调度中心的优质资源,满足自己的QoS,从而完成任务。如果资源调度中心不能满足其QoS,就会降低用户效益。所以面对所有申请资源用户的不同QoS,如何分配资源选取策略,尽可能满足所有用户的QoS是云环境资源调度的关键问题。(2) Equilibrium analysis: Any user who applies for resources hopes to obtain high-quality resources from the resource scheduling center to satisfy his own QoS, so as to complete the task. If the resource scheduling center cannot satisfy its QoS, user benefits will be reduced. Therefore, in the face of the different QoS of all users who apply for resources, how to allocate resource selection strategies to satisfy the QoS of all users as much as possible is the key issue of resource scheduling in the cloud environment.

在资源调度过程中,各用户根据提交任务的属性高低按序选择优质资源,后一个用户只能根据前一个用户行为来选择资源,以尽可能满足自己的QoS,得到最大收益U。本发明采用博弈论中的逆向归纳法(backward induction in games)求解博弈的纳什均衡解。In the process of resource scheduling, each user selects high-quality resources in order according to the attributes of the submitted tasks, and the latter user can only select resources according to the behavior of the previous user, so as to satisfy its own QoS as much as possible and obtain the maximum benefit U. The present invention adopts the backward induction method in game theory (backward induction in games) to solve the Nash equilibrium solution of the game.

定义3、逆向归纳法:从博弈终点节的直接前行节开始,然后通过博弈树逆向归纳的方法,被称为博弈中的逆向归纳法。求解是从扩展博弈树的底端开始。考虑用户n的子博弈,如果用户n-1选择策略则对于用户n来说选择策略优于选择其他任何一个策略。同样的,当用户n-1选择策略时,用户n的最优策略是各用户知道这些信息,因此用户n-1会选择策略来最大化自己的利益,这样,求解出子均衡博弈解以此类推,最终求解出均衡博弈解 Definition 3. Reverse induction method: The method of starting from the directly preceding node of the end node of the game, and then reverse induction through the game tree is called the reverse induction method in the game. The solution is to start from the bottom of the extended game tree. Consider a subgame for user n, if user n-1 chooses a strategy Then for user n the choice strategy Better than choosing any other strategy. Similarly, when user n-1 chooses strategy When , the optimal strategy for user n is Each user knows this information, so user n-1 will choose a strategy To maximize their own interests, in this way, solve the sub-equilibrium game solution By analogy, the equilibrium game solution is finally solved

定义4、在MCED-GRSM模型中,策略是一个纳什均衡,如果对于所有的i∈N,的一个最优反应,也即对于所有的si∈Si和所有的i∈N,有:Definition 4. In the MCED-GRSM model, the strategy is a Nash equilibrium if for all i∈N, yes An optimal response for , that is, for all s i ∈ S i and all i ∈ N, is:

其中,表示用户i在用户i-1行动之后选择最优策略的收益,表示用户i在用户i-1行动之后选择非最优策略si的收益。 in, Indicates that user i chooses the optimal strategy after the action of user i-1 income, Denotes the benefit of user i choosing non-optimal strategy si after user i-1 takes action.

具体来讲,云环境资源调度实例如图3所示。该实例描述了一个虚拟化云环境下资源调度问题,资源调度中心资源池趋近无限大,各用户的QoS指标有响应时间、稳定性、保密性。某一时间片段有四个用户向资源调度中心提交任务,而每个用户的QoS不同,即对不同类型资源的权重不同。资源调度中心在资源调度过程中首先根据任务属性的高低分配各用户选择资源的先后顺序,然后再对任务级别相同的用户采取先申请先选择原则分配先后顺序。而后一个用户只能根据前一个用户的行为来选择资源,以尽可能满足自己的QoS。调度模型根据已有信息生成本次博弈数据表2。Specifically, an example of resource scheduling in a cloud environment is shown in Figure 3. This example describes a resource scheduling problem in a virtualized cloud environment. The resource pool of the resource scheduling center approaches infinity, and the QoS indicators of each user include response time, stability, and confidentiality. In a certain period of time, four users submit tasks to the resource scheduling center, and the QoS of each user is different, that is, the weights for different types of resources are different. In the process of resource scheduling, the resource scheduling center first assigns the sequence of resource selection for each user according to the level of the task attribute, and then adopts the principle of first application and first selection for users with the same task level to allocate the sequence of priority. The latter user can only select resources according to the behavior of the former user, so as to satisfy his own QoS as much as possible. The scheduling model generates the game data table 2 based on the existing information.

表2云环境资源调度数据表Table 2 Cloud environment resource scheduling data table

确定完本次云环境资源调度博弈数据之后计算各用户选择不同策略的收益量化,如表3、4。After determining the data of this cloud environment resource scheduling game, calculate the quantification of the benefits of each user choosing different strategies, as shown in Tables 3 and 4.

表3云环境资源调度各用户收益(高级别任务)Table 3 Benefits of each user in cloud environment resource scheduling (high-level tasks)

表4云环境资源调度各用户收益(低级别任务)Table 4 Benefits of each user in cloud environment resource scheduling (low-level tasks)

经过收益量化计算后,将上述数据输入Gambit博弈软件进行均衡分析。由此可得到博弈树如图4、5所示。After the quantitative calculation of the income, the above data is input into the Gambit game software for equilibrium analysis. From this, the game tree can be obtained as shown in Figure 4 and Figure 5.

实验结果表示可分别从高低级别任务的博弈中找到唯一一个纳什均衡解,构成本次云环境资源调度的纳什均衡解,结果为:即四个用户均会选择第二个策略。The experimental results show that the only Nash equilibrium solution can be found from the game of high-level and low-level tasks respectively, which constitutes the Nash equilibrium solution of this cloud environment resource scheduling. The result is: That is, all four users will choose the second strategy.

对上述纳什均衡可解释为:云环境资源调度过程中,首先保障高级别任务的资源分配,然后同一级别任务的各用户根据前一个用户的策略行动,尽可能选择优质资源来执行任务,使自己的收益最大。即在纳什均衡中,各用户均会选择最优资源来执行任务。以上结果表明,本发明所提出的云环境资源调度模型及方法可以更加合理、有效地反映策略收益对用户执行任务的影响,并且可以有效地进行最优的资源调度。The above Nash equilibrium can be interpreted as: in the process of resource scheduling in the cloud environment, the resource allocation of high-level tasks is guaranteed first, and then each user of the same level of tasks acts according to the strategy of the previous user, and chooses high-quality resources to perform tasks as much as possible, so that maximum benefit. That is, in Nash equilibrium, each user will choose the optimal resource to perform the task. The above results show that the cloud environment resource scheduling model and method proposed by the present invention can more reasonably and effectively reflect the impact of policy benefits on user execution tasks, and can effectively perform optimal resource scheduling.

Claims (8)

1.一种云环境下基于动态博弈的资源调度方法,其特征在于,包括以下步骤:1. A resource scheduling method based on dynamic game under a cloud environment, characterized in that, comprising the following steps: 步骤1:构建云环境下基于动态博弈的资源调度模型;Step 1: Build a resource scheduling model based on dynamic games in the cloud environment; 步骤2:基于动态博弈的资源调度模型,根据各用户任务的属性高低分配选择资源的优先权;Step 2: Based on the resource scheduling model of dynamic game, assign the priority of selecting resources according to the attributes of each user task; 步骤3:对任务属性相同的用户采取先申请先选择分配优先权的策略,并将各用户的收益定义为其QoS的满意度;Step 3: For users with the same task attributes, adopt the strategy of applying first and choosing first to allocate priority, and define the income of each user as its QoS satisfaction; 步骤4:利用逆向归纳法求解博弈的纳什均衡解。Step 4: Solve the Nash equilibrium solution of the game by using the reverse induction method. 2.根据权利要求1所述的云环境下基于动态博弈的资源调度方法,其特征在于,所述步骤1中云环境下资源调度是指在资源虚拟化基础上,资源调度中心动态地分配各用户执行任务所需的计算资源,为执行任务提供可行性环境;云环境下资源调度过程中,物理资源被云系统虚拟化成虚拟单元,作为执行任务的载体。2. The resource scheduling method based on dynamic game under the cloud environment according to claim 1, characterized in that, the resource scheduling under the cloud environment in the step 1 refers to that on the basis of resource virtualization, the resource scheduling center dynamically allocates each The computing resources required by users to perform tasks provide a feasible environment for task execution; during the resource scheduling process in the cloud environment, physical resources are virtualized into virtual units by the cloud system as the carrier for task execution. 3.根据权利要求1所述的云环境下基于动态博弈的资源调度方法,其特征在于:所述云环境动态博弈资源调度模型是一个五元组,即MCED-GRSM=(N,T,S,I,U),其中:N=(N1,N2,…,Nn)是博弈的参与者集合,参与者是某一时间片段所有发送任务请求的用户;T=(T1,T2,…,Tn)是参与者的行动顺序,即在某一时间片段用户选择资源的先后顺序;S=(S1,S2,…,Sn)是参与者的策略空间,表示参与者Ni的策略空间,每个参与者都应有1种以上的策略,即h≥1;3. the resource scheduling method based on dynamic game under the cloud environment according to claim 1, is characterized in that: described cloud environment dynamic game resource scheduling model is a quintuple, i.e. MCED-GRSM=(N, T, S ,I,U), where: N=(N 1 ,N 2 ,…,N n ) is the set of participants in the game, and the participants are all users who send task requests in a certain time segment; T=(T 1 ,T 2 ,…,T n ) is the action sequence of the participants, that is, the order in which users choose resources in a certain time segment; S= ( S 1 ,S 2 ,…,S n ) is the strategy space of the participants, Indicates the strategy space of the participant N i , each participant should have more than one strategy, that is h≥1; I=(I1,I2,…,In)是参与者的信息集,表示参与者Ni的信息集,每个参与者都应有1种以上的策略,即k≥1;I=(I 1 ,I 2 ,…, In ) is the participant’s information set, Represents the information set of participant N i , each participant should have more than one strategy, that is, k≥1; U=(U1,U2,…,Un)是参与者的收益函数集合,s2∈S2,…,sn∈Sn,Un(s1,s2,…,sn)表示用户n在用户1,2,…,n-1行动之后选择策略sn的收益;收益函数表示参与者从博弈中可以得到的收益水平,由所有参与者的策略共同决定,参与者不同的策略组合所得到的收益不同。U=(U 1 ,U 2 ,…,U n ) is the set of profit functions of the participants, s 2 ∈S 2 ,…,s n ∈S n ,U n (s 1 ,s 2 ,…,s n ) represents the benefit of user n choosing strategy s n after user 1, 2,…, n-1 actions ; The profit function represents the profit level that the participants can obtain from the game, which is jointly determined by the strategies of all the participants, and the profit obtained by different strategy combinations of the participants is different. 4.根据权利要求1所述的云环境下基于动态博弈的资源调度方法,其特征在于,所述调度模型满足三个假设,即:理性假设:假设各用户是完全理性的,不会因要获得最大收益而发送毫无意义、恶意占用资源的任务请求;类型假设:假设不同用户的需求不同,提出的QoS不同;收益假设:假设所有用户的目标都是在满足自己QoS的前提下,请求资源来完成任务,资源调度中心的目标是尽可能满足所有用户提出的需求,反馈资源完成其任务。4. The resource scheduling method based on dynamic game in the cloud environment according to claim 1, wherein the scheduling model satisfies three assumptions, namely: rational assumption: assuming that each user is completely rational and will not Send meaningless and malicious resource-occupied task requests to obtain the maximum benefit; Type assumption: Assuming that different users have different needs, the proposed QoS is different; Revenue assumption: Assuming that all users’ goals are to meet their own QoS, request Resources are used to complete tasks, and the goal of the resource scheduling center is to meet the needs of all users as much as possible, and feedback resources to complete their tasks. 5.根据权利要求1所述的云环境下基于动态博弈的资源调度方法,其特征在于,所述步骤3中用户的收益定义为其QoS的满意度利用云环境资源调度博弈树来衡量,云环境资源调度博弈树用一个三元组表示(N,S,U)表示,其中N表示所有节点集合,代表资源调度中所有用户的集合;S是博弈树中有向边的集合,代表资源调度中用户的策略;U则是用户收益的集合,代表在不同策略下取得的收益。5. The resource scheduling method based on dynamic game in the cloud environment according to claim 1, characterized in that, in the step 3, the user's revenue is defined as its QoS satisfaction using the cloud environment resource scheduling game tree to measure, the cloud The environmental resource scheduling game tree is represented by a triple (N, S, U), where N represents the set of all nodes, representing the set of all users in resource scheduling; S is the set of directed edges in the game tree, representing resource scheduling U is the user's strategy; U is the collection of user income, representing the income obtained under different strategies. 6.根据权利要求5所述的云环境下基于动态博弈的资源调度方法,其特征在于:所述QoS的满意度用各用户的收益来衡量,即,Ui(s1,…,si)=ε1Q12Q2+...+εnQn+…,其中Q代表服务质量指标,ε12,…,εn代表用户对各类指标的权重,ε12,…,εn∈(0,1)。εiQi代表了用户对i类型资源服务质量的满意度;而资源调度中心的收益是所有用户的总收益,即: 6. The resource scheduling method based on dynamic game in cloud environment according to claim 5, characterized in that: said QoS satisfaction is measured by the income of each user, that is, U i (s 1 ,..., s i )=ε 1 Q 12 Q 2 +...+ε n Q n +..., where Q represents the service quality index, ε 12 ,...,ε n represent the user's weight on various indexes, ε 12 ,…,ε n ∈(0,1). ε i Q i represents the user's satisfaction with the service quality of i-type resources; and the revenue of the resource scheduling center is the total revenue of all users, namely: 7.根据权利要求1所述的云环境下基于动态博弈的资源调度方法,其特征在于:所述步骤4具体为:从博弈终点节的直接前行节开始,然后通过博弈树逆向归纳的方法,被称为博弈中的逆向归纳法;求解是从扩展博弈树的底端开始,考虑用户n的子博弈,如果用户n-1选择策略则对于用户n来说选择策略优于选择其他任何一个策略,同样的,当用户n-1选择策略时,用户n的最优策略是各用户知道这些信息,因此用户n-1会选择策略来最大化自己的利益,这样,求解出子均衡博弈解以此类推,最终求解出均衡博弈解 7. The resource scheduling method based on dynamic game in the cloud environment according to claim 1, characterized in that: said step 4 is specifically: starting from the node directly preceding the end node of the game, and then reverse induction through the game tree , known as the reverse induction method in the game; the solution is to start from the bottom of the extended game tree, considering the subgame of user n, if user n-1 chooses the strategy Then for user n the choice strategy Better than choosing any other strategy. Similarly, when user n-1 chooses strategy When , the optimal strategy for user n is Each user knows this information, so user n-1 will choose a strategy To maximize their own interests, in this way, solve the sub-equilibrium game solution By analogy, the equilibrium game solution is finally solved 8.根据权利要求1所述的云环境下基于动态博弈的资源调度方法,其特征在于,所述云环境动态博弈资源调度模型中,策略是一个纳什均衡,如果对于所有的i∈N,的一个最优反应,也即对于所有的si∈Si和所有的i∈N,有:其中,表示用户i在用户i-1行动之后选择最优策略的收益,表示用户i在用户i-1行动之后选择非最优策略si的收益。8. The resource scheduling method based on dynamic game in cloud environment according to claim 1, characterized in that, in the cloud environment dynamic game resource scheduling model, strategy is a Nash equilibrium if for all i∈N, yes An optimal response for , that is, for all s i ∈ S i and all i ∈ N, is: in, Indicates that user i chooses the optimal strategy after the action of user i-1 income, Denotes the benefit of user i choosing non-optimal strategy si after user i-1 takes action.
CN201710335668.5A 2017-05-12 2017-05-12 Resource regulating method based on dynamic game under cloud environment Pending CN107168797A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710335668.5A CN107168797A (en) 2017-05-12 2017-05-12 Resource regulating method based on dynamic game under cloud environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710335668.5A CN107168797A (en) 2017-05-12 2017-05-12 Resource regulating method based on dynamic game under cloud environment

Publications (1)

Publication Number Publication Date
CN107168797A true CN107168797A (en) 2017-09-15

Family

ID=59815573

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710335668.5A Pending CN107168797A (en) 2017-05-12 2017-05-12 Resource regulating method based on dynamic game under cloud environment

Country Status (1)

Country Link
CN (1) CN107168797A (en)

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109218440A (en) * 2018-10-12 2019-01-15 上海拟态数据技术有限公司 A kind of mimicry web server isomery execution body dynamic dispatching method of displaying
CN109460295A (en) * 2018-10-19 2019-03-12 中南大学 A kind of edge calculations performance optimization method based on multi-user's competitive behavior model
CN109739628A (en) * 2018-12-28 2019-05-10 北京工业大学 A cost-based task scheduling method for cloud computing
CN109901050A (en) * 2019-02-25 2019-06-18 哈尔滨师范大学 A three-dimensional system chip test resource optimization method and system
CN110266770A (en) * 2019-05-30 2019-09-20 湖南大学 Idle cloud resource scheduling method and device based on game theory
CN110365515A (en) * 2019-05-30 2019-10-22 东南大学 A Measuring Method of Service Internet Multi-tenant Satisfaction Based on Generalization Entropy
CN110505217A (en) * 2019-08-05 2019-11-26 河北科技大学 A location privacy protection method based on the fusion of game theory and blockchain
CN110599051A (en) * 2019-09-19 2019-12-20 桂林电子科技大学 Sub-game perfect Nash balanced fetching method of two agents
CN110772798A (en) * 2019-10-23 2020-02-11 桂林电子科技大学 A Method for Finding Nash Equilibrium Sequence Based on FIP Structure
CN110825517A (en) * 2019-09-29 2020-02-21 清华大学 Distributed resource dynamic allocation method based on evolutionary game theory
CN110851268A (en) * 2019-10-17 2020-02-28 中山大学 An edge scheduling optimization method based on congestion game
CN111597047A (en) * 2020-05-15 2020-08-28 北京金山云网络技术有限公司 Service deployment method, device, electronic equipment and storage medium
CN112308279A (en) * 2019-08-02 2021-02-02 南京理工大学 A multi-server fund allocation method
CN113283785A (en) * 2021-06-09 2021-08-20 广东工业大学 Cooperative scheduling optimization method for multi-task manufacturing resources
CN113298392A (en) * 2021-05-29 2021-08-24 西北工业大学 Heterogeneous weapon target allocation method based on induction method
CN113658422A (en) * 2021-07-26 2021-11-16 江苏大学 Optimal scheduling method for unmanned electric vehicle
CN115208900A (en) * 2022-07-15 2022-10-18 柏域信息科技(上海)有限公司 Multi-cloud-architecture cloud service resource scheduling method based on block chain and game model
CN115438931A (en) * 2022-08-22 2022-12-06 成都飞机工业(集团)有限责任公司 Production line assembly operation scheduling method, device, equipment and medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103095788A (en) * 2011-11-02 2013-05-08 佳都新太科技股份有限公司 Cloud resource scheduling policy based on network topology
CN103677960A (en) * 2013-12-19 2014-03-26 安徽师范大学 Game resetting method for virtual machines capable of controlling energy consumption
US9413814B2 (en) * 2010-09-29 2016-08-09 Citrix Systems, Inc. Systems and methods for providing quality of service via a flow controlled tunnel
CN106454849A (en) * 2016-10-08 2017-02-22 重庆大学 High-energy efficiency resource allocation method for cooperative cognitive radio network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9413814B2 (en) * 2010-09-29 2016-08-09 Citrix Systems, Inc. Systems and methods for providing quality of service via a flow controlled tunnel
CN103095788A (en) * 2011-11-02 2013-05-08 佳都新太科技股份有限公司 Cloud resource scheduling policy based on network topology
CN103677960A (en) * 2013-12-19 2014-03-26 安徽师范大学 Game resetting method for virtual machines capable of controlling energy consumption
CN106454849A (en) * 2016-10-08 2017-02-22 重庆大学 High-energy efficiency resource allocation method for cooperative cognitive radio network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
张健: "静态贝叶斯博弈在信息系统风险分析中的应用", 《计算机工程与应用》 *
徐昕: "基于博弈论的云计算资源调度方法研究", 《中国优秀博士学位论文全文数据库 信息科技辑,第I139-1页》 *

Cited By (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109218440A (en) * 2018-10-12 2019-01-15 上海拟态数据技术有限公司 A kind of mimicry web server isomery execution body dynamic dispatching method of displaying
CN109460295A (en) * 2018-10-19 2019-03-12 中南大学 A kind of edge calculations performance optimization method based on multi-user's competitive behavior model
CN109739628A (en) * 2018-12-28 2019-05-10 北京工业大学 A cost-based task scheduling method for cloud computing
CN109901050A (en) * 2019-02-25 2019-06-18 哈尔滨师范大学 A three-dimensional system chip test resource optimization method and system
CN110266770A (en) * 2019-05-30 2019-09-20 湖南大学 Idle cloud resource scheduling method and device based on game theory
CN110365515A (en) * 2019-05-30 2019-10-22 东南大学 A Measuring Method of Service Internet Multi-tenant Satisfaction Based on Generalization Entropy
CN110266770B (en) * 2019-05-30 2020-07-07 湖南大学 Game theory-based idle cloud resource scheduling method and device
CN110365515B (en) * 2019-05-30 2022-04-08 东南大学 Service internet multi-tenant satisfaction degree measuring method based on generalization entropy
CN112308279A (en) * 2019-08-02 2021-02-02 南京理工大学 A multi-server fund allocation method
CN110505217A (en) * 2019-08-05 2019-11-26 河北科技大学 A location privacy protection method based on the fusion of game theory and blockchain
CN110505217B (en) * 2019-08-05 2021-11-02 河北科技大学 A location privacy protection method based on the fusion of game theory and blockchain
CN110599051A (en) * 2019-09-19 2019-12-20 桂林电子科技大学 Sub-game perfect Nash balanced fetching method of two agents
CN110825517A (en) * 2019-09-29 2020-02-21 清华大学 Distributed resource dynamic allocation method based on evolutionary game theory
CN110825517B (en) * 2019-09-29 2020-09-08 清华大学 A Dynamic Allocation Method of Distributed Resources Based on Evolutionary Game Theory
CN110851268A (en) * 2019-10-17 2020-02-28 中山大学 An edge scheduling optimization method based on congestion game
CN110851268B (en) * 2019-10-17 2023-06-13 中山大学 Edge scheduling optimization method based on congestion game
CN110772798A (en) * 2019-10-23 2020-02-11 桂林电子科技大学 A Method for Finding Nash Equilibrium Sequence Based on FIP Structure
CN111597047A (en) * 2020-05-15 2020-08-28 北京金山云网络技术有限公司 Service deployment method, device, electronic equipment and storage medium
CN113298392A (en) * 2021-05-29 2021-08-24 西北工业大学 Heterogeneous weapon target allocation method based on induction method
CN113298392B (en) * 2021-05-29 2023-06-06 西北工业大学 Heterogeneous weapon target distribution method based on induction method
CN113283785A (en) * 2021-06-09 2021-08-20 广东工业大学 Cooperative scheduling optimization method for multi-task manufacturing resources
CN113658422A (en) * 2021-07-26 2021-11-16 江苏大学 Optimal scheduling method for unmanned electric vehicle
CN115208900A (en) * 2022-07-15 2022-10-18 柏域信息科技(上海)有限公司 Multi-cloud-architecture cloud service resource scheduling method based on block chain and game model
CN115208900B (en) * 2022-07-15 2024-03-15 柏域信息科技(上海)有限公司 Multi-cloud architecture cloud service resource scheduling method based on blockchain and game model
CN115438931A (en) * 2022-08-22 2022-12-06 成都飞机工业(集团)有限责任公司 Production line assembly operation scheduling method, device, equipment and medium
CN115438931B (en) * 2022-08-22 2024-03-15 成都飞机工业(集团)有限责任公司 Method, device, equipment and medium for scheduling assembly operation of production line

Similar Documents

Publication Publication Date Title
CN107168797A (en) Resource regulating method based on dynamic game under cloud environment
US11630704B2 (en) System and method for a workload management and scheduling module to manage access to a compute environment according to local and non-local user identity information
Hussain et al. RALBA: a computation-aware load balancing scheduler for cloud computing
Ge et al. GA-based task scheduler for the cloud computing systems
Patel et al. Survey on resource allocation strategies in cloud computing
Tang et al. Fair resource allocation for data-intensive computing in the cloud
Li et al. A distributed QoS-constraint task scheduling scheme in cloud computing environment: model and algorithm
Liu et al. Towards a multi-QoS human-centric cloud computing load balance resource allocation method
CN103853618A (en) Resource allocation method with minimized cloud system cost based on expiration date drive
CN106789118A (en) Cloud computing charging method based on service-level agreement
Sharma et al. An improved task allocation strategy in cloud using modified k-means clustering technique
Zhou et al. Concurrent workflow budget-and deadline-constrained scheduling in heterogeneous distributed environments
Song et al. Load balancing for future internet: an approach based on game theory
Yang et al. Multi-policy-aware MapReduce resource allocation and scheduling for smart computing cluster
Parikh et al. Double level priority based optimization algorithm for task scheduling in cloud computing
Ye et al. A hybrid instance-intensive workflow scheduling method in private cloud environment
Adrian et al. Analysis of K-means algorithm for VM allocation in cloud computing
Himthani et al. Comparative analysis of VM scheduling algorithms in cloud environment
Lee et al. Distributed resource allocation in federated clouds
Mana A feature based comparison study of big data scheduling algorithms
Deshai et al. A developed task allotments policy for apache hadoop executing in the public clouds
Jiang et al. A task allocation schema based on response time optimization in cloud computing
Komarasamy et al. ScHeduling of jobs and Adaptive Resource Provisioning (SHARP) approach in cloud computing
Hicham et al. Deadline and energy aware task scheduling in cloud computing
Ravani et al. Genetic algorithm based resource scheduling technique in cloud computing

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20170915

RJ01 Rejection of invention patent application after publication