CN110661649A - Power communication network resource allocation method - Google Patents

Power communication network resource allocation method Download PDF

Info

Publication number
CN110661649A
CN110661649A CN201910835962.1A CN201910835962A CN110661649A CN 110661649 A CN110661649 A CN 110661649A CN 201910835962 A CN201910835962 A CN 201910835962A CN 110661649 A CN110661649 A CN 110661649A
Authority
CN
China
Prior art keywords
service provider
communication network
service
power communication
resource allocation
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.)
Granted
Application number
CN201910835962.1A
Other languages
Chinese (zh)
Other versions
CN110661649B (en
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.)
Shenzhen Power Supply Bureau Co Ltd
Original Assignee
Shenzhen Power Supply Bureau Co Ltd
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 Shenzhen Power Supply Bureau Co Ltd filed Critical Shenzhen Power Supply Bureau Co Ltd
Priority to CN201910835962.1A priority Critical patent/CN110661649B/en
Publication of CN110661649A publication Critical patent/CN110661649A/en
Application granted granted Critical
Publication of CN110661649B publication Critical patent/CN110661649B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
    • H04L41/5051—Service on demand, e.g. definition and deployment of services in real time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a power communication network resource allocation method, which comprises the following steps: step S1, constructing a non-cooperative game model for power communication network resource allocation; step S2, assigning values to each parameter in the model, and initializing the service capability of each service provider; step S3, solving and obtaining the service ability of the service provider by using a Jacobian iterative formula; and step S4, performing power communication network resource allocation based on the service capability of the service provider. The invention provides the power communication network resource allocation method based on the competitive game theory under complete information, verifies that the resource allocation of the power communication network obtains Nash balance in the aspect of service capacity under the competitive environment of a self-built service provider and a third-party service provider, and reduces the capital investment of network resources when the third-party service provider is introduced, thereby improving the benefit of the service provider.

Description

