CN107483365A - A kind of power telecom network maximization of utility resource allocation methods of QoS drivings - Google Patents

A kind of power telecom network maximization of utility resource allocation methods of QoS drivings Download PDF

Info

Publication number
CN107483365A
CN107483365A CN201710806493.1A CN201710806493A CN107483365A CN 107483365 A CN107483365 A CN 107483365A CN 201710806493 A CN201710806493 A CN 201710806493A CN 107483365 A CN107483365 A CN 107483365A
Authority
CN
China
Prior art keywords
mrow
inp
msub
msubsup
resource
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
CN201710806493.1A
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.)
State Grid Corp of China SGCC
Anqing Power Supply Co of State Grid Anhui Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
Anqing Power Supply Co of State Grid Anhui Electric Power 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 State Grid Corp of China SGCC, Anqing Power Supply Co of State Grid Anhui Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN201710806493.1A priority Critical patent/CN107483365A/en
Publication of CN107483365A publication Critical patent/CN107483365A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware

Landscapes

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

Abstract

The invention discloses a kind of power telecom network maximization of utility resource allocation methods of QoS drivings, comprise the following steps：For power telecom network resource allocation problem, the two benches resource allocator model based on tripartite Game is built；Underlying network service business (InP) reports resource provision information to resource allocation center；Service provider (SP) proposes resource requirement information to resource allocation center；Resource allocation center is that SP distributes resource；Resource allocation Spot detection InP service quality, when resource allocation Spot detection bottom InP cannot ensure that SP business is run by qos requirement thereon, resource allocation center can be punished InP；Resource allocation center calculation InP value of utility, completes this transaction；Each participant waits for next round resource contention.This method meets that dominant strategy encourages compatibility feature, it is possible to achieve the target of system profit maximization.

Description

