CN110020926A - Resource allocation methods, device and storage medium - Google Patents
Resource allocation methods, device and storage medium Download PDFInfo
- Publication number
- CN110020926A CN110020926A CN201910359159.5A CN201910359159A CN110020926A CN 110020926 A CN110020926 A CN 110020926A CN 201910359159 A CN201910359159 A CN 201910359159A CN 110020926 A CN110020926 A CN 110020926A
- Authority
- CN
- China
- Prior art keywords
- bidder
- bid
- bid item
- resource
- tender
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000013468 resource allocation Methods 0.000 title claims abstract description 28
- 238000003860 storage Methods 0.000 title claims abstract description 19
- 230000007246 mechanism Effects 0.000 claims abstract description 51
- 239000013307 optical fiber Substances 0.000 claims description 73
- 238000001228 spectrum Methods 0.000 claims description 53
- 238000009826 distribution Methods 0.000 claims description 38
- 239000000835 fiber Substances 0.000 claims description 12
- 238000005457 optimization Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 13
- 238000012545 processing Methods 0.000 description 10
- 230000002093 peripheral effect Effects 0.000 description 9
- 230000006870 function Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000008901 benefit Effects 0.000 description 3
- 235000013399 edible fruits Nutrition 0.000 description 3
- 230000004927 fusion Effects 0.000 description 3
- 238000010295 mobile communication Methods 0.000 description 3
- 238000013473 artificial intelligence Methods 0.000 description 2
- 238000001675 atomic spectrum Methods 0.000 description 2
- 239000000919 ceramic Substances 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- GOLXNESZZPUPJE-UHFFFAOYSA-N spiromesifen Chemical compound CC1=CC(C)=CC(C)=C1C(C(O1)=O)=C(OC(=O)CC(C)(C)C)C11CCCC1 GOLXNESZZPUPJE-UHFFFAOYSA-N 0.000 description 2
- 230000001052 transient effect Effects 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 238000005452 bending Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0611—Request for offers or quotes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/08—Auctions
Abstract
This application discloses a kind of resource allocation methods, device and storage mediums, belong to field of cloud computer technology.This method comprises: determining the bid information of multiple bidder of request virtual resource;Bid information based on each bidder in multiple bidder, pass through resource auction theory, target bidder is obtained from multiple bidder, target bidder is the bidder for making social welfare maximization, and resource auction theory is the auction mechanism for describing social welfare maximization;Corresponding virtual resource is distributed to target bidder.It in this application, is exactly the bidder for making social welfare maximization by the target bidder that resource auction theory is determined from multiple bidder, to ensure that resource utilization since resource auction theory is the auction mechanism for describing social welfare maximization.Meanwhile as long as the bidder for needing to obtain virtual resource has the opportunity to submit a tender, a possibility that any bidder obtains virtual resource ensure that, realize the shared across base station of resource.
Description
Technical field
This application involves field of cloud computer technology, in particular to a kind of resource allocation methods, device and storage medium.
Background technique
With the rapid development of network, mobile Internet is constantly in the every aspect for changing human lives, intelligent terminal
Almost become the necessity of human lives, the mankind increasingly improve the demand of rate applications, and such as ultra high-definition video, nobody drives
It sails, and ultra high-definition video, the unmanned resource realization usually required through base station
But in the current network architecture, base station is distributed, and the processing capacity of base station namely resource can only
It is used by the user of their own, cannot be shared across base station, needless to say cross operator.Due to laod unbalance, the power of base station
And low efficiency.Meanwhile the cost of operator's construction and base station maintenance persistently rises, utilization rate is also low.Therefore, a kind of resource is needed
Distribution method.
Summary of the invention
The embodiment of the present application provides a kind of resource allocation methods, device and storage medium, for solving in the related technology
The problem that resource can not be shared across base station.The technical solution is as follows:
In a first aspect, providing a kind of resource allocation methods, which comprises
Determine the bid information of multiple bidder of request virtual resource;
Based on the bid information of each bidder in the multiple bidder, by resource auction theory, from the multiple
Target bidder is obtained in bidder, the target bidder is the bidder for making social welfare maximization, the resource auction
Model is the auction mechanism for describing social welfare maximization;
Corresponding virtual resource is distributed to the target bidder.
Optionally, the bid information includes K bid item, each bidder that each bidder is submitted a tender
The tender price and each submitted a tender resource of bid item submitted a tender to each bid item in the K bid item, it is described
K is greater than or equal to 1;
The bid information based on each bidder in the multiple bidder, by resource auction theory, from described
Target bidder is obtained in multiple bidder, comprising:
Based on the tender price that each bidder submits a tender to each bid item in the K bid item, pass through institute
Resource auction theory is stated, is determined from the K bid item and refers to bid item;
Bid item is referred to based on described, is determined to the reference for distributing virtual resource with reference to the corresponding bidder of bid item
Resource capacity;
When the reference resources capacity meets distributive condition, it will be set as 1 with reference to the corresponding bid result of bid item, institute
The bid result for stating other bid items in K bid item in addition to the item with reference to bid is set as 0, and updates resource allocation
Mode is returned to the tender price submitted a tender based on each bidder to each bid item in the K bid item, led to
Resource auction theory is crossed, the operation for referring to bid item is determined from the K bid item, until the number for executing above-mentioned steps reaches
To the first preset times;
The corresponding bidder of reference bid item for including in updated resource distribution mode is determined as the target to throw
Mark person.
Optionally, the bid submitted a tender based on each bidder to each bid item in the K bid item
Price determines from the K bid item by resource auction theory and refers to bid item, comprising:
The tender price of each bid item based on each bidder claps model by the resource and determines the K
The winning probability of a bid item;
When the winning probability is score, it is general that the winning probability is determined as integer by way of rounding up
Rate;
Based on the integer probability of each bid item, determined from the K bid item described with reference to bid item.
Optionally, the bid information includes K bid item, each bidder that each bidder is submitted a tender
The price and each submitted a tender resource of bid item, the K submitted a tender to each bid item in the K bid item are big
In or equal to 1;
The bid information based on each bidder in the multiple bidder, by resource auction theory, from described
Target bidder is obtained in multiple bidder, comprising:
1 is set by the tender price of the feasible bid item in K bid item that each bidder is submitted a tender, it can not
The tender price of row bid item is set as 0, and the feasible bid item is the bid for meeting bidding condition in the K bid item
, the infeasible bid item is the bid item that the bidding condition is not met in the K bid item;
Tender price corresponding to each bid item based on each bidder, by the resource auction theory,
It is determined from the K bid item and refers to bid item and corresponding winning probability;
Based on the winning probability with reference to bid item, branch of the reference man's bid item under VCG Bidding Mechanism is determined
Pay price;
Resource distribution mode is updated according to price paid, and returns to the K bid item that each bidder is submitted a tender
In the tender price of feasible bid item be set as 1, the tender price of infeasible bid item is set as 0 operation, until executing
The number of above-mentioned steps reaches the second preset times;
The corresponding bidder of reference bid item for including in updated resource distribution mode is determined as the target to throw
Mark person.
Optionally, described based on the winning probability with reference to bid item, determine that reference man's bid item is bidded in VCG
Price paid under mechanism, comprising:
Based on the winning probability with reference to bid item, determine the reference bid item in VCG by following first formula
Price paid under Bidding Mechanism;
Wherein, describedIt is described for the price paid with reference to bid item k under VCG Bidding MechanismFor
The solution set of first formula, the x are any one feasible solution in the feasible solution set of first formula, and the N is
Be able to carry out the quantity of the bidder of bid, the s (n) be from 0 to T duration in bidder's set for submitting a tender, the b is
The price of bid, the n' are any bidder in the s (n), and the k is any bid item in the K bid item,
The bn',kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and consumes designated capabilities bandwidth on optical fiber link
Price, it is describedThe winning probability submitted a tender for bidder n'.
Optionally, described based on the winning probability with reference to bid item, determine that reference man's bid item is bidded in VCG
After price paid under mechanism, further includes:
It is general based on price paid of the reference man's bid item under VCG Bidding Mechanism and the triumph with reference to bid item
Rate determines the price paid for auctioning the auctioneer of the virtual resource by following second formula;
Wherein, describedIt is described for the price of auctioner paymentIt bids machine with reference to bid item k in VCG to be described
Price paid under system, the bn'kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and is disappeared on optical fiber link
The price of designated capabilities bandwidth is consumed, it is describedIt submits a tender the winning probability of the integer type with reference to bid item k for bidder n',
It is describedIt submits a tender the winning probability of the fractional-type with reference to bid item k for bidder n'.
Optionally, the bid information based on each bidder in the multiple bidder, by resource auction theory,
Before obtaining target bidder in the multiple bidder, further includes:
Based on the bid information of the multiple bidder, the auction mechanism of the social welfare maximization is passed through into integer line
Property planning mode handled, obtain following resource auction theory;
Wherein, the N is the quantity for being able to carry out the bidder of bid, the n be it is described it is N number of in any bidder,
The number for the bid item that the K is submitted a tender by each bidder, the k are any bid item in a bid item, and the M is base station
Quantity, the m are any base station in the M base station, and the I is the quantity of optical fiber link, and the i is the I optical fiber
Either fiber link in link, the bn,K is that bidder n consumes frequency spectrum resource r on base stationn,k,mAnd on optical fiber link i
Consume bandwidth dn,k,iWhen price, the xn,kFor bidder n bid as a result, the rn,k,mDisappear on the m of base station for bidder
The frequency spectrum resource of consumption, the RmFor the frequency spectrum resource total amount of base station m, the dn,k,iIt is consumed on optical fiber link i for bidder n
Bandwidth, the DiFor the bandwidth capacity of optical fiber link i.
Optionally, the bid information based on the multiple bidder, by the auction machine of the social welfare maximization
After system is handled by way of integral linear programming, further includes:
Optimization is zoomed in and out to the resource auction theory, the resource auction theory after being optimized as follows;
Wherein, the N is the quantity for being able to carry out the bidder of bid, the n be it is described it is N number of in any bidder,
The number for the bid item that the K is submitted a tender by each bidder, the k are any bid item in a bid item, and the M is base station
Quantity, the m are any base station in the M base station, and the I is the quantity of optical fiber link, and the i is the I optical fiber
Either fiber link in link, the bn,kFrequency spectrum resource r is consumed on base station for bidder nn,k,mAnd on optical fiber link i
Consume bandwidth dn,k,iWhen price, the xn,kFor bidder n bid as a result, the rn,k,mDisappear on the m of base station for bidder
The frequency spectrum resource of consumption, the RmFor the frequency spectrum resource total amount of base station m, the dn,k,iIt is consumed on optical fiber link i for bidder n
Bandwidth, the DiFor the bandwidth capacity of optical fiber link i, the f is zoom factor, and the S is to be thrown until current time
Target bidder set.
Second aspect, provides a kind of resource allocation device, and described device includes:
Determining module, the bid information of multiple bidder for determining request virtual resource;
It obtains module and mould is auctioned by resource for the bid information based on each bidder in the multiple bidder
Type obtains target bidder from the multiple bidder, and the target bidder is the bidder for making social welfare maximization,
The resource auction theory is the auction mechanism for describing social welfare maximization;
Distribution module, for distributing corresponding virtual resource to the target bidder.
Optionally, the bid information includes K bid item, each bidder that each bidder is submitted a tender
The tender price and each submitted a tender resource of bid item submitted a tender to each bid item in the K bid item, it is described
K is greater than or equal to 1;
The acquisition module includes:
First determines submodule, for being thrown based on each bidder each bid item in the K bid item
Target tender price determines from the K bid item by the resource auction theory and refers to bid item;
Second determines submodule, for referring to bid item based on described, determines to described with reference to the corresponding bid of bid item
The reference resources capacity of person's distribution virtual resource;
First triggering submodule, for that will be corresponded to reference to bid item when the reference resources capacity meets distributive condition
Bid result be set as 1, the bid result of other bid items in the K bid item in addition to the item with reference to bid is set
It is set to 0, and updates resource distribution mode, described first is triggered and determines that submodule is based on each bidder and throws described K
The tender price that each bid item is submitted a tender in mark item is determined from the K bid item with reference to throwing by resource auction theory
Item is marked, until the number for executing above-mentioned steps reaches the first preset times;
Third determines submodule, the corresponding bid of reference bid item for that will include in updated resource distribution mode
Person is determined as the target bidder.
Optionally, described first determine that submodule is used for:
The tender price of each bid item based on each bidder claps model by the resource and determines the K
The winning probability of a bid item;
When the winning probability is score, it is general that the winning probability is determined as integer by way of rounding up
Rate;
Based on the integer probability of each bid item, determined from the K bid item described with reference to bid item.
Optionally, the bid information includes K bid item, each bidder that each bidder is submitted a tender
The price and each submitted a tender resource of bid item, the K submitted a tender to each bid item in the K bid item are big
In or equal to 1;
The acquisition module includes:
Submodule, the bid of the feasible bid item in K bid item for each bidder to be submitted a tender are set
Price is set as 1, and the tender price of infeasible bid item is set as 0, and the feasible bid item is to meet in the K bid item
The bid item of bidding condition, the infeasible bid item are the bid item that the bidding condition is not met in the K bid item;
4th determines submodule, for tender price corresponding to each bid item based on each bidder, leads to
The resource auction theory is crossed, is determined from the K bid item and refers to bid item and corresponding winning probability;
5th determines submodule, for determining reference man's bid item based on the winning probability with reference to bid item
Price paid under VCG Bidding Mechanism;
Second triggering submodule, for updating resource distribution mode according to price paid, and returns each bid
The tender price for the feasible bid item in K bid item that person is submitted a tender is set as 1, the tender price setting of infeasible bid item
For 0 operation, the number up to executing above-mentioned steps reaches the second preset times;
6th determines submodule, the corresponding bid of reference bid item for that will include in updated resource distribution mode
Person is determined as the target bidder.
Optionally, the described 5th determine that submodule is used for:
Based on the winning probability with reference to bid item, determine the reference bid item in VCG by following first formula
Price paid under Bidding Mechanism;
Wherein, describedIt is described for the price paid with reference to bid item k under VCG Bidding MechanismFor
The solution set of first formula, the x are any one feasible solution in the feasible solution set of first formula, and the N is
Be able to carry out the quantity of the bidder of bid, the s (n) be from 0 to T duration in bidder's set for submitting a tender, the b is
The price of bid, the n' are any bidder in the s (n), and the k is any bid item in the K bid item,
The bn',kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and consumes designated capabilities bandwidth on optical fiber link
Price, it is describedThe winning probability submitted a tender for bidder n'.
Optionally, the acquisition module further include:
7th determines submodule, for based on price paid of the reference man's bid item under VCG Bidding Mechanism and institute
The winning probability with reference to bid item is stated, the price for auctioning the auctioneer of the virtual resource is determined by following second formula
Lattice;
Wherein, describedIt is described for the price of auctioner paymentIt bids machine with reference to bid item k in VCG to be described
Price paid under system, the bn'kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and is disappeared on optical fiber link
The price of designated capabilities bandwidth is consumed, it is describedIt submits a tender the winning probability of the integer type with reference to bid item k for bidder n',
It is describedIt submits a tender the winning probability of the fractional-type with reference to bid item k for bidder n'.
Optionally, described device further include:
Processing module, for the bid information based on the multiple bidder, by the auction of the social welfare maximization
Mechanism is handled by way of integral linear programming, obtains following resource auction theory;
Wherein, the N is the quantity for being able to carry out the bidder of bid, the n be it is described it is N number of in any bidder,
The number for the bid item that the K is submitted a tender by each bidder, the k are any bid item in a bid item, and the M is base station
Quantity, the m are any base station in the M base station, and the I is the quantity of optical fiber link, and the i is the I optical fiber
Either fiber link in link, the bn,kFrequency spectrum resource r is consumed on base station for bidder nn,k,mAnd on optical fiber link i
Consume bandwidth dn,k,iWhen price, the xn,kFor bidder n bid as a result, the rn,k,mDisappear on the m of base station for bidder
The frequency spectrum resource of consumption, the RmFor the frequency spectrum resource total amount of base station m, the dn,k,iIt is consumed on optical fiber link i for bidder n
Bandwidth, the DiFor the bandwidth capacity of optical fiber link i.
Optionally, described device further include:
Optimization module, the resource auction for zooming in and out optimization to the resource auction theory, after being optimized as follows
Model;
Wherein, the N is the quantity for being able to carry out the bidder of bid, the n be it is described it is N number of in any bidder,
The number for the bid item that the K is submitted a tender by each bidder, the k are any bid item in a bid item, and the M is base station
Quantity, the m are any base station in the M base station, and the I is the quantity of optical fiber link, and the i is the I optical fiber
Either fiber link in link, the bn,kFrequency spectrum resource r is consumed on base station for bidder nn,k,mAnd on optical fiber link i
Consume bandwidth dn,k,iWhen price, the xn,kFor bidder n bid as a result, the rn,k,mDisappear on the m of base station for bidder
The frequency spectrum resource of consumption, the RmFor the frequency spectrum resource total amount of base station m, the dn,k,iIt is consumed on optical fiber link i for bidder n
Bandwidth, the DiFor the bandwidth capacity of optical fiber link i, the f is zoom factor, and the S is to be thrown until current time
Target bidder set.
The third aspect provides a kind of computer readable storage medium, is stored with computer program in the storage medium,
The computer program realizes above-mentioned first aspect any method when being executed by processor.
Fourth aspect, provides a kind of distributing equipment, and the distributing equipment includes:
Processor;
Memory for storage processor executable instruction;
Wherein, the processor is configured to the step of executing any one method that above-mentioned first aspect provides.
5th aspect, provides a kind of computer program product comprising instruction, when run on a computer, so that
Computer executes the step of any one method that above-mentioned first aspect provides.
Technical solution bring beneficial effect provided by the embodiments of the present application includes at least:
In the embodiment of the present application, the bid information of multiple bidder of request virtual resource can be determined;It is based on
The bid information of each bidder in multiple bidder is obtained target from multiple bidder and is submitted a tender by resource auction theory
Then person distributes virtual resource to target bidder.Since resource auction theory is the auction machine for describing social welfare maximization
System is exactly the bid for making social welfare maximization by the target bidder that resource auction theory is determined from multiple bidder
Person, to ensure that resource utilization.Meanwhile as long as the bidder for needing to obtain virtual resource has the opportunity to submit a tender,
It ensure that a possibility that any bidder obtains virtual resource, realize the shared across base station of resource.
Detailed description of the invention
In order to more clearly explain the technical solutions in the embodiments of the present application, make required in being described below to embodiment
Attached drawing is briefly described, it should be apparent that, the drawings in the following description are only some examples of the present application, for
For those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings other
Attached drawing.
Fig. 1 is a kind of resource allocation methods flow chart provided by the embodiments of the present application;
Fig. 2 is another resource allocation methods flow chart provided by the embodiments of the present application;
Fig. 3 is that datagram is compared in a kind of competition provided by the embodiments of the present application;
Fig. 4 is that comparison diagram is compared in a kind of competition of capacity accounting provided by the embodiments of the present application;
Fig. 5 is a kind of optimal social welfare comparison diagram with online optimal solution of offline integer provided by the embodiments of the present application;
Fig. 6 is the first resource allocation device structural schematic diagram provided by the embodiments of the present application.
Fig. 7 is the structural schematic diagram of the first acquisition module provided by the embodiments of the present application.
Fig. 8 is the structural schematic diagram of second of acquisition module provided by the embodiments of the present application.
Fig. 9 is that provided by the embodiments of the present application the third obtains the structural schematic diagram of module.
Figure 10 is second of resource allocation device structural schematic diagram provided by the embodiments of the present application.
Figure 11 is the third resource allocation device structural schematic diagram provided by the embodiments of the present application.
Figure 12 is a kind of structural schematic diagram of distributing equipment provided by the embodiments of the present application.
Specific embodiment
To keep the purposes, technical schemes and advantages of the application clearer, below in conjunction with attached drawing to the application embodiment party
Formula is described in further detail.
Before carrying out detailed explanation to the embodiment of the present application, the first application to being related in the embodiment of the present application
Scene is explained.
With the rapid development of network, mobile Internet is constantly in the every aspect for changing human lives, intelligent terminal
Almost become the necessity of human lives, the mankind increasingly improve the demand of rate applications, and such as ultra high-definition video, nobody drives
It sails, then 5G (the 5th third-generation mobile communication technology) comes into being.Compared to 4G (fourth generation mobile communication technology) system, 5G purport
It is realizing at least 100 times of peak rate of growth, spectrum efficiency and at least 10 times of energy efficiency of growth, is covering capacity at least 25
Growth again.
Currently, the business computation model that cloud computing is novel as one kind, allows users to obtain calculating power, storage sky on demand
Between and information service, purpose be exactly the utilization rate in order to improve resource, promote the service quality of platform.Cloud provider is in market
A large amount of resources idle is had in the unsaturated situation of demand, cloud provider is ready in a short time by these resources more to attract use
The price at family launches in the market and earns more profits, thus be born another resource distribution mode, i.e. auction technique
(Auction based), in general, the mode of user by inch of candle determine to obtain the price of resource and can be significantly less than it and use
Price when valence mode have stimulated more users in this way to buy resource, improve resource utilization, Ye Nengshi cloud provider
Obtain more incomes
But in the current network architecture, base station is distributed, and the processing capacity of base station namely resource can only
It is used by the user of their own, cannot be shared across base station, needless to say cross operator.Due to laod unbalance, the power of base station
And low efficiency.Meanwhile the cost of operator's construction and base station maintenance persistently rises, utilization rate is also low.
Based on such scene, the embodiment of the present application provides a kind of realization resource and distributes across base station, operator, and improve
The resource allocation methods of resource utilization.
It, next will be in conjunction with attached drawing to the embodiment of the present application after the application scenarios to the embodiment of the present application are introduced
The method of the resource allocation of offer describes in detail.
Fig. 1 is a kind of flow chart of resource allocation methods provided by the embodiments of the present application, and referring to Fig. 1, this method is applied to
In distributing equipment, include the following steps.
Step 101: determining the bid information of multiple bidder of request virtual resource.
Step 102: the bid information based on each bidder in multiple bidder, by resource auction theory, from this
Target bidder is obtained in multiple bidder, target bidder is the bidder for making social welfare maximization, resource auction
Model is the auction mechanism for describing social welfare maximization.
Step 103: distributing corresponding virtual resource to target bidder.
In the embodiment of the present application, the bid information of multiple bidder of request virtual resource can be determined;It is based on
The bid information of each bidder in multiple bidder is obtained target from multiple bidder and is submitted a tender by resource auction theory
Then person distributes virtual resource to target bidder.Since resource auction theory is the auction machine for describing social welfare maximization
System is exactly the bid for making social welfare maximization by the target bidder that resource auction theory is determined from multiple bidder
Person, to ensure that resource utilization.Meanwhile as long as the bidder for needing to obtain virtual resource has the opportunity to submit a tender,
It ensure that a possibility that any bidder obtains virtual resource, realize the shared across base station of resource.
Optionally, the bid information include each bidder submitted a tender K bid item, each bidder is to K
The tender price and each submitted a tender resource of bid item that each bid item is submitted a tender in bid item, K are greater than or equal to 1;
Based on the bid information of each bidder in multiple bidder, by resource auction theory, from multiple bid
Target bidder is obtained in person, comprising:
Based on the tender price that each bidder submits a tender to each bid item in K bid item, clapped by the resource
Model is sold, is determined from K bid item and refers to bid item;
Bid item is referred to based on this, determines the reference resources for distributing this virtual resource with reference to the corresponding bidder of bid item
Capacity;
When the reference resources capacity meets distributive condition, it will be set as 1 with reference to the corresponding bid result of bid item, the K
The bid result of other bid items in a bid item in addition to this is with reference to bid item is set as 0, and updates resource distribution mode,
The tender price submitted a tender based on each bidder to each bid item in the K bid item is returned, is auctioned by resource
Model determines the operation for referring to bid item from the K bid item, until the number for executing above-mentioned steps reaches first default time
Number;
The corresponding bidder of reference bid item for including in updated resource distribution mode is determined as the target to submit a tender
Person.
Optionally, the tender price submitted a tender based on each bidder to each bid item in the K bid item, is passed through
Resource auction theory determines from the K bid item and refers to bid item, comprising:
The tender price of each bid item based on each bidder claps model by the resource and determines this K bid
The winning probability of item;
When the winning probability is score, which is determined as integer probability by way of rounding up;
Based on the integer probability of each bid item, determine that this refers to bid item from the K bid item.
Optionally, the bid information include each bidder submitted a tender K bid item, each bidder is to the K
The price and each submitted a tender resource of bid item that each bid item is submitted a tender in a bid item, the K are greater than or equal to 1;
Based on the bid information of each bidder in multiple bidder, by resource auction theory, from multiple bid
Target bidder is obtained in person, comprising:
1 is set by the tender price of the feasible bid item in K bid item that each bidder is submitted a tender, it is infeasible
The tender price of bid item is set as 0, which is the bid item for meeting bidding condition in the K bid item, this is not
Feasible bid item is the bid item that the bidding condition is not met in the K bid item;
Tender price corresponding to each bid item based on each bidder, by the resource auction theory, from the K
It is determined in a bid item and refers to bid item and corresponding winning probability;
The winning probability that bid item is referred to based on this, determines the price of reference man's bid item under VCG Bidding Mechanism
Lattice;
Resource distribution mode is updated according to price paid, and is returned in the K bid item that each bidder is submitted a tender
The tender price of feasible bid item be set as 1, the tender price of infeasible bid item is set as 0 operation, until on executing
The number for stating step reaches the second preset times;
The corresponding bidder of reference bid item for including in updated resource distribution mode is determined as the target to submit a tender
Person.
Optionally, the winning probability that bid item is referred to based on this, determines reference man's bid item under VCG Bidding Mechanism
Price paid, comprising:
The winning probability that bid item is referred to based on this determines that this is bidded with reference to bid item in VCG by following first formula
Price paid under mechanism;
Wherein,Price paid of the bid item k under VCG Bidding Mechanism is referred to for this,For first formula
Solution set, x be first formula feasible solution set in any one feasible solution, N is the bidder for being able to carry out bid
Quantity, s (n) be from 0 to T duration in submit a tender bidder set, the b be submit a tender price, n' be s (n) in any
Bidder, the k are any bid item in the K bid item, bn',kDesignated capabilities frequency spectrum is consumed on base station for bidder n'
Resource and the price that designated capabilities bandwidth is consumed on optical fiber link,The winning probability submitted a tender for bidder n'.
Optionally, the winning probability that bid item is referred to based on this, determines reference man's bid item under VCG Bidding Mechanism
After price paid, further includes:
The winning probability of bid item is referred to this based on the price paid of reference man's bid item under VCG Bidding Mechanism,
The price paid for auctioning the auctioneer of the virtual resource is determined by following second formula;
Wherein,For the auctioner payment price,Price of the bid item k under VCG Bidding Mechanism is referred to for this
Lattice, bn'kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and consumes designated capabilities bandwidth on optical fiber link
Price,For bidder n' submit a tender this with reference to bid item k integer type winning probability,It submits a tender the reference for bidder n'
The winning probability of the fractional-type of bid item k.
Optionally, the bid information based on each bidder in multiple bidder is more from this by resource auction theory
In a bidder before acquisition target bidder, further includes:
Based on the bid information of multiple bidder, the auction mechanism of the social welfare maximization is advised by integer linear
The mode drawn is handled, and following resource auction theory is obtained;
Wherein, N is the quantity for being able to carry out the bidder of bid, and n is any bidder during this is N number of, and K is each bid
The number for the bid item that person is submitted a tender, k are any bid item in a bid item, and M is base station number, and m is any in M base station
Base station, I are the quantity of optical fiber link, and i is the either fiber link in I optical fiber link, bn,kDisappear on base station for bidder n
Consume frequency spectrum resource rn,k,mAnd bandwidth d is consumed on optical fiber link in,k,iWhen price, xn,kFor bidder n bid as a result,
rn,k,mFor the frequency spectrum resource that bidder consumes on the m of base station, RmFor the frequency spectrum resource total amount of base station m, dn,k,iIt is bidder n in light
The bandwidth consumed on fine link i, DiFor the bandwidth capacity of optical fiber link i.
Optionally, the bid information based on multiple bidder passes through the auction mechanism of the social welfare maximization whole
After the mode of number linear programming is handled, further includes:
Optimization is zoomed in and out to the resource auction theory, the resource auction theory after being optimized as follows;
Wherein, N is the quantity for being able to carry out the bidder of bid, and n is any bidder during this is N number of, and K is each bid
The number for the bid item that person is submitted a tender, k are any bid item in a bid item, and M is base station number, and m is any in M base station
Base station, I are the quantity of optical fiber link, and i is the either fiber link in I optical fiber link, bn,kDisappear on base station for bidder n
Consume frequency spectrum resource rn,k,mAnd bandwidth d is consumed on optical fiber link in,k,iWhen price, xn,kFor bidder n bid as a result,
rn,k,mThe frequency spectrum resource consumed on the m of base station for bidder states RmFor the frequency spectrum resource total amount of base station m, dn,k,iExist for bidder n
The bandwidth consumed on optical fiber link i, DiFor the bandwidth capacity of optical fiber link i, f is zoom factor, S be until current time into
Bidder's set that row is submitted a tender.
All the above alternatives, can form the alternative embodiment of the application according to any combination, and the application is real
It applies example and this is no longer repeated one by one.
Fig. 2 is that the flow chart that a kind of course continuation mileage of automobile provided by the embodiments of the present application determines method referring to fig. 2 should
Method includes the following steps.
Step 201: distributing equipment determines the bid information of multiple bidder of request virtual resource.
It should be noted that multiple bidder are distributing equipments when by inch of candle mode carries out resource allocation, request is obtained
A side of virtual resource is taken, multiple bidder can be each operator, various platforms for providing network service etc..The distribution
Equipment can be to provide equipment used in the auctioneer of various virtual resources, for example, the distributing equipment can be cloud provider
The server etc. used when virtual resource is provided.
In order to improve resource utilization and resource auctioneer is made to obtain more interests, distributing equipment is usually required really
Determine the bid information of multiple bidder of request virtual resource.Wherein, bid information may include that each bidder is thrown
The tender price and each bid that K bid item of target, each bidder submit a tender to each bid item in K bid item
Item institute bid resource, and K is greater than or equal to 1.When by inch of candle mode obtains virtual resource to multiple bidder needs, multiple throwings
Any bidder in mark person can provide a true appraisal to each bid item, and the appraisal is sent to distribution and is set
It is standby, thus the available bid information to multiple bidder of distributing equipment.
It should be noted that each bid item can be for when consuming certain virtual resource, bidder be ready the valence of payment
Lattice.
Step 202: distributing equipment determines resource auction theory, which is description social welfare maximization
Auction mechanism.
Under normal conditions, it in order to make social welfare maximization, that is to say, in order to improve resource utilization and make resource
Auctioneer obtains more interests, it usually needs using social welfare maximization as the constraint condition for determining resource distribution mode.
Therefore, distributing equipment is it needs to be determined that resource auction theory.
Wherein, distributing equipment can be based on the bid information of multiple bidder, by the auction mechanism of social welfare maximization
It is handled by way of integral linear programming, obtains following resource auction theory:
Wherein, in above-mentioned resource auction theory, N is the quantity for being able to carry out the bidder of bid, and n is appointing in N number of
One bidder, the number for the bid item that K is submitted a tender by each bidder, k are any bid item in a bid item, and M is base station number
Amount, m are any base station in M base station, and I is the quantity of optical fiber link, and i is the either fiber link in I optical fiber link,
bn,kFrequency spectrum resource r is consumed on base station for bidder nn,k,mAnd bandwidth d is consumed on optical fiber link in,k,iWhen price, xn,k
For bidder n bid as a result, rn,k,mFor the frequency spectrum resource that bidder consumes on the m of base station, RmFrequency spectrum resource for base station m is total
Amount, dn,k,iFor the bandwidth that bidder n is consumed on optical fiber link i, DiFor the bandwidth capacity of optical fiber link i.
It should be noted that N, K, M, I, Rm、DiQuantity can usually be arranged in advance, for example, the quantitative range of N is usual
For [10,80], K is usually 4, M, and usually 10, I is usually 6, DiBe generally in the range of [80,200], RmBe generally in the range of
[120,200] etc..
In one possible implementation, when determining resource distribution mode, distributing equipment can directly pass through resource
Auction theory obtains target bidder from multiple bidder, still, due to the sometimes bid information of N number of bidder and meeting
It reaches simultaneously, if directly determining target bidder by above-mentioned resource auction theory, distributing equipment needs are largely calculated,
Therefore, in order to reduce calculating process, speed and efficiency that distributing equipment determines target bidder are improved, distributing equipment can also be right
Resource auction theory zooms in and out optimization.
Wherein, the operation that distributing equipment zooms in and out optimization to resource auction theory can be with are as follows: will submit a tender
The inverse of the quantity of bidder is determined as to the zoom factor zoomed in and out in resource auction theory, according to the zoom factor to money
The conditions such as frequency spectrum resource total amount, bandwidth capacity in the auction theory of source zoom in and out, meanwhile, by the condition x in auction theoryn,k
∈ { 0,1 } relaxes, for example, can be by condition xn,k∈ { 0,1 } relaxation is 0≤∑ xn,k≤ 1, when the throwing for being able to carry out bid
When the quantity of mark person is N, which is 1/N.
It should be noted that after resource auction theory is zoomed in and out optimization in the manner described above, it is available following excellent
Resource auction theory after change:
It should be noted that N is the quantity for being able to carry out the bidder of bid, n is any bidder in N number of, and K is every
The number for the bid item that a bidder is submitted a tender, k are any bid item in a bid item, and M is base station number, and m is in M base station
Any base station, I is the quantity of optical fiber link, and i is the either fiber link in I optical fiber link, bn,kIt is bidder n in base
Frequency spectrum resource r is consumed on standingn,k,mAnd bandwidth d is consumed on optical fiber link in,k,iWhen price, xn,kFor the bid knot of bidder n
Fruit, rn,k,mFor the frequency spectrum resource that bidder consumes on the m of base station, RmFor the frequency spectrum resource total amount of base station m, dn,k,iFor bidder n
The bandwidth consumed on optical fiber link i, DiFor the bandwidth capacity of optical fiber link i, f is zoom factor,SFor until current time
The bidder's set submitted a tender, and S ∈ [N].
In addition, the operation that distributing equipment zooms in and out optimization to resource auction theory not only may include aforesaid way, also
It may include other modes, for example, distributing equipment can be scaled in frequency spectrum resource total amount, bandwidth capacity etc. by zoom factor
Any one.
Step 203: distributing equipment based on the bid information of each bidder in bidder, mould is auctioned by resource
Type obtains target bidder from multiple bidder, and target bidder is the bidder for making social welfare maximization.
Since multiple auctioneers bid information given when auctioning virtual resource be not identical, in order to make social welfare most
Bigization, distributing equipment need the bid information based on bidder each in multiple bidder, by resource auction theory, from multiple
Target bidder is obtained in bidder.
Wherein, bid information of the distributing equipment based on each bidder in multiple bidder, by resource auction theory, from
It may include the following two kinds mode that the operation of target bidder is obtained in multiple bidder.
First way, the bid that distributing equipment submits a tender to each bid item in K bid item based on each bidder
Price determines from K bid item by resource auction theory and refers to bid item;Based on reference bid item, determines and reference is thrown
Mark the reference resources capacity that the corresponding bidder of item distributes virtual resource;When reference resources capacity meets distributive condition, will join
Examine the bid knot that the corresponding bid result of bid item is set as other bid items in 1, K bid item in addition to reference bid item
Fruit is set as 0, and updates resource distribution mode, returns and is thrown based on each bidder each bid item in K bid item
Target tender price determines the operation for referring to bid item by resource auction theory from K bid item, until executing above-mentioned
The number of step reaches the first preset times;The corresponding bid of reference bid item that will include in updated resource distribution mode
Person is determined as target bidder.
Wherein, the tender price that distributing equipment submits a tender to each bid item in K bid item based on each bidder is led to
Resource auction theory is crossed, determines that the operation with reference to bid item can be with from K bid item are as follows: each throwing based on each bidder
The tender price for marking item claps the winning probability that model determines K bid item by resource;When winning probability is score, will obtain
Fine scenery rate is determined as integer probability by way of rounding up;Based on the integer probability of each bid item, from K bid item
It determines and refers to bid item.
For example, winning probability is determined as to integer probability 1 by way of rounding up when winning probability is 0.9, when
When winning probability is 1.5, winning probability is determined as to integer probability 2 by way of rounding up.
In addition, integer probability of the distributing equipment based on each bid item, determines the behaviour for referring to bid item from K bid item
Making can be with are as follows: is determined as the bid item of integer maximum probability in K bid item to refer to bid item, alternatively, from K bid item
Random determine refers to bid item.For example, when the corresponding integer probability of 3 bid items A, B, C is respectively 1,3,5, it is random to determine
Reference bid item may be any of for A, B, C.
It should be noted that reference resources capacity, which meets distributive condition, refers to that reference resources capacity is less than specified resource and holds
Amount, the specified resource capacity can be arranged in advance, for example, the specified resource capacity can hold for the maximum resource of C-RAN system
Amount, half of maximum resource capacity etc. etc..In addition, first preset times can be arranged in advance, for example, this is first default
Number can be the quantity for the bidder that current time reaches.
The second way, the bid for the feasible bid item in K bid item that distributing equipment is submitted a tender each bidder
Price is set as 1, and the tender price of infeasible bid item is set as 0, and feasible bid item is to meet bidding condition in K bid item
Bid item, infeasible bid item is the bid item that bidding condition is not met in K bid item;Based on each of each bidder
Tender price corresponding to bid item determines from the K bid item by the resource auction theory and refers to bid item and correspondence
Winning probability;The winning probability that bid item is referred to based on this, determines the payment of reference man's bid item under VCG Bidding Mechanism
Price;Update resource distribution mode according to price paid, and return in K bid item that each bidder is submitted a tender can
The tender price of row bid item is set as 1, and the tender price of infeasible bid item is set as 0 operation, until executing above-mentioned step
Rapid number reaches the second preset times;The corresponding bidder of reference bid item that will include in updated resource distribution mode
It is determined as target bidder.
It should be noted that distributing equipment, which assume that, receives the current bid of bidder, and after assuming that receiving, if
The reference resources capacity for the bid item that bidder is submitted a tender meets distributive condition, that is to say, the reference resources capacity for item of submitting a tender is small
When specified resource capacity, the bid item that bidder is submitted a tender is determined as feasible bid item, otherwise, it determines being infeasible bid
?.
Wherein, distributing equipment refers to the winning probability of bid item based on this, determines that reference man's bid item is bidded machine in VCG
The operation of the lower price paid of system can be with are as follows: the winning probability that bid item is referred to based on this determines this by following first formula
With reference to price paid of the bid item under VCG Bidding Mechanism;
It should be noted that in above-mentioned first formula (1),For the payment with reference to bid item k under VCG Bidding Mechanism
Price,For the solution set of the first formula, x is any one feasible solution in the feasible solution set of the first formula, and N is energy
The quantity of the bidder enough to submit a tender, s (n) be from 0 to T duration in submit a tender bidder set, the b be bid
Price, n' are any bidder in the s (n), and k is any bid item in K bid item, bn',kIt is bidder n' in base
Designated capabilities frequency spectrum resource is consumed on standing and the price of designated capabilities bandwidth is consumed on optical fiber link,For bidder n' throwing
Target winning probability.
In addition, second preset times can be arranged in advance, for example, second preset times can reach for current time
Bidder quantity.First preset times can be identical as the second preset times, can not also be identical.
Further, winning probability of the distributing equipment based on reference bid item determines that reference man's bid item is bidded machine in VCG
After price paid under system, it is also based on the price paid with reference to bid item k under VCG Bidding Mechanism and refers to bid item
Winning probability, determine auction virtual resource auctioneer price paid.
Wherein, distributing equipment can be based on price paid of the reference bid item k under VCG Bidding Mechanism and with reference to bid item
Winning probability, pass through following second formula determine auction virtual resource auctioneer price paid.
It should be noted that in above-mentioned second formula (2),For auctioner payment price,To refer to bid item k
Price paid under VCG Bidding Mechanism, bn'kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and in optical fiber chain
Road consumes the price of designated capabilities bandwidth,It submits a tender for bidder n' with reference to the winning probability of the integer type of bid item k,
It submits a tender for bidder n' with reference to the winning probability of the fractional-type of bid item k.
In addition, distributing equipment can not only determine the price paid of the auctioneer of auction virtual resource through the above way,
It can also determine by other means.For example, distributing equipment can be by price of the reference bid item k under VCG Bidding Mechanism
Lattice obtain probability price multiplied by winning probability, by the price of the probability price and reference bid item k under VCG Bidding Mechanism
Lattice are added, and obtain the price paid of the auctioneer of auction virtual resource.
Further, in order to clearly state the allocation efficiency of resource of the embodiment of the present application, distributing equipment can also be shown
Show competition of the competition than datagram (referring to Fig. 3, vertically displayed reference axis indicates the variation of contention rate in figure), capacity accounting
Than comparison diagram (referring to fig. 4, ordinate indicates the variation of contention rate, and abscissa indicates the variation of number of bidders purpose) and offline
(referring to Fig. 5, ordinate indicates the variation of social welfare size to the optimal social welfare comparison diagram with online optimal solution of integer, horizontal
Coordinate representation number of bidders purpose variation).
Wherein, it is generally the case that since operator can only submit a tender resource from the subset of base station and optical fiber link,
It assume that each mobile operator at most from h1Frequency spectrum resource is requested in a base station, and links most h2The band of a optical fiber link
It is wide.Maximum atomic spectrum and bandwidth demand can be set at this time.
For example, settingrmaxFor maximum atomic spectrum, dmaxFor bandwidth demand.At this point,
Enable RminAnd DminRespectively indicate minm∈[M]RmAnd mini∈[I]D, and determine by following third formula the capacity ratio of frequency spectrum resource
Rate determines bandwidth ratio by following 4th formula.
Wherein, h1With h2Sum for indicating the maximum sum of base station that operator can submit a tender and link, C1And C2In
Minimum value for indicating total capacity ratio, RminAnd DminIn minimum value for indicating least resource capacity.
Step 204: distributing equipment distributes corresponding virtual resource to target bidder.
Wherein, after distributing equipment determines target bidder, corresponding virtual resource can be distributed to target bidder.By
It is above-mentioned it is found that distributing equipment can determine resource distribution mode during determining target bidder, therefore, distributing equipment exists
When distributing corresponding virtual resource to target bidder, target bidder can be distributed according to determining resource distribution mode empty
Quasi- resource.
In the embodiment of the present application, distributing equipment can determine the bid letter of multiple bidder of request virtual resource
Breath;Mesh is obtained from multiple bidder by resource auction theory based on the bid information of each bidder in multiple bidder
Bidder is marked, then distributes virtual resource to target bidder.Since resource auction theory is description social welfare maximization
Auction mechanism is exactly to make social welfare maximization by the target bidder that resource auction theory is determined from multiple bidder
Bidder, to ensure that resource utilization.Meanwhile as long as the bidder for needing to obtain virtual resource has the opportunity to throw
Mark ensure that a possibility that any bidder obtains virtual resource, realize the shared across base station of resource.
After resource allocation methods provided in an embodiment of the present invention are explained, next, to of the invention real
The resource allocation device for applying example offer is introduced.
Fig. 6 is a kind of block diagram for resource allocation device that the embodiment of the present disclosure provides, and referring to Fig. 6, which can be by soft
Part, hardware or both are implemented in combination with.The device comprises determining that module 601, obtains module 602 and distribution module 603.
Determining module 601, the bid information of multiple bidder for determining request virtual resource;
Module 602 is obtained to auction for the bid information based on each bidder in the multiple bidder by resource
Model obtains target bidder from the multiple bidder, and the target bidder is the bid for making social welfare maximization
Person, the resource auction theory are the auction mechanism for describing social welfare maximization;
Distribution module 603, for distributing corresponding virtual resource to the target bidder.
Optionally, the bid information includes K bid item, each bidder that each bidder is submitted a tender
The tender price and each submitted a tender resource of bid item submitted a tender to each bid item in the K bid item, it is described
K is greater than or equal to 1;
Referring to Fig. 7, the acquisition module 602 includes:
First determines submodule 6021, for being based on each bidder to each bid item in the K bid item
The tender price submitted a tender determines from the K bid item by the resource auction theory and refers to bid item;
Second determines submodule 6022, for referring to bid item based on described, determines corresponding with reference to bid item to described
The reference resources capacity of bidder's distribution virtual resource;
First triggering submodule 6023, for bid item will to be referred to when the reference resources capacity meets distributive condition
Corresponding bid result is set as 1, the bid knot of other bid items in the K bid item in addition to the item with reference to bid
Fruit is set as 0, and updates resource distribution mode, triggers described first and determines that submodule is based on each bidder to the K
The tender price that each bid item is submitted a tender in a bid item determines ginseng by resource auction theory from the K bid item
Bid item is examined, until the number for executing above-mentioned steps reaches the first preset times;
Third determines submodule 6024, and the reference bid item for that will include in updated resource distribution mode is corresponding
Bidder is determined as the target bidder.
Optionally, described first determine that submodule 6021 is used for:
The tender price of each bid item based on each bidder claps model by the resource and determines the K
The winning probability of a bid item;
When the winning probability is score, it is general that the winning probability is determined as integer by way of rounding up
Rate;
Based on the integer probability of each bid item, determined from the K bid item described with reference to bid item.
Optionally, the bid information includes K bid item, each bidder that each bidder is submitted a tender
The price and each submitted a tender resource of bid item, the K submitted a tender to each bid item in the K bid item are big
In or equal to 1;
Referring to Fig. 8, the acquisition module 602 includes:
Submodule 6025 is set, the feasible bid item in K bid item for each bidder to be submitted a tender
Tender price is set as 1, and the tender price of infeasible bid item is set as 0, and the feasible bid item is in the K bid item
Meet the bid item of bidding condition, the infeasible bid item is the throwing that the bidding condition is not met in the K bid item
Mark item;
4th determines submodule 6026, for bid price corresponding to each bid item based on each bidder
Lattice determine from the K bid item by the resource auction theory and refer to bid item and corresponding winning probability;
5th determines submodule 6027, for determining that the reference man throws based on the winning probability with reference to bid item
Mark price paid of the item under VCG Bidding Mechanism;
Second triggering submodule 6028, for updating resource distribution mode according to price paid, and returning will be described each
The tender price for the feasible bid item in K bid item that bidder is submitted a tender is set as 1, the tender price of infeasible bid item
It is set as 0 operation, until the number for executing above-mentioned steps reaches the second preset times;
6th determines that submodule 6029, the reference bid item for that will include in updated resource distribution mode are corresponding
Bidder is determined as the target bidder.
Optionally, the described 5th determine that submodule 6027 is used for:
Based on the winning probability with reference to bid item, determine the reference bid item in VCG by following first formula
Price paid under Bidding Mechanism;
Wherein, describedIt is described for the price paid with reference to bid item k under VCG Bidding MechanismFor
The solution set of first formula, the x are any one feasible solution in the feasible solution set of first formula, and the N is
Be able to carry out the quantity of the bidder of bid, the s (n) be from 0 to T duration in bidder's set for submitting a tender, the b is
The price of bid, the n' are any bidder in the s (n), and the k is any bid item in the K bid item,
The bn',kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and consumes designated capabilities bandwidth on optical fiber link
Price, it is describedThe winning probability submitted a tender for bidder n'.
Optionally, referring to Fig. 9, the acquisition module 602 further include:
7th determines submodule 60210, for the price paid based on reference man's bid item under VCG Bidding Mechanism
With the winning probability with reference to bid item, the payment for auctioning the auctioneer of the virtual resource is determined by following second formula
Price;
Wherein, describedIt is described for the price of auctioner paymentIt bids machine with reference to bid item k in VCG to be described
Price paid under system, the bn'kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and is disappeared on optical fiber link
The price of designated capabilities bandwidth is consumed, it is describedIt submits a tender the winning probability of the integer type with reference to bid item k for bidder n',
It is describedIt submits a tender the winning probability of the fractional-type with reference to bid item k for bidder n'.
Optionally, referring to Figure 10, described device further include:
Processing module 604, for the bid information based on the multiple bidder, by the bat of the social welfare maximization
It sells mechanism to be handled by way of integral linear programming, obtains following resource auction theory;
Wherein, the N is the quantity for being able to carry out the bidder of bid, the n be it is described it is N number of in any bidder,
The number for the bid item that the K is submitted a tender by each bidder, the k are any bid item in a bid item, and the M is base station
Quantity, the m are any base station in the M base station, and the I is the quantity of optical fiber link, and the i is the I optical fiber
Either fiber link in link, the bn,kFrequency spectrum resource r is consumed on base station for bidder nn,k,mAnd on optical fiber link i
Consume bandwidth dn,k,iWhen price, the xn,kFor bidder n bid as a result, the rn,k,mDisappear on the m of base station for bidder
The frequency spectrum resource of consumption, the RmFor the frequency spectrum resource total amount of base station m, the dn,k,iIt is consumed on optical fiber link i for bidder n
Bandwidth, the DiFor the bandwidth capacity of optical fiber link i.
Optionally, referring to Figure 11, described device further include:
Optimization module 605, for zooming in and out optimization to the resource auction theory, the resource after being optimized as follows is clapped
Sell model;
Wherein, the N is the quantity for being able to carry out the bidder of bid, the n be it is described it is N number of in any bidder,
The number for the bid item that the K is submitted a tender by each bidder, the k are any bid item in a bid item, and the M is base station
Quantity, the m are any base station in the M base station, and the I is the quantity of optical fiber link, and the i is the I optical fiber
Either fiber link in link, the bn,kFrequency spectrum resource r is consumed on base station for bidder nn,k,mAnd on optical fiber link i
Consume bandwidth dn,k,iWhen price, the xn,kFor bidder n bid as a result, the rn,k,mDisappear on the m of base station for bidder
The frequency spectrum resource of consumption, the RmFor the frequency spectrum resource total amount of base station m, the dn,k,iIt is consumed on optical fiber link i for bidder n
Bandwidth, the DiFor the bandwidth capacity of optical fiber link i, the f is zoom factor, and the S is to be thrown until current time
Target bidder set.
In conclusion in the embodiment of the present application, distributing equipment can determine multiple bids of request virtual resource
The bid information of person;Based on the bid information of each bidder in multiple bidder, by resource auction theory, from multiple bids
Target bidder is obtained in person, then distributes virtual resource to target bidder.Since resource auction theory is to describe social good fortune
The maximized auction mechanism of benefit, is exactly to make social good fortune by the target bidder that resource auction theory is determined from multiple bidder
The maximized bidder of benefit, to ensure that resource utilization.Meanwhile as long as the bidder for needing to obtain virtual resource has
Chance is submitted a tender, and ensure that a possibility that any bidder obtains virtual resource, realizes the shared across base station of resource.
It should be understood that resource allocation device provided by the above embodiment is when distributing resource, only with above-mentioned each function
The division progress of module can according to need and for example, in practical application by above-mentioned function distribution by different function moulds
Block is completed, i.e., the internal structure of device is divided into different functional modules, to complete all or part of function described above
Energy.In addition, resource allocation device provided by the above embodiment and resource allocation methods embodiment belong to same design, it is specific real
Existing process is detailed in embodiment of the method, and which is not described herein again.
Figure 12 shows the structural block diagram of the distributing equipment 1200 of one exemplary embodiment of the application offer.The distribution is set
Standby 1200 can be any server in server cluster or server cluster.Distributing equipment 1200 is also possible to referred to as user
Other titles such as equipment, portable terminal, laptop terminal, terminal console.
In general, distributing equipment 1200 includes: processor 1201 and memory 1202.
Processor 1201 may include one or more processing cores, such as 4 core processors, 8 core processors etc..Place
Reason device 1201 can use DSP (Digital Signal Processing, Digital Signal Processing), FPGA (Field-
Programmable Gate Array, field programmable gate array), PLA (Programmable Logic Array, may be programmed
Logic array) at least one of example, in hardware realize.Processor 1201 also may include primary processor and coprocessor, master
Processor is the processor for being handled data in the awake state, also referred to as CPU (Central Processing
Unit, central processing unit);Coprocessor is the low power processor for being handled data in the standby state.?
In some embodiments, processor 1201 can be integrated with GPU (Graphics Processing Unit, image processor),
GPU is used to be responsible for the rendering and drafting of content to be shown needed for display screen.In some embodiments, processor 1201 can also be wrapped
AI (Artificial Intelligence, artificial intelligence) processor is included, the AI processor is for handling related machine learning
Calculating operation.
Memory 1202 may include one or more computer readable storage mediums, which can
To be non-transient.Memory 1202 may also include high-speed random access memory and nonvolatile memory, such as one
Or multiple disk storage equipments, flash memory device.In some embodiments, the non-transient computer in memory 1202 can
Storage medium is read for storing at least one instruction, at least one instruction performed by processor 1201 for realizing this Shen
Please in embodiment of the method provide resource allocation methods.
In some embodiments, distributing equipment 1200 is also optional includes: peripheral device interface 1203 and at least one outside
Peripheral equipment.It can be connected by bus or signal wire between processor 1201, memory 1202 and peripheral device interface 1203.Respectively
A peripheral equipment can be connected by bus, signal wire or circuit board with peripheral device interface 1203.Specifically, peripheral equipment packet
It includes: radio circuit 1204, touch display screen 1205, camera 1206, voicefrequency circuit 1207, positioning component 1208 and power supply 1209
At least one of.
Peripheral device interface 1203 can be used for I/O (Input/Output, input/output) is relevant outside at least one
Peripheral equipment is connected to processor 1201 and memory 1202.In some embodiments, processor 1201, memory 1202 and periphery
Equipment interface 1203 is integrated on same chip or circuit board;In some other embodiments, processor 1201, memory
1202 and peripheral device interface 1203 in any one or two can be realized on individual chip or circuit board, this implementation
Example is not limited this.
Radio circuit 1204 is for receiving and emitting RF (Radio Frequency, radio frequency) signal, also referred to as electromagnetic signal.
Radio circuit 1204 is communicated by electromagnetic signal with communication network and other communication equipments.Radio circuit 1204 is by telecommunications
Number being converted to electromagnetic signal is sent, alternatively, the electromagnetic signal received is converted to electric signal.Optionally, radio circuit
1204 include: antenna system, RF transceiver, one or more amplifiers, tuner, oscillator, digital signal processor, volume solution
Code chipset, user identity module card etc..Radio circuit 1204 can by least one wireless communication protocol come with it is other
Terminal is communicated.The wireless communication protocol includes but is not limited to: Metropolitan Area Network (MAN), each third generation mobile communication network (2G, 3G, 4G and
5G), WLAN and/or WiFi (Wireless Fidelity, Wireless Fidelity) network.In some embodiments, radio frequency electrical
Road 1204 can also include NFC (Near Field Communication, wireless near field communication) related circuit, the application
This is not limited.
Display screen 1205 is for showing UI (User Interface, user interface).The UI may include figure, text,
Icon, video and its their any combination.When display screen 1205 is touch display screen, display screen 1205 also there is acquisition to exist
The ability of the touch signal on the surface or surface of display screen 1205.The touch signal can be used as control signal and be input to place
Reason device 1201 is handled.At this point, display screen 1205 can be also used for providing virtual push button and/or dummy keyboard, it is also referred to as soft to press
Button and/or soft keyboard.In some embodiments, display screen 1205 can be one, and the front panel of distributing equipment 1200 is arranged;?
In other embodiments, display screen 1205 can be at least two, be separately positioned on the different surfaces of distributing equipment 1200 or be in
Foldover design;In still other embodiments, display screen 1205 can be flexible display screen, and the bending of distributing equipment 1200 is arranged in
On surface or on fold plane.Even, display screen 1205 can also be arranged to non-rectangle irregular figure, namely abnormity screen.It is aobvious
Display screen 1205 can use LCD (Liquid Crystal Display, liquid crystal display), OLED (Organic Light-
Emitting Diode, Organic Light Emitting Diode) etc. materials preparation.
CCD camera assembly 1206 is for acquiring image or video.Optionally, CCD camera assembly 1206 includes front camera
And rear camera.In general, the front panel of terminal is arranged in front camera, the back side of terminal is arranged in rear camera.?
In some embodiments, rear camera at least two is that main camera, depth of field camera, wide-angle camera, focal length are taken the photograph respectively
As any one in head, to realize that main camera and the fusion of depth of field camera realize background blurring function, main camera and wide
Pan-shot and VR (Virtual Reality, virtual reality) shooting function or other fusions are realized in camera fusion in angle
Shooting function.In some embodiments, CCD camera assembly 1206 can also include flash lamp.Flash lamp can be monochromatic temperature flash of light
Lamp is also possible to double-colored temperature flash lamp.Double-colored temperature flash lamp refers to the combination of warm light flash lamp and cold light flash lamp, can be used for
Light compensation under different-colour.
Voicefrequency circuit 1207 may include microphone and loudspeaker.Microphone is used to acquire the sound wave of user and environment, and
It converts sound waves into electric signal and is input to processor 1201 and handled, or be input to radio circuit 1204 to realize that voice is logical
Letter.For stereo acquisition or the purpose of noise reduction, microphone can be separately positioned on the different portions of distributing equipment 1200 to be multiple
Position.Microphone can also be array microphone or omnidirectional's acquisition type microphone.Loudspeaker be then used for will from processor 1201 or
The electric signal of radio circuit 1204 is converted to sound wave.Loudspeaker can be traditional wafer speaker, be also possible to piezoelectric ceramics
Loudspeaker.When loudspeaker is piezoelectric ceramic loudspeaker, the audible sound wave of the mankind can be not only converted electrical signals to, it can also
To convert electrical signals to the sound wave that the mankind do not hear to carry out the purposes such as ranging.In some embodiments, voicefrequency circuit 1207
It can also include earphone jack.
Positioning component 1208 is used to position the current geographic position of distributing equipment 1200, to realize navigation or LBS
(Location Based Service, location based service).Positioning component 1208 can be the GPS based on the U.S.
The dipper system of (Global Positioning System, global positioning system), China, the Gray of Russia receive this system
Or the positioning component of the Galileo system of European Union.
Power supply 1209 is used to be powered for the various components in distributing equipment 1200.Power supply 1209 can be alternating current,
Direct current, disposable battery or rechargeable battery.When power supply 1209 includes rechargeable battery, which can be supported
Wired charging or wireless charging.The rechargeable battery can be also used for supporting fast charge technology.
In some embodiments, distributing equipment 1200 further includes having one or more sensors 1210.
It that is to say, the embodiment of the present application provides not only a kind of distributing equipment, including processor and is used for storage processor
The memory of executable instruction, wherein processor is configured as executing the method in Fig. 1 and embodiment shown in Fig. 2, moreover,
The embodiment of the present application also provides a kind of computer readable storage medium, it is stored with computer program in the storage medium, the meter
The resource allocation methods in Fig. 1 and embodiment shown in Fig. 2 may be implemented in calculation machine program when being executed by processor.
It will be understood by those skilled in the art that structure shown in Figure 12 does not constitute the restriction to distributing equipment 1200,
It may include perhaps combining certain components than illustrating more or fewer components or being arranged using different components.
Those of ordinary skill in the art will appreciate that realizing that all or part of the steps of above-described embodiment can pass through hardware
It completes, relevant hardware can also be instructed to complete by program, the program can store in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only memory, disk or CD etc..
The foregoing is merely the preferred embodiments of the application, not to limit the application, it is all in spirit herein and
Within principle, any modification, equivalent replacement, improvement and so on be should be included within the scope of protection of this application.
Claims (10)
1. a kind of resource allocation methods, which is characterized in that the described method includes:
Determine the bid information of multiple bidder of request virtual resource;
Based on the bid information of each bidder in the multiple bidder, by resource auction theory, from the multiple bid
Target bidder is obtained in person, the target bidder is the bidder for making social welfare maximization, the resource auction theory
For the auction mechanism for describing social welfare maximization;
Corresponding virtual resource is distributed to the target bidder.
2. the method as described in claim 1, which is characterized in that the bid information includes that each bidder is submitted a tender
Tender price that K bid item, each bidder submit a tender to each bid item in the K bid item and described
Each submitted a tender resource of bid item, the K are greater than or equal to 1;
The bid information based on each bidder in the multiple bidder, by resource auction theory, from the multiple
Target bidder is obtained in bidder, comprising:
Based on the tender price that each bidder submits a tender to each bid item in the K bid item, pass through the money
Source auction theory determines from the K bid item and refers to bid item;
Bid item is referred to based on described, is determined to the reference resources for distributing virtual resource with reference to the corresponding bidder of bid item
Capacity;
When the reference resources capacity meets distributive condition, it will be set as 1 with reference to the corresponding bid result of bid item, the K
The bid result of other bid items in a bid item in addition to the item with reference to bid is set as 0, and updates resource allocation side
Formula is returned to the tender price submitted a tender based on each bidder to each bid item in the K bid item, passed through
Resource auction theory determines the operation for referring to bid item from the K bid item, until the number for executing above-mentioned steps reaches
First preset times;
The corresponding bidder of reference bid item for including in updated resource distribution mode is determined as the target bidder.
3. method according to claim 2, which is characterized in that described to be based on each bidder to the K bid item
In the tender price submitted a tender of each bid item determined from the K bid item by resource auction theory with reference to submitting a tender
, comprising:
The tender price of each bid item based on each bidder claps model by the resource and determines the K throwing
Mark the winning probability of item;
When the winning probability is score, the winning probability is determined as integer probability by way of rounding up;
Based on the integer probability of each bid item, determined from the K bid item described with reference to bid item.
4. the method as described in claim 1, which is characterized in that the bid information includes that each bidder is submitted a tender
Price that K bid item, each bidder submit a tender to each bid item in the K bid item and described each
The submitted a tender resource of bid item, the K are greater than or equal to 1;
The bid information based on each bidder in the multiple bidder, by resource auction theory, from the multiple
Target bidder is obtained in bidder, comprising:
1 is set by the tender price of the feasible bid item in K bid item that each bidder is submitted a tender, infeasible throwing
The tender price of mark item is set as 0, and the feasible bid item is the bid item for meeting bidding condition in the K bid item, institute
Stating infeasible bid item is the bid item that the bidding condition is not met in the K bid item;
Tender price corresponding to each bid item based on each bidder, by the resource auction theory, from institute
It states in K bid item and determines with reference to bid item and corresponding winning probability;
Based on the winning probability with reference to bid item, price of the reference man's bid item under VCG Bidding Mechanism is determined
Lattice;
Resource distribution mode is updated according to price paid, and is returned in the K bid item that each bidder is submitted a tender
The tender price of feasible bid item is set as 1, and the tender price of infeasible bid item is set as 0 operation, until executing above-mentioned
The number of step reaches the second preset times;
The corresponding bidder of reference bid item for including in updated resource distribution mode is determined as the target bidder.
5. method as claimed in claim 4, which is characterized in that it is described based on the winning probability with reference to bid item, it determines
Price paid of the reference man's bid item under VCG Bidding Mechanism, comprising:
Based on the winning probability with reference to bid item, determine that the reference bid item is bidded in VCG by following first formula
Price paid under mechanism;
Wherein, describedIt is described for the price paid with reference to bid item k under VCG Bidding MechanismIt is described
The solution set of first formula, the x are any one feasible solution in the feasible solution set of first formula, and the N is can
The quantity of the bidder to submit a tender, the s (n) be from 0 to T duration in submit a tender bidder set, the b be submit a tender
Price, the n' be the s (n) in any bidder, the k be the K bid item in any bid item, it is described
bn',kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and consumes the valence of designated capabilities bandwidth on optical fiber link
Lattice, it is describedThe winning probability submitted a tender for bidder n'.
6. method a method as claimed in any one of claims 1 to 5, which is characterized in that described general based on the triumph with reference to bid item
Rate determines reference man's bid item after the price paid under VCG Bidding Mechanism, further includes:
Based on price paid of the reference man's bid item under VCG Bidding Mechanism and the winning probability with reference to bid item,
The price paid for auctioning the auctioneer of the virtual resource is determined by following second formula;
Wherein, describedIt is described for the price of auctioner paymentIt is the reference bid item k under VCG Bidding Mechanism
Price paid, the bn'kDesignated capabilities frequency spectrum resource is consumed on base station for bidder n' and is consumed on optical fiber link and is referred to
The price of constant volume bandwidth, it is describedIt submits a tender the winning probability of the integer type with reference to bid item k for bidder n', it is describedIt submits a tender the winning probability of the fractional-type with reference to bid item k for bidder n'.
7. the method as described in claim 1, which is characterized in that the throwing based on each bidder in the multiple bidder
Information is marked, through resource auction theory, before obtaining target bidder in the multiple bidder, further includes:
Based on the bid information of the multiple bidder, the auction mechanism of the social welfare maximization is advised by integer linear
The mode drawn is handled, and following resource auction theory is obtained;
subjectto:
Wherein, the N is the quantity for being able to carry out the bidder of bid, the n be it is described it is N number of in any bidder, the K
By the number for the bid item that each bidder submits a tender, the k is any bid item in a bid item, and the M is base station number,
The m is any base station in the M base station, and the I is the quantity of optical fiber link, and the i is in the I optical fiber link
Either fiber link, the bn,kFrequency spectrum resource r is consumed on base station for bidder nn,k,mAnd band is consumed on optical fiber link i
Wide dn,k,iWhen price, the xn,kFor bidder n bid as a result, the rn,k,mThe frequency consumed on the m of base station for bidder
Spectrum resource, the RmFor the frequency spectrum resource total amount of base station m, the dn,k,iFor the bandwidth that bidder n is consumed on optical fiber link i,
The DiFor the bandwidth capacity of optical fiber link i.
8. the method for claim 7, which is characterized in that the bid information based on the multiple bidder, by institute
State social welfare maximization auction mechanism handled by way of integral linear programming after, further includes:
Optimization is zoomed in and out to the resource auction theory, the resource auction theory after being optimized as follows;
subjectto:
Wherein, the N is the quantity for being able to carry out the bidder of bid, the n be it is described it is N number of in any bidder, the K
By the number for the bid item that each bidder submits a tender, the k is any bid item in a bid item, and the M is base station number,
The m is any base station in the M base station, and the I is the quantity of optical fiber link, and the i is in the I optical fiber link
Either fiber link, the bn,kFrequency spectrum resource r is consumed on base station for bidder nn,k,mAnd band is consumed on optical fiber link i
Wide dn,k,iWhen price, the xn,kFor bidder n bid as a result, the rn,k,mThe frequency consumed on the m of base station for bidder
Spectrum resource, the RmFor the frequency spectrum resource total amount of base station m, the dn,k,iFor the bandwidth that bidder n is consumed on optical fiber link i,
The DiFor the bandwidth capacity of optical fiber link i, the f is zoom factor, and the S is the throwing submitted a tender until current time
Mark person set.
9. a kind of resource allocation device, which is characterized in that described device includes:
Determining module, the bid information of multiple bidder for determining request virtual resource;
Module is obtained, for the bid information based on each bidder in the multiple bidder, by resource auction theory, from
Target bidder is obtained in the multiple bidder, the target bidder is the bidder for making social welfare maximization, described
Resource auction theory is the auction mechanism for describing social welfare maximization;
Distribution module, for distributing corresponding virtual resource to the target bidder.
10. a kind of computer readable storage medium, computer program, the computer program quilt are stored in the storage medium
Method described in the claims 1-8 any claim is realized when processor executes.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910359159.5A CN110020926A (en) | 2019-04-30 | 2019-04-30 | Resource allocation methods, device and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910359159.5A CN110020926A (en) | 2019-04-30 | 2019-04-30 | Resource allocation methods, device and storage medium |
Publications (1)
Publication Number | Publication Date |
---|---|
CN110020926A true CN110020926A (en) | 2019-07-16 |
Family
ID=67192888
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910359159.5A Pending CN110020926A (en) | 2019-04-30 | 2019-04-30 | Resource allocation methods, device and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110020926A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110996396A (en) * | 2019-12-06 | 2020-04-10 | 成都龙腾中远信息技术有限公司 | Mobile edge network resource allocation method based on online combined auction |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106651553A (en) * | 2017-01-23 | 2017-05-10 | 武汉万般上品信息技术有限公司 | Cloud container service-based batch processing auction mechanism |
CN106845718A (en) * | 2017-01-23 | 2017-06-13 | 武汉万般上品信息技术有限公司 | A kind of efficient cloud market elasticity time limit computing resource auction mechanism |
US20180063235A1 (en) * | 2016-08-28 | 2018-03-01 | Vmware, Inc. | Automated resource-price calibration and recalibration by an automated resource-exchange system |
CN108182112A (en) * | 2017-11-22 | 2018-06-19 | 南京航空航天大学 | The resource allocation mechanism of sensing network focusing on people based on combinational auction |
-
2019
- 2019-04-30 CN CN201910359159.5A patent/CN110020926A/en active Pending
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20180063235A1 (en) * | 2016-08-28 | 2018-03-01 | Vmware, Inc. | Automated resource-price calibration and recalibration by an automated resource-exchange system |
CN106651553A (en) * | 2017-01-23 | 2017-05-10 | 武汉万般上品信息技术有限公司 | Cloud container service-based batch processing auction mechanism |
CN106845718A (en) * | 2017-01-23 | 2017-06-13 | 武汉万般上品信息技术有限公司 | A kind of efficient cloud market elasticity time limit computing resource auction mechanism |
CN108182112A (en) * | 2017-11-22 | 2018-06-19 | 南京航空航天大学 | The resource allocation mechanism of sensing network focusing on people based on combinational auction |
Non-Patent Citations (1)
Title |
---|
张骥先 等: "一种支持云计算虚拟资源分配的可信多需求拍卖机制", 《电子与信息学报》 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110996396A (en) * | 2019-12-06 | 2020-04-10 | 成都龙腾中远信息技术有限公司 | Mobile edge network resource allocation method based on online combined auction |
CN110996396B (en) * | 2019-12-06 | 2023-02-03 | 成都工业学院 | Mobile edge network resource allocation method based on online combined auction |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109740068A (en) | Media data recommended method, device and storage medium | |
US20140351074A1 (en) | System and method for managing auction data | |
CN109962939A (en) | Position recommended method, device, server, terminal and storage medium | |
CN112862516A (en) | Resource delivery method and device, electronic equipment and storage medium | |
CN112491964B (en) | Mobile assisted edge calculation method, apparatus, medium, and device | |
CN105210143A (en) | Augmented reality auction platform | |
CN109284445A (en) | Recommended method, device, server and the storage medium of Internet resources | |
CN110162393B (en) | Task scheduling method, device and storage medium | |
CN109040193B (en) | Mobile device cloud resource allocation method based on independent subtasks | |
CN106506607A (en) | Cloud computing resources distribution method based on fair credible two way auction mechanism | |
CN110020926A (en) | Resource allocation methods, device and storage medium | |
CN105657716B (en) | A kind of spectrum auction method that Cellular Networks dynamic flow is shared | |
CN109977120A (en) | Resource information methods of exhibiting, device and storage medium | |
CN107911823B (en) | Multi-channel anti-policy manipulated spectrum allocation method | |
Cao et al. | An incentive-based mechanism for location estimation in wireless sensor networks | |
CN116185731A (en) | Terminal test system and method based on blockchain network and electronic equipment | |
CN110490295B (en) | Data processing method and processing device | |
CN109413190A (en) | File acquisition method, device, electronic equipment and storage medium | |
US20100223148A1 (en) | Method and System for an Electronic Marketplace for Information Products | |
CN111062709B (en) | Resource transfer mode recommendation method and device, electronic equipment and storage medium | |
Varian | Designing the perfect auction | |
CN110163513B (en) | Method, device and storage medium for distributing position-aware tasks | |
CN115545593A (en) | Target distribution service determination method, device, equipment and storage medium | |
JP6667054B1 (en) | System and method for sequencing or combining multiple related but different transaction requests into a single transaction | |
CN112036850A (en) | Digital asset data access method and device and digital asset transaction system |
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: 20190716 |
|
RJ01 | Rejection of invention patent application after publication |