Power communication network resource allocation method
Technical Field
The invention relates to the field of resource management of a power communication network, in particular to a power communication network resource allocation method.
Background
With the rapid development of smart grid services, the smart grid has an increasing demand for power communication networks. In order to meet the requirements of smart grid services, power companies generally adopt two ways of self-building a power communication network and renting a third-party communication network to solve the problem. Currently, most electric power companies adopt an internal performance system, and each electric power branch company is responsible for self-establishing an electric power communication network in each region and then providing the electric power communication network for an electric power business department to use and perform performance assessment. For convenience of description, the present invention refers to a power branch company of a Self-established power communication network as a Self-established power communication network Service Provider (SSP), and refers to a company of a Third-party communication network Service Provider as a Third-party power communication network Service Provider (TSP).
In order to meet the demand of power business, how to select a self-built power communication network and a leased third-party communication network for a power company is an urgent problem to be solved. In the prior art, the betweenness characteristic of the shortest path of the complex network topology is analyzed, and the importance of the nodes in the complex network is evaluated, so that important resources in the network are better allocated to service demands with higher importance. In the second prior art, aiming at the problem of unbalanced distribution when the power optical fiber network resources are newly built, the optical transmission network is planned by adopting an improved genetic algorithm, so that the reliable construction of the power optical network is realized with the least resource investment. In the third prior art, a self-adaptive power communication network resource allocation mechanism is realized by a dynamic planning method aiming at the QoS priority of each smart grid service, so that the satisfaction of power users and the resource income of a power communication network are improved. In the prior art, a multi-party game theory is used, the QoS requirements of all parties of power resource demands are met, a resource allocation mechanism with maximized resource utility is constructed, Nash balance can be obtained by the allocation mechanism, and the problem of QoS-constrained power communication network resource allocation is well solved. In the prior art, a network resource allocation problem is modeled into an auction problem in the economic field, a resource allocation model formed by a resource demand party, a resource provider and a resource allocation center is constructed, a distributed network resource auction mechanism is constructed based on a VCG mechanism, and the utilization rate of network resources and social benefits of auction parties are improved well.
As can be seen from the analysis of the results of the prior art, most of the related studies only consider the competition between SSPs or TSPs, but the related studies involve less competition between SSPs and TSPs. Therefore, it is important to establish a competitive game model to study the competitive relationship between the SSPs and the TSPs.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method for allocating power communication network resources, so as to reduce the capital investment of network resources and improve the income of network service providers.
In order to solve the above technical problem, the present invention provides a power communication network resource allocation method, including:
step S1, constructing a non-cooperative game model of power communication network resource allocation, wherein participants of the model comprise a power communication network demand party, a self-built power communication network service provider and a third-party power communication network service provider, and the power communication network demand party provides resource requests to the self-built power communication network service provider and the third-party power communication network service provider;
step S2, assigning values to each parameter in the model, and initializing the service capability of each service provider;
step S3, solving and obtaining the service ability of the service provider by using a Jacobian iterative formula;
and step S4, performing power communication network resource allocation based on the service capability of the service provider.
Preferably, the step S1 specifically includes:
step S11, calculating the operation cost of each service provider in the kth competition according to the receiving rate and the service capacity of the electric power communication network of each service provider;
step S12, calculating the utility of each service provider in the kth competition according to the operation cost of each service provider and the service price of the power communication network;
step S13, calculating the income of each service provider in the kth competition according to the utility and market share of each service provider;
and step S14, constructing an objective function for solving the service provider profit maximization problem under the Nash equilibrium problem by taking the profit maximization as a competitive game objective.
Preferably, the service providers are the ith self-built electric power communication network service provider SSPi and the jth third-party electric power communication network service provider TSPj, and the service capability of the service provider SSPi is
Figure BDA0002192166240000021
The service capability of the service provider TSPj is
Figure BDA0002192166240000022
And
Figure BDA0002192166240000023
subject to the constraint of
Figure BDA0002192166240000024
Preferably, the calculation method of the operation cost of each service provider in the kth round of competition is as follows:
Figure BDA0002192166240000025
wherein the content of the first and second substances,
Figure BDA0002192166240000026
for the operating cost of the service provider SSPi in the kth round of competition,the operation cost of the service provider TSPj in the k-th round of competition, q is the receiving rate of the power communication network of the service provider,
Figure BDA0002192166240000028
respectively representing the service capability coefficients of the respective service providers,respectively, represent the network cost factor, respectively,
preferably, the utility of each facilitator in the kth round of competition is calculated in the following manner:
Figure BDA0002192166240000033
wherein the content of the first and second substances,
Figure BDA0002192166240000034
for the utility of the service provider SSPi in the kth round of competition,
Figure BDA0002192166240000035
for the utility of the facilitator TSPj in the k-th competition, PsPrice, P, for the electric power network service of the SSPi in the k-th competitiontAnd (5) serving the price of the power communication network of the service provider TSPj in the k-th round of competition.
Preferably, the calculation method of the profit of each facilitator in the kth round of competition is as follows:
the constraint condition is
Figure BDA0002192166240000037
Wherein the content of the first and second substances,
Figure BDA0002192166240000038
for the benefit of the service provider SSPi in the kth round of competition,for the revenue of the facilitator TSPj in the k-th competition,
Figure BDA00021921662400000310
being the market share of the service provider SSPi,
Figure BDA00021921662400000311
lambda is the sum of the market size of the demand of the power communication network, which is the market share of the service provider TSPj.
Preferably, the objective function is:
Figure BDA00021921662400000312
the total number of the service providers is r, and when the total number of the self-built power communication network service providers is m, the total number of the third-party power communication network service providers is r-m.
Preferably, in the step S2, the service capability of each service provider is initialized
Figure BDA00021921662400000313
Figure BDA00021921662400000314
Wherein i belongs to {1, 2.. eta., m }, and j belongs to {1, 2.. eta., r-m }.
Preferably, in step S3, the calculation method of the optimal service capability of each service provider is as follows:
Figure BDA00021921662400000315
(us,i)*for optimal service capability of the facilitator SSPi, (u)t,j)*The optimal service capability of the service provider TSPj;
using jacobian transformation to service capabilitiesThe reaction function of (a) is transformed to obtain a jacobian iterative formula:
calculating the service capability of the service provider by using the Jacobi iterative formula if the service capability calculated in the k round
Figure BDA0002192166240000042
Satisfy the convergence condition
Figure BDA0002192166240000043
Figure BDA0002192166240000044
Then it is at this time
Figure BDA0002192166240000045
Is the best service capability of the facilitator, i.e.
Figure BDA0002192166240000046
Otherwise, performing the (k + 1) th iteration.
Preferably, the step S4 is specifically to calculate the market share of each service provider to realize resource allocation based on the service capability of the service provider, where the market share of each service provider is calculated as follows:
Figure BDA0002192166240000047
wherein, aiBeing the service factor of the service provider SSPi,
Figure BDA0002192166240000048
serving coefficient for service provider TSPj, bijAs an alternative factor to the service provider SSPi,
Figure BDA0002192166240000049
for service provider TSPjCoefficients may be substituted.
The embodiment of the invention has the advantages that through constructing and solving the model of the power communication network resource allocation, the power communication network resource allocation obtains Nash balance in service capacity under three competitive environments, and when a third-party service provider is introduced, the requirement of a user can be met through lower service capacity, so that the capital investment of network resources is reduced and the benefit of the network service provider is improved on the premise of obtaining the same benefit.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart illustrating a method for allocating resources of an electrical power communication network according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a power communication network resource allocation model according to an embodiment of the present invention.
FIG. 3 is a schematic diagram illustrating a comparison of service capabilities in a competitive environment among SSPs according to an embodiment of the present invention.
FIG. 4 is a diagram illustrating a comparison of service capabilities in a contention environment among TSPs according to an embodiment of the present invention.
FIG. 5 is a schematic diagram illustrating a comparison of service capabilities in a competitive environment between SSPs and TSPs according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments refers to the accompanying drawings, which are included to illustrate specific embodiments in which the invention may be practiced.
Referring to fig. 1, an embodiment of the invention provides a method for allocating power communication network resources, including:
step S1, constructing a non-cooperative game model for power communication network resource allocation, wherein participants of the model comprise a power communication network demand party, a self-built power communication network service provider and a third-party power communication network service provider;
step S2, assigning values to each parameter in the model, and initializing the service capability of each service provider;
step S3, solving and obtaining the service ability of the service provider by using a Jacobian iterative formula;
and step S4, performing power communication network resource allocation based on the service capability of the service provider.
In step S1, the power communication network resource allocation model includes three participating entities, i.e., SSPs, TSPs, and DSs, as shown in fig. 2. The SSPs and the TSPs are responsible for providing power communication network resources, DSs (Demand side of power communication network, DS) is a power communication network Demand side, and DSs makes a resource request of the power communication network to the SSPs and the TSPs. To implement the power communication network resource allocation, DSs may make a resource request to multiple SSPs, TSPs. SSPs and TSPs feed back service quality and price to DSs which provides resource requests according to DSs provided resource requests and own resource conditions. DSs selecting one or more SSPs and TSPs to provide power communication network service according to the service quality and price, and paying reward for supporting normal operation of SSPs and TSPs companies. Considering that the SSPs and the TSPs compete for the benefit of the respective companies, the invention models the resource allocation problem of the power communication network into a non-cooperative game model to analyze the competition problem between the SSPs and the TSPs.
The total amount of power communication network demand of the power communication network demand side DSs is expressed by M. Lambda is used for demand quantity of power communication network of mth power communication network demand side DSmmIndicate, therefore, use
Figure BDA0002192166240000051
Representing the sum of market sizes of the demand of the power communication network.
The connectivity of the service provider's power communication network refers to the probability that a power service request is successfully received by the service provider, and is denoted by q. Information quantity transmitted by ith self-built power communication network service provider SSPi in kth round of competition in unit time is usedRepresents a service capability called SSPi; information quantity usage transmitted by jth third party electric power communication network service provider TSPj in unit time
Figure BDA0002192166240000062
Indicating the service capabilities, referred to as TSPj,
Figure BDA0002192166240000063
andsubject to the constraint of
Figure BDA0002192166240000065
Since the service capacity is directly related to the resource investment of a service provider for building a power communication network and is a key factor influencing the service quality and the service price, the invention usess,i)*，(ut,j)*Indicating the optimal service capabilities of SSPi, TSPj.
The step S1 specifically includes:
step S11, calculating the operation cost of each service provider in the kth competition according to the receiving rate and the service capacity of the electric power communication network of each service provider;
specifically, based on the receiving rate q and the service capability of the electric power communication network of a service provider
Figure BDA0002192166240000066
Solving the operation cost of SSPi and TSPj in the kth round of competition by using the formula (1)
Figure BDA0002192166240000067
Wherein the content of the first and second substances,
Figure BDA0002192166240000069
the service capability coefficient is represented by a coefficient,
Figure BDA00021921662400000610
representing the network cost factor. Since when the electric power communication network user leases the resource of TSPj, TSPj also needs to lease the interface resource of SSPi to provide service for the electric power communication service, therefore,
Figure BDA00021921662400000611
step S12, calculating the utility of each service provider in the kth competition according to the operation cost of each service provider and the service price of the power communication network;
specifically, based on the above analysis, the utility of SSPi, TSPj in the kth round of competition is calculated using equation (2):
wherein the content of the first and second substances,
Figure BDA00021921662400000613
respectively, the effects of SSPi, TSPj, Ps、PtRespectively, the service prices of the power communication networks provided by the SSPi and the TSPj.
Every service provider in the electric power communication network market tries to reduce the price or improve the service quality to attract more electric power communication network users, and the maximization of the utility and the profit is pursued, therefore, the invention adopts a non-cooperative game model under complete information to analyze the resource allocation problem between the SSPi and the TSPj. Assuming that there are a total of r service providers, when the total number of SSPs is m, the total number of TSPs is r-m.
According to the economic theory, the better the service quality is, the larger the market share is, under the condition of a certain price. The market share of SSPi, TSPj in the kth round of competition is calculated using equation (3):
Figure BDA0002192166240000071
wherein the content of the first and second substances,denotes the market share, a, of SSPi, TSPj, respectivelyi、
Figure BDA0002192166240000073
Representing service coefficients of SSPi, TSPj, respectively, bij、
Figure BDA0002192166240000074
Representing alternative coefficients for SSPi, TSPj, respectively.
Step S13, calculating the income of each service provider in the kth competition according to the utility and market share of each service provider;
in particular, revenue usage by the facilitators SSPi, TSPj in the kth round of competition
Figure BDA0002192166240000075
Expressed by using the formula (4) and the constraint condition is
Figure BDA0002192166240000077
Step S14, constructing an objective function for solving the service provider profit maximization problem under the Nash equilibrium problem by taking the profit maximization as a competitive game objective;
specifically, in order to realize the competitive game goal of maximizing the benefits of the SSPi and the TSPj, under the Nash (Nash) balance problem, the objective function (i.e. the service capability) of the service provider benefit maximization problem needs to be solvedAnd earnings
Figure BDA0002192166240000079
Reaction function of) is as shown in equation (5):
Figure BDA00021921662400000710
step S2 performs network environment initialization and service capability initialization.
Firstly assigning values to each parameter in the resource allocation model, and secondly initializing the service capability, namely assigning an initial value to the service capability of each service provider
Figure BDA00021921662400000711
Wherein i belongs to {1, 2.. eta., m }, and j belongs to {1, 2.. eta., r-m }.
Step S3 first solves for service capability using the jacobian iterative formula:
slave service capability
Figure BDA00021921662400000712
And earnings
Figure BDA00021921662400000713
The reaction function (i.e. formula (5)) of (A) shows the optimal service capability of the service provider
Figure BDA00021921662400000714
Can be calculated using equation (6):
Figure BDA00021921662400000715
using jacobian transformation to service capabilities
Figure BDA00021921662400000716
The reaction function of (2) is transformed to obtain a jacobian iterative formula (7):
Figure BDA0002192166240000081
the service capability of the service provider is calculated by using a Jacobi iterative formula (7), the service capability is continuously updated, and the service capabilities of the SSPi and the TSPj calculated in the kth round are respectively
Then, the iteration is executed until the service capability meets the convergence condition, and if the convergence condition is met during the judgment
Figure BDA0002192166240000083
The iterative computation of the optimal service capability ends when
Figure BDA0002192166240000084
Is the optimal service capability, i.e.
Figure BDA0002192166240000085
Otherwise, performing the (k + 1) th iteration.
Step S4 is specifically to calculate market share of each service provider by using formula (3) based on service capability of the converged service provider, thereby implementing resource allocation.
In order to verify the performance of the resource allocation method provided by the present invention, the present embodiment adopts MATLAB to perform experiments (data in the experiments are all results of normalization processing), and verifies resource allocation under three environments, namely, competition between SSPs, competition between TSPs, and competition between SSPs and TSPs. The parameters used in the experiment were as follows: ps＝1，Pt＝0.8，
Figure BDA0002192166240000087
q＝0.8，
Figure BDA0002192166240000088
Figure BDA0002192166240000089
Competition among SSPs was simulated by SSP1 and SSP2, and SSP1 and SSP2 parameters were set to a1＝2.5，a2The experimental results are shown in fig. 3, 2.9. The competition among TSPs is simulated by using TSP1 and TSP2, and the parameters of TSP1 and TSP2 are set as
Figure BDA00021921662400000810
The results of the experiment are shown in FIG. 4. Competition between SSPs and TSPs is simulated by SSP1 and TSP1, and SSP1 and TSP1 parameters are set as a1＝2.5，b11＝0.5，
Figure BDA00021921662400000812
The results of the experiment are shown in FIG. 5.
The experimental results are analyzed from the two aspects of Nash equilibrium condition and service capacity under three competitive environments as follows: (1) in the nash equilibrium under three competitive environments, from fig. 3 to fig. 5, the curve fluctuates before the server obtains the unique nash equilibrium, which indicates that there is a fierce competitive game between the servers before reaching a steady state, but as the iteration number increases, the service capability of the server gradually approaches a steady value, i.e. the uniqueness of the nash equilibrium is proved. (2) In the aspect of comparison of the service capacity in three competition environments, when only a self-established service provider exists in fig. 3, the service capacity is low; in fig. 4, the service capability is higher when only the third-party service provider is present, which indicates that the third-party service provider can provide better service quality than the self-established service provider. When the self-building service provider and the third-party service provider participate in competition at the same time, the service capacity is reduced, and the requirement of the user can be met through lower service capacity when the third party is introduced, so that the capital investment of network resources is reduced on the premise of obtaining the same income, and the income of the network service provider is improved.
The above disclosure is only for the purpose of illustrating the preferred embodiments of the present invention, and it is therefore to be understood that the invention is not limited by the scope of the appended claims.