A kind of power telecom network maximization of utility resource allocation methods of QoS drivings
Technical field
The present invention relates to power telecom network resource allocation techniques field, more particularly to a kind of QoS (Quality of Service) the power telecom network maximization of utility resource allocation methods of driving.
Background technology
As the fast development that intelligent grid is studied and applied, effect of the power telecom network in power industry are increasingly heavier Will.Currently, power telecom network is mainly made up of bottom physical network, upper-layer service logical network.Wherein, bottom physical network master To be made up of fiber optic communication network, and be aided with the transmission means such as microwave, satellite.Upper-layer service logical network is mainly by router, friendship The digital communications network such as change planes is formed, and completes power scheduling and the real-time control of business.The industry of power communication logical network carrying Business mainly includes the electric power such as distribution network protection, power distribution network video monitoring, distribution condition monitoring, power information collection automation and led to Communication service, all kinds of business require different to network delay, bandwidth, network reliability etc..
The stable operation of upper-layer service logical network, the stable operation for power business play very crucial effect. But the optical fiber covering of the own bottom physical network of current power system is horizontal relatively low, fiber number anxiety, resource also be present The problem of bottom physical network of the situation of deficiency, also more regions realizes power communication using rental third party's optical fiber.For Solve these problems, it is existing partly to research and propose some solution methods.But these QoS assurances are only applicable to traditional net Network.
Network virtualization technology is the key technology of current network transition, has greater advantage in QoS indemnifying parties face.Network Under virtualized environment, power telecom network includes infrastructure provider (Infrastructure Providers, InPs) kimonos Be engaged in provider (Service Providers, SPs).Wherein InPs is created and fundamentals of management network, includes calculate node, link The physical resources such as resource.And SPs provides diversity service according to the demand of energy communication service for business.Meanwhile study Mainly solve the problems, such as to improve bottom layer node or link circuit resource utilization rate, lack to multiple service providers and multiple infrastructure The QoS key elements such as the bandwidth capacity of powerline network, resources costs, resource price considers under provider's environment, it is impossible to Solves power telecom network problems faced in the resource allocation that QoS drives well.
The content of the invention
In order to effectively ensure the isolation of business in intelligent grid, meet the diversity of intelligent grid business and to QoS Different demands, the invention provides a kind of QoS driving power telecom network maximization of utility resource allocation methods.
Therefore, the invention provides a kind of power telecom network maximization of utility resource allocation methods of QoS drivings, including with Lower step：101) resource allocation center is introduced, the resource allocation problem of power telecom network is converted into by bottom-layer network provider (InP), service provider (SP), the gambling process of resource allocation center tripartite composition, wherein, the InP provides as resource Person, for providing computing resource and link circuit resource to SP, the SP is as resource requestor, for providing a user service, institute Resource allocation center is stated as resource auctioneer；102) InP reports resource provision information to resource allocation center；103) SP is to money Source distributing center proposes resource requirement information；104) resource allocation center is that the SP distributes resource；105) resource allocation center InP service quality is detected, when resource allocation Spot detection to InP cannot ensure that SP business is run by qos requirement thereon, money Source distributing center is punished InP；106) resource allocation center calculation InP value of utility, this transaction is completed；And 107) Each participant waits for next round resource contention.
In the resource allocation methods of the present invention, based on network virtualization technology, to the power telecom network resource of QoS drivings The description that assignment problem is formalized, it is proposed that the two benches resource allocator model based on tripartite Game (protecting by the model There is advantage in terms of barrier QoS of survice and raising resource utilization), this distribution method meets that dominant strategy encourages compatibility feature, can To realize the target of system profit maximization.
Wherein, two benches refer to：First stage：InP reports resource provision information, SP to divide to resource to resource allocation center Resource requirement information is proposed with center, resource allocation center is that the SP distributes resource；Second stage：Resource allocation Spot detection InP service quality, when resource allocation Spot detection to InP cannot ensure that SP business is run by qos requirement thereon, resource point InP is punished with center.
In addition to objects, features and advantages described above, the present invention also has other objects, features and advantages. Below with reference to figure, the present invention is further detailed explanation.
Brief description of the drawings
The Figure of description for forming the part of the application is used for providing a further understanding of the present invention, and of the invention shows Meaning property embodiment and its illustrate be used for explain the present invention, do not form inappropriate limitation of the present invention.In the accompanying drawings：
Fig. 1 is the schematic flow sheet of the resource allocation methods of the power telecom network maximization of utility of the QoS drivings of the present invention； And
Fig. 2 is the two benches resource allocator model schematic diagram based on tripartite Game of the present invention.
Embodiment
It should be noted that in the case where not conflicting, the feature in embodiment and embodiment in the application can phase Mutually combination.Describe the present invention in detail below with reference to the accompanying drawings and in conjunction with the embodiments.
In the solution of the present invention, in order to effectively ensure the isolation of business in intelligent grid, meet intelligent grid industry The diversity of business and the different demands to QoS, based on network virtualization technology, to the power telecom network resource allocation of QoS drivings The description that problem is formalized, it is proposed that the two benches resource allocator model based on tripartite Game, the model are ensureing industry There is advantage in terms of business QoS and raising resource utilization, this distribution method meets that dominant strategy encourages compatibility feature, it is possible to achieve The target of system profit maximization.
As shown in figure 1, the power telecom network maximization of utility resource allocation methods driven according to the QoS of the present invention, including Following steps：
S101 power telecom network resource allocation problem) is directed to, builds the two benches resource allocator model based on tripartite Game；
Under network virtualization environment, power telecom network includes infrastructure provider (Infrastructure Providers, InPs) and service provider (Service Providers, SPs).Wherein InP is created and fundamentals of management network, Include the physical resources such as calculate node, link circuit resource.And SP provides otherness clothes according to the demand of energy communication service for business Business.
Because auction system is workable, resource can be made to be fairly distributed in a short time, obtained in system scope most Excellent solution or more excellent solution.Auction system has been successfully applied Internet resources distribution.
Two benches resource allocator model proposed by the present invention based on tripartite Game is as shown in Fig. 2 the model passes through introducing It is a kind of that " resource allocation " center " entity, the resource allocation problem of power telecom network is converted into by resource provider, resource request Person, the gambling process of resource allocation center tripartite composition.Wherein, InP is as resource provider, and SP is as resource requestor, money Source distribute module is as auctioneer.
S102) InP reports resource provision information to resource allocation center；
If InP collection is combined into IInP={ InP1,InP2,...,InPi, InPiComputing resource and link circuit resource are provided for SP.If InPiThe fixation average unit cost of computing resource beThe unit cost of computing resource isThe maximum capacity of computing resource ForInPiThe fixation average unit cost of link circuit resource beThe unit cost of link circuit resource isLink circuit resource is most Large Copacity isWork as InPiThe computing resource quantity delivered of in the market beLink circuit resource quantity delivered isWhen, InPiDisappear The cost of consumptionFor：
S103) SP proposes resource requirement information to resource allocation center；
If SP collection is combined into ISP={ SP1,SP2,...,SPj, SPjService is provided the user, it is necessary to using InPiThe meter of offer Calculate resource and link circuit resource.If SPjComputational resource requirements amount beLink resource needs amount is
S104) resource allocation center is that SP distributes resource；
The optimal resource allocation problem of QoS drivings is exactly InPiEnsuring to meet SPjQos requirement on the premise of, make InPiThe totle drilling cost of consumption is minimum.
Wherein, X={ x1,x2,...,xnRepresent resource allocation when, n InP resource provision amount information.InP resource provision amount in the case of expression optimal resource allocation.Formula (1) represents InPiTotal calculating money Source and bandwidth resources quantity delivered are equal to SPjTotal computing resource and bandwidth resources demand.Formula (2) represents InPiComputing resource Quantity delivered with bandwidth resources is all no more than the maximum capacity of computing resource and bandwidth resources.Formula (3) illustrates InPiQuantity delivered During more than 0, fixed cost can be just produced.
S105) resource allocation Spot detection InP service quality, when resource allocation Spot detection bottom InP cannot ensure When SP business is run by qos requirement thereon, resource allocation center can be punished InP；
In order to prevent InP from lying, cause resource allocation to fail, influence resource allocation center and InP market reputation.This hair The bright InP to deliberately wrong report resource provision information is punished：
Wherein,Represent InPiIt is required the computing resource quantity of distribution.Represent InPiIt is required the link money of distribution Source quantity.Represent InPiActual computing resource quantity.Represent InPiActual link circuit resource quantity.
S106) resource allocation center calculation InP value of utility, this transaction is completed；
The InP utility function that the present invention defines QoS drivings is：
Ui(xi,Ri,θi)=Ri-Ci(xi,θi)-Pi------------------------(5)
WhereinRepresent InPiReport the resource at resource allocation center The relevant information of supply.Ci(xi,θi) represent InPiDistribute its θiThe resource x of typei∈ x are to the cost after SP.PiRepresent InPi Lie about the resource type θ of oneselfiPunishment.RiRepresent InPiSell its θiThe resource x of typei∈ x calculate to the income after SP Mode is：
Wherein,Represent InPiOptimal computational resource allocation quantity.Represent InPiOptimal bandwidth resource allocation Quantity.The first half of formula represents to work as InPiWhen not participating in resource allocation, total cost of optimal resource allocation strategy.Formula Latter half represents to work as InPiWhen participating in resource allocation, total cost of optimal resource allocation strategy subtracts InPiCost.Therefore, InPiIncome represent InPiParticipate in the reduction numerical value of the overall cost brought after resource allocation, and InPiIncome be forever Nonnegative value.Because participate in the InP of resource allocationiThe increase of quantity, total cost of optimal resource allocation policy will not be brought to increase Add.
S107) each participant waits for next round resource contention.
Below by taking allocation strategy performance evaluation as an example, to show that the resource allocation methods of the present invention are effective auction sides Method.
Effective auction system refers to that each participant can obtain dominant strategy.Realize dominant strategy, participant Need to realize two incentive Compatibility, allocation efficiency of resource targets.Wherein, incentive Compatibility refers to bidder for the mesh from profit , and the bona fide cost function of oneself of submitting a tender is, it is necessary to prove that bid true valuation is the dominant strategy of all bidder (using fixed Reason 1 proves), participant is individual rationality and can actively participate in auction to come (use theorem 2 prove).Resource point Refer to the maximization for realizing system profit with efficiency, theorem 3 can be used to prove.
Theorem 1：Auction price and quantity for each dealer are that tactic is false proof (strategy-proof).
Prove：The fixed cost and unit cost that proof InP is reported first are real.InPiUtility function maximize It is expressed as：
BecauseWith InPiIt is unrelated, so
Above formula is changed into：
Because Part I can influence the optimal resource allocation result of the overall situation, so, resource allocation center can limit single Wrong reports of the InP to its fixed cost and unit price.Such as find that the InP of wrong report disrupts the market Price Method, can pay for.Institute So that for fixed cost and unit price, real value is dominant strategy.
Secondly each InP is provediIt is optimal policy when reporting real capacity.Work as InPiWhen reporting the capacity of oneself by mistake,Because Ri＞ 0, so, Pi＞ 0； So it is optimal policy that each InP, which reports real capacity,.
In summary, for each InP, fixed cost, the strategy of unit cost and capacity of oneself are really reported, It is the dominant strategy of each dealer.Card is finished.
Theorem 2：Each participant is personal financing (individual rational)
Prove：It is that personal financing is born, it is necessary to prove that the utility function of participant is negated always to prove each participant Value.Because each InP reports oneself real situation, utility function is
And becauseParticipant number ratioParticipant number it is more One InPi, so, the former cost is bigger than the latter, and the value of the latter will also subtract InP in total spendiCost, So utility function necessarily negated negative value so, method is individual rationality.Card is finished.
Theorem 3：The allocative efficiency of method of proof is higher
Prove：First, the optimization aim of the optimal resource allocation problem of QoS drivings is to realize system profit maximization, energy It is enough to produce the trading volume bigger than traditional resource distribution strategy, so as to improve network resource utilization.Secondly, InP is real The price of oneself is reported, such SP really can apply for resource according to the demand of user to InP.If InP improves the valency of oneself Lattice, SP will improve service price, so as to cause the use demand of user to reduce, cause market to be in resource excess state.Institute With, resource allocation methods proposed by the present invention, the service efficiency of InP resources is favorably improved.Therefore the resource allocation of the present invention The allocative efficiency of method is higher.Card is finished.
The preferred embodiments of the present invention are the foregoing is only, are not intended to limit the invention, for the skill of this area For art personnel, the present invention can have various modifications and variations.Within the spirit and principles of the invention, that is made any repaiies Change, equivalent substitution, improvement etc., should be included in the scope of the protection.