Claims (10)

1. A power communication network resource allocation method is characterized by comprising the following steps:
step S1, constructing a non-cooperative game model of power communication network resource allocation, wherein participants of the model comprise a power communication network demand party, a self-built power communication network service provider and a third-party power communication network service provider, and the power communication network demand party provides resource requests to the self-built power communication network service provider and the third-party power communication network service provider;
step S2, assigning values to each parameter in the model, and initializing the service capability of each service provider;
step S3, solving and obtaining the service ability of the service provider by using a Jacobian iterative formula;
and step S4, performing power communication network resource allocation based on the service capability of the service provider.
2. The power communication network resource allocation method according to claim 1, wherein the step S1 specifically includes:
step S11, calculating the operation cost of each service provider in the kth competition according to the receiving rate and the service capacity of the electric power communication network of each service provider;
step S12, calculating the utility of each service provider in the kth competition according to the operation cost of each service provider and the service price of the power communication network;
step S13, calculating the income of each service provider in the kth competition according to the utility and market share of each service provider;
and step S14, constructing an objective function for solving the service provider profit maximization problem under the Nash equilibrium problem by taking the profit maximization as a competitive game objective.
3. The method according to claim 2, wherein the service providers are an ith self-established electric power communication network service provider SSPi and a jth third party electric power communication network service provider TSPj, and the service capabilities of the service providers SSPi are
Figure FDA0002192166230000011
The service capability of the service provider TSPj is
Figure FDA0002192166230000012
And
Figure FDA0002192166230000013
subject to the constraint of
4. The power communication network resource allocation method according to claim 3, wherein the calculation manner of the operation cost of each service provider in the kth round of competition is as follows:
Figure FDA0002192166230000015
wherein the content of the first and second substances,
Figure FDA0002192166230000016
for the operating cost of the service provider SSPi in the kth round of competition,
Figure FDA0002192166230000017
the operation cost of the service provider TSPj in the k-th round of competition, q is the receiving rate of the power communication network of the service provider,
Figure FDA0002192166230000021
respectively representing the service capability coefficients of the respective service providers,
Figure FDA0002192166230000022
respectively, represent the network cost factor, respectively,
Figure FDA0002192166230000023
5. the power communication network resource allocation method according to claim 4, wherein the utility of each service provider in the kth round of competition is calculated in a manner that:
Figure FDA0002192166230000024
wherein the content of the first and second substances,
Figure FDA0002192166230000025
for the utility of the service provider SSPi in the kth round of competition,
Figure FDA0002192166230000026
for the utility of the facilitator TSPj in the k-th competition, PsPrice, P, for the electric power network service of the SSPi in the k-th competitiontAnd (5) serving the price of the power communication network of the service provider TSPj in the k-th round of competition.
6. The power communication network resource allocation method according to claim 5, wherein the profit of each service provider in the kth round of competition is calculated by:
Figure FDA0002192166230000027
the constraint condition is
Wherein the content of the first and second substances,for the benefit of the service provider SSPi in the kth round of competition,
Figure FDA00021921662300000210
for the revenue of the facilitator TSPj in the k-th competition,
Figure FDA00021921662300000211
being the market share of the service provider SSPi,
Figure FDA00021921662300000212
lambda is the sum of the market size of the demand of the power communication network, which is the market share of the service provider TSPj.
7. The power communication network resource allocation method according to claim 6, wherein the objective function is:
Figure FDA00021921662300000213
the total number of the service providers is r, and when the total number of the self-built power communication network service providers is m, the total number of the third-party power communication network service providers is r-m.
8. The power communication network resource allocation method according to claim 7, wherein in step S2, an initial value is assigned to the service capability of each service provider
Figure FDA00021921662300000215
Wherein i belongs to {1, 2.. eta., m }, and j belongs to {1, 2.. eta., r-m }.
9. The power communication network resource allocation method according to claim 7, wherein in step S3, the calculation method of the optimal service capacity of each service provider is as follows:
Figure FDA00021921662300000217
(us,i)*for optimal service capability of the facilitator SSPi, (u)t,j)*The optimal service capability of the service provider TSPj;
using jacobian transformation to service capabilities
Figure FDA0002192166230000031
The reaction function of (a) is transformed to obtain a jacobian iterative formula:
calculating the service capability of the service provider by using the Jacobi iterative formula if the service capability calculated in the k round
Figure FDA0002192166230000033
Satisfy the convergence condition
Figure FDA0002192166230000035
Then it is at this time
Figure FDA0002192166230000036
Is the best service capability of the facilitator, i.e.
Figure FDA0002192166230000037
Otherwise, performing the (k + 1) th iteration.
10. The power communication network resource allocation method according to claim 6 or 9, wherein the step S4 is specifically to calculate the market share of each service provider based on the service capability of the service provider to realize resource allocation, and the market share of each service provider is calculated as follows:
Figure FDA0002192166230000038
wherein, aiBeing the service factor of the service provider SSPi,serving coefficient for service provider TSPj, bijAs an alternative factor to the service provider SSPi,
Figure FDA00021921662300000310
are alternative coefficients for the facilitator TSPj.
CN201910835962.1A 2019-09-05 2019-09-05 Power communication network resource allocation method Active CN110661649B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910835962.1A CN110661649B (en) 2019-09-05 2019-09-05 Power communication network resource allocation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910835962.1A CN110661649B (en) 2019-09-05 2019-09-05 Power communication network resource allocation method