Claims (6)

1. a kind of power telecom network maximization of utility resource allocation methods of QoS drivings, it is characterised in that comprise the following steps：
101) resource allocation center is introduced, the resource allocation problem of power telecom network is converted into by bottom-layer network provider (InP), service provider (SP), the auction process of resource allocation center tripartite composition, wherein, the InP provides as resource Person, for providing computing resource and link circuit resource to SP, the SP is as resource requestor, for providing a user service, institute Resource allocation center is stated as resource auctioneer；
102) InP reports resource provision information to resource allocation center, wherein, the resource provision information refers to that InP can be carried The computing resource of confession and the fixation average unit cost of link circuit resource, unit cost, maximum capacity；
103) SP proposes resource requirement information to resource allocation center, wherein, the resource requirement information refers to the meter of SP requests Calculate resources requirement, link resource needs amount；
104) resource provision information, SP resource requirement information of the resource allocation center according to InP, with power telecom network effectiveness most Target is turned to greatly, resource is distributed for the SP；
105) resource allocation Spot detection InP service quality, when resource allocation Spot detection to InP cannot ensure SP industry thereon When business is by qos requirement operation, resource allocation center is punished InP；
106) resource allocation center calculation InP value of utility, this transaction is completed；And
107) each participant waits for next round resource contention.
2. the power telecom network maximization of utility resource allocation methods of QoS drivings according to claim 1, its feature exist In in step (102), if InP collection is combined into IInP={ InP1,InP2,...,InPi, InPiComputing resource and chain are provided for SP Road resource, if InPiThe fixation average unit cost of computing resource beThe unit cost of computing resource isComputing resource Maximum capacity isInPiThe fixation average unit cost of link circuit resource beThe unit cost of link circuit resource isLink The maximum capacity of resource isWork as InPiThe computing resource quantity delivered of in the market beLink circuit resource quantity delivered is When, InPiThe cost of consumptionFor：
<mrow> <msub> <mi>C</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> </msub> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <mrow> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>=</mo> <mn>0</mn> <mo>,</mo> <msubsup> <mi>f</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>=</mo> <mn>0</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msubsup> <mi>f</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>+</mo> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>+</mo> <msubsup> <mi>u</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>+</mo> <msubsup> <mi>f</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>+</mo> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>+</mo> <msubsup> <mi>u</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> </mrow> </mtd> <mtd> <mrow> <mn>0</mn> <mo>&lt;</mo> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>&amp;le;</mo> <msubsup> <mi>cp</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>,</mo> <mn>0</mn> <mo>&lt;</mo> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>&amp;le;</mo> <msubsup> <mi>cp</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>.</mo> </mrow>
3. the power telecom network maximization of utility resource allocation methods of QoS drivings according to claim 1, its feature exist In in step (103), if SP collection is combined into ISP={ SP1,SP2,...,SPj, SPjService is provided the user, it is necessary to use InPiThe computing resource and link circuit resource of offer, if SPjComputational resource requirements amount beLink resource needs amount is
4. the power telecom network maximization of utility resource allocation methods of QoS drivings according to claim 1, its feature exist In in step (104), the resource allocation center is that the calculation of SP distribution resources is：
<mrow> <msup> <mi>X</mi> <mo>*</mo> </msup> <mo>=</mo> <mi>arg</mi> <munder> <mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> <munder> <mo>&amp;Sigma;</mo> <mi>i</mi> </munder> </mrow> <mi>X</mi> </munder> <mo>{</mo> <mrow> <mo>(</mo> <msub> <mi>&amp;lambda;</mi> <mi>i</mi> </msub> <msubsup> <mi>f</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>+</mo> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>&amp;times;</mo> <msubsup> <mi>u</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>)</mo> </mrow> <mo>+</mo> <mrow> <mo>(</mo> <msub> <mi>&amp;gamma;</mi> <mi>i</mi> </msub> <msubsup> <mi>f</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>+</mo> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>&amp;times;</mo> <msubsup> <mi>u</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>)</mo> </mrow> <mo>}</mo> </mrow>
<mrow> <munder> <mo>&amp;Sigma;</mo> <mi>j</mi> </munder> <msubsup> <mi>y</mi> <mrow> <msub> <mi>SP</mi> <mi>j</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>=</mo> <munder> <mo>&amp;Sigma;</mo> <mi>i</mi> </munder> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>,</mo> <munder> <mo>&amp;Sigma;</mo> <mi>j</mi> </munder> <msubsup> <mi>y</mi> <mrow> <msub> <mi>SP</mi> <mi>j</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>=</mo> <munder> <mo>&amp;Sigma;</mo> <mi>i</mi> </munder> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow>
<mrow> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>&amp;le;</mo> <msubsup> <mi>cp</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>,</mo> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>&amp;le;</mo> <msubsup> <mi>cp</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow>
<mrow> <msub> <mi>&amp;lambda;</mi> <mi>i</mi> </msub> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mn>1</mn> </mtd> <mtd> <mrow> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>&gt;</mo> <mn>0</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <mrow> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>c</mi> </msubsup> <mo>=</mo> <mn>0</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> <msub> <mi>&amp;gamma;</mi> <mi>i</mi> </msub> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mn>1</mn> </mtd> <mtd> <mrow> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>&gt;</mo> <mn>0</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <mrow> <msubsup> <mi>y</mi> <mrow> <msub> <mi>InP</mi> <mi>i</mi> </msub> </mrow> <mi>e</mi> </msubsup> <mo>=</mo> <mn>0</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow> 1
Wherein, X={ x1,x2,...,xnRepresent resource allocation when, n InP resource provision amount information, InP resource provision amount, formula (1) represent InP in the case of expression optimal resource allocationiTotal computing resource and bandwidth resources supply Amount is equal to SPjTotal computing resource and bandwidth resources demand, formula (2) represent InPiComputing resource and bandwidth resources supply Amount all illustrates InP no more than the maximum capacity of computing resource and bandwidth resources, formula (3)iQuantity delivered be more than 0 when, can just produce Fixed cost.
5. the power telecom network maximization of utility resource allocation methods of QoS drivings according to claim 1, its feature exist In in step (105), the calculation to InP punishment is：
<mrow> <msub> <mi>P</mi> <mi>i</mi> </msub> <mo>=</mo> <msub> <mi>R</mi> <mi>i</mi> </msub> <mo>{</mo> <mrow> <mo>(</mo> <msubsup> <mi>x</mi> <mi>i</mi> <mrow> <mi>c</mi> <mo>*</mo> </mrow> </msubsup> <mo>&amp;GreaterEqual;</mo> <mover> <msubsup> <mi>x</mi> <mi>i</mi> <mi>c</mi> </msubsup> <mo>&amp;OverBar;</mo> </mover> <mo>)</mo> </mrow> <mi>o</mi> <mi>r</mi> <mrow> <mo>(</mo> <msubsup> <mi>x</mi> <mi>i</mi> <mrow> <mi>e</mi> <mo>*</mo> </mrow> </msubsup> <mo>&amp;GreaterEqual;</mo> <mover> <msubsup> <mi>x</mi> <mi>i</mi> <mi>e</mi> </msubsup> <mo>&amp;OverBar;</mo> </mover> <mo>)</mo> </mrow> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow>
In formula (4),Represent InPiIt is required the computing resource quantity of distribution,Represent InPiIt is required the link circuit resource of distribution Quantity,Represent InPiActual computing resource quantity,Represent InPiActual link circuit resource quantity.
6. the power telecom network maximization of utility resource allocation methods of QoS drivings according to claim 1, its feature exist In in step (106), the calculation of the value of utility for the calculating InP that the resource allocation center uses is：
Ui(xi,Ri,θi)=Ri-Ci(xi,θi)-Pi-----------------(5)
In formula (5),Represent InPiReport the resource provision at resource allocation center Relevant information, Ci(xi,θi) represent InPiDistribute its θiThe resource x of typei∈ x are to the cost after SP, PiRepresent InPiLie about The resource type θ of oneselfiPunishment, RiRepresent InPiSell its θiThe resource x of typei∈ x are to the income after SP, calculation For：
In formula (6),Represent InPiOptimal computational resource allocation quantity,Represent InPiOptimal bandwidth resource allocation number Amount.
CN201710806493.1A 2017-09-08 2017-09-08 A kind of power telecom network maximization of utility resource allocation methods of QoS drivings Pending CN107483365A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710806493.1A CN107483365A (en) 2017-09-08 2017-09-08 A kind of power telecom network maximization of utility resource allocation methods of QoS drivings

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710806493.1A CN107483365A (en) 2017-09-08 2017-09-08 A kind of power telecom network maximization of utility resource allocation methods of QoS drivings

Publications (1)

Publication Number Publication Date
CN107483365A true CN107483365A (en) 2017-12-15

Family

ID=60583698

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710806493.1A Pending CN107483365A (en) 2017-09-08 2017-09-08 A kind of power telecom network maximization of utility resource allocation methods of QoS drivings

Country Status (1)

Country Link
CN (1) CN107483365A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110661649A (en) * 2019-09-05 2020-01-07 深圳供电局有限公司 Power communication network resource allocation method
CN112054924A (en) * 2020-08-27 2020-12-08 深圳供电局有限公司 Resource allocation method of integrated power grid

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110661649A (en) * 2019-09-05 2020-01-07 深圳供电局有限公司 Power communication network resource allocation method
CN110661649B (en) * 2019-09-05 2022-07-26 深圳供电局有限公司 Power communication network resource allocation method
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

Similar Documents

Publication Publication Date Title
Yang et al. VCG-Kelly mechanisms for allocation of divisible goods: Adapting VCG mechanisms to one-dimensional signals
Gao et al. An integrated contract and auction design for secondary spectrum trading
Li et al. Credit-based payments for fast computing resource trading in edge-assisted Internet of Things
Zhou et al. TRUST: A general framework for truthful double spectrum auctions
Yokoo et al. Robust combinatorial auction protocol against false-name bids
Tang et al. Hierarchical auction mechanisms for network resource allocation
Bae et al. Sequential bandwidth and power auctions for distributed spectrum sharing
Mashhadi et al. Optimal auction for delay and energy constrained task offloading in mobile edge computing
Chun et al. Secondary spectrum trading—auction-based framework for spectrum allocation and profit sharing
CN107370616A (en) 5G cellular network virtual resources distribution mechanisms based on combination Double Auction
CN113364831B (en) Multi-domain heterogeneous computing network resource credible cooperation method based on block chain
CN108182112A (en) The resource allocation mechanism of sensing network focusing on people based on combinational auction
CN115396442A (en) Calculation force sharing system and method for urban rail transit
CN107483365A (en) A kind of power telecom network maximization of utility resource allocation methods of QoS drivings
CN103051730B (en) Multi-source information service-resource allocating system and IA-Min allocating method in cloud-computing business environment
CN103824195A (en) Excitation method based on three-round bargaining in opportunity network
Chouayakh et al. PAM: A fair and truthful mechanism for 5G dynamic spectrum allocation
Jain et al. An efficient mechanism for network bandwidth auction
Berry Network market design part II: spectrum markets
Jain Network market design part i: bandwidth markets
Erdayandi et al. Towards privacy preserving local energy markets
Cui et al. Blockchain-based Distributed Power Market Trading Mechanism.
Damle et al. Designing Redistribution Mechanisms for Reducing Transaction Fees in Blockchains
Mohammadi et al. Optimization of virtual machines placement based on microeconomics theory in cloud network
Song et al. On truthful auction mechanism for cloud resources allocation and consumption shifting with different time slots

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20171215