Publications (2)

Publication Number Publication Date
CN110661649A true CN110661649A (en) 2020-01-07
CN110661649B CN110661649B (en) 2022-07-26

Family

ID=69037966

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910835962.1A Active CN110661649B (en) 2019-09-05 2019-09-05 Power communication network resource allocation method

Country Status (1)

Country Link
CN (1) CN110661649B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112054924A (en) * 2020-08-27 2020-12-08 深圳供电局有限公司 Resource allocation method of integrated power grid

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729164A (en) * 2008-10-27 2010-06-09 华为技术有限公司 Wireless resource allocation method and cognitive radio user equipment
CN102185708A (en) * 2011-04-18 2011-09-14 武汉理工大学 Grid resource distribution method based on Nash equilibrium
CN102710746A (en) * 2012-04-30 2012-10-03 电子科技大学 Sequential-game-based virtual machine bidding distribution method
CN103298076A (en) * 2013-06-21 2013-09-11 西安邮电大学 Method for selecting access network in heterogeneous network
CN103634848A (en) * 2013-12-02 2014-03-12 哈尔滨工业大学 Non-cooperation game resource allocating-based 3G (the third generation telecommunication) / WLAN (wireless local area network) heterogeneous network accessing control method
CN107483365A (en) * 2017-09-08 2017-12-15 国网安徽省电力公司安庆供电公司 A kind of power telecom network maximization of utility resource allocation methods of QoS drivings
US20180083482A1 (en) * 2016-09-19 2018-03-22 Nestfield Co., Ltd. Supply-demand balancing method and system for power management in smart grid
CN108092804A (en) * 2017-12-08 2018-05-29 国网安徽省电力有限公司信息通信分公司 Power telecom network maximization of utility resource allocation policy generation method based on Q-learning

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729164A (en) * 2008-10-27 2010-06-09 华为技术有限公司 Wireless resource allocation method and cognitive radio user equipment
CN102185708A (en) * 2011-04-18 2011-09-14 武汉理工大学 Grid resource distribution method based on Nash equilibrium
CN102710746A (en) * 2012-04-30 2012-10-03 电子科技大学 Sequential-game-based virtual machine bidding distribution method
CN103298076A (en) * 2013-06-21 2013-09-11 西安邮电大学 Method for selecting access network in heterogeneous network
CN103634848A (en) * 2013-12-02 2014-03-12 哈尔滨工业大学 Non-cooperation game resource allocating-based 3G (the third generation telecommunication) / WLAN (wireless local area network) heterogeneous network accessing control method
US20180083482A1 (en) * 2016-09-19 2018-03-22 Nestfield Co., Ltd. Supply-demand balancing method and system for power management in smart grid
CN107483365A (en) * 2017-09-08 2017-12-15 国网安徽省电力公司安庆供电公司 A kind of power telecom network maximization of utility resource allocation methods of QoS drivings
CN108092804A (en) * 2017-12-08 2018-05-29 国网安徽省电力有限公司信息通信分公司 Power telecom network maximization of utility resource allocation policy generation method based on Q-learning

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112054924A (en) * 2020-08-27 2020-12-08 深圳供电局有限公司 Resource allocation method of integrated power grid
CN112054924B (en) * 2020-08-27 2024-04-26 深圳供电局有限公司 Resource allocation method of integrated power grid

Also Published As

Publication number Publication date
CN110661649B (en) 2022-07-26

Similar Documents

Publication Publication Date Title
CN111757354B (en) Multi-user slicing resource allocation method based on competitive game
CN111182570A (en) User association and edge computing unloading method for improving utility of operator
Maillé et al. Pricing the internet with multibid auctions
Maheswaran et al. Efficient signal proportional allocation (ESPA) mechanisms: Decentralized social welfare maximization for divisible resources
CN106817401B (en) Resource allocation method in cloud environment
CN109831796B (en) Resource allocation method in wireless network virtualization
CN111614754B (en) Fog-calculation-oriented cost-efficiency optimized dynamic self-adaptive task scheduling method
CN108092804A (en) Power telecom network maximization of utility resource allocation policy generation method based on Q-learning
CN110661649B (en) Power communication network resource allocation method
CN108990067A (en) A kind of energy efficiency controlling method applied to super-intensive heterogeneous network
Liang et al. A combinatorial auction resource trading mechanism for cybertwin-based 6g network
Zhang et al. Service pricing and selection for IoT applications offloading in the multi-mobile edge computing systems
CN111611076A (en) Fair distribution method for mobile edge computing shared resources under task deployment constraint
CN113615137A (en) CDN optimization platform
Zhang et al. A two stage stochastic equilibrium model for electricity markets with two way contracts
Gupta et al. The Internet: A future tragedy of the commons?
CN108664318A (en) Computation migration method and server-side, boundary server-side for computation migration
Radonjić et al. Responsive pricing modeled with Stackelberg game for next-generation networks
CN113193999A (en) Virtual network mapping method based on depth certainty strategy gradient
CN112688848A (en) Heterogeneous virtual network mapping method and system
Jia et al. Analysis of a class of decentralized dynamical systems: rapid convergence and efficiency of dynamical quantized auctions
CN111148252A (en) LTE electric wireless private network resource allocation method based on auction
CN110996396B (en) Mobile edge network resource allocation method based on online combined auction
Sterz et al. Multi-stakeholder service placement via iterative bargaining with incomplete information
Xu et al. A channel portfolio optimization framework for trading in a spectrum secondary market

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
GR01 Patent grant
GR01 Patent grant