CN106506607A - Cloud computing resources distribution method based on fair credible two way auction mechanism - Google Patents
Cloud computing resources distribution method based on fair credible two way auction mechanism Download PDFInfo
- Publication number
- CN106506607A CN106506607A CN201610910421.7A CN201610910421A CN106506607A CN 106506607 A CN106506607 A CN 106506607A CN 201610910421 A CN201610910421 A CN 201610910421A CN 106506607 A CN106506607 A CN 106506607A
- Authority
- CN
- China
- Prior art keywords
- resource
- user
- provider
- auction
- priority
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
- H04L12/141—Indication of costs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6295—Queue scheduling characterised by scheduling criteria using multiple queues, one for each individual QoS, connection, flow or priority
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of cloud computing resources distribution method of present invention based on fair credible two way auction mechanism, every supplier provides the every virtual resource unit price and quantity that oneself can be provided in a sealing fashion to auction arbitration organ, and Shi Yong the duration of virtual resource, user each user reports oneself quantity required to virtual resource to auction arbitration organ in a sealing fashion, using the valuation of duration and user to applied virtual machine；The resource requirement of resource information and reporting of user that auction arbitration organ is reported according to provider calculates its priority, respectively provider and user are sorted from high to low according to priority, it is provided trade caravan's row and Subscriber Queue, then read each user successively from Subscriber Queue to be mated with provider, two aspect factor of resource and total price is considered in coupling, complete resource allocation.It can be that cloud resource provider and user provide fair efficient auction mechanism to adopt the present invention.
Description
Technical field
The invention belongs to field of cloud computer technology, more specifically, is related to a kind of based on fair credible two way auction machine
The cloud computing resources distribution method of system.
Background technology
Global cloud computing market scale has reached 180,000,000,000 dollars within 2015, substantial amounts of enterprises and individuals tend to by
Calculate and store tasks are submitted in cloud platform and execute.So how on the premise of user fairness is taken into account, effectively by virtuality
Resource allocation is used to user so that cloud provider resource utilization and maximum revenue are one of current field of cloud calculation and grind
Study carefully emphasis.Abstract, virtual resource can dynamically be distributed to user's use by cloud provider.The resource for being provided is broadly divided into
Three classes：Hardware infrastructure is supplied to user (such as Microsoft Azure, Amazon EC2, domestic Ali as service by IAAS-
Cloud, Tengxun's cloud), software platform is supplied to user's (the such as grand cloud of the country, new billow cloud etc.) as service by PAAS-, and SAAS- will
Software is supplied to user (such as external SalesForce, 800 visitors of the country, UFSOFT etc.) as service.
Based on the resource distribution mode of IAAS, current main flow has two kinds：A kind of is traditional pricing method (Fixed
Price), i.e., user select or virtual machine needed for customization is good after, cloud provider can according to needed for price calculates user immediately expense,
Can use after user charges.On the other hand, cloud provider has the substantial amounts of resource spare time in the case of the market demand is undersaturated
Put, cloud provider is ready these resources are earned more profits more to attract the price of user to render on market in a short time
Profit, so as to another kind of resource distribution mode that has been born, i.e. auction technique (Auction based), in general, user is by clapping
The mode that sells can be significantly less than price when which adopts pricing method the price that obtains resource, so have stimulated more users
To buy resource, resource utilization is improve, Ye Nengshi clouds provider obtains more incomes.
The cloud computing resources Research of Transportation Assignment Model of auction is being currently based on, following both sides challenge is mainly being faced with, point
It is not：
(1) auction mechanism problem：The auction mechanism that presently, there are has the auction of unidirectional auction, two way auction and bidirectional combination type
Mode, unidirectional auction are mainly used in a seller, multiple buyers, Ji Yigeyun providers, but have the situation of multiple users；Double
Be mainly used in multiple sellers to multiple buyers to auction, Ji Yun providers but with user be multi-to-multi situation；Bidirectional combination type
Auction technique is used for the computation complexity for reducing resource allocation and price under two way auction, it is desirable to which cloud provider provides knockdown
Resource distribution come reduce distribute calculate when complexity.Research work in the industry is concentrated mainly on unidirectional auction and two-way at present
Combination type auction technique.But, unidirectional auction mechanism Xia Yun provider occupies resources advantage, and main purpose is to pursue cloud provider
Profit maximization, it is impossible to which fairness is embodied to user；Bidirectional combination type auction will in order to improve distribution calculation execution efficiency method requirement
Multiple resources combine and are auctioned, and reduce resource distribution flexibility ratio and auction success rate.
(2) price paid problem：Price paid determine the successful user of auction need to pay cloud provider how much.By
Then adopt auction technique, the price that user pays by inch of candle rule determining, so the price for paying needs synthesis
Consideration cloud be provider and the ambilateral interests of user.On the one hand should prevent cloud provider from arbitrarily setting price auction, another
Aspect will also prevent user's malice auction.In the example of unidirectional auction, cloud provider has grasped resources advantage, arbitrarily can determine
Valency, unfavorable to user, but user has grasped Information Superiority, in resource auction it is possible that dishonest phenomenon, such as dislike
That anticipated pushes up price, or brings down prices in league with multiple other users.This is all unfavorable for stablizing for auction marketplace, and this is also
At present most domestic cloud provider still by the way of fixed price to carry out resource allocation the reason for.
Content of the invention
It is an object of the invention to overcoming the deficiencies in the prior art, there is provided a kind of based on fair credible two way auction mechanism
Cloud computing resources distribution method, is that cloud resource provider and user provide fair efficient auction mechanism.
For achieving the above object, cloud computing resources distribution side of the present invention based on fair credible two way auction mechanism
Method, comprises the following steps：
S1：Note cloud resource provider quantity is M, and virtual resource number of types is R, and every supplier is in a sealing fashion to bat
Sell arbitration organ and the every virtual resource unit price V that oneself can be provided is providedm={ vm1,vm2,…,vmr,…,vmRAnd quantity Cm
={ cm1,cm2,…,cmr,…,cmR, and Shi Yong the duration T of virtual resourcem, wherein vmrRepresent m-th provider to r
The fixed unit price of item resource, cmrRepresent the quantity that m-th provider can be provided to r item resources, m=1,2 ..., M, r=1,
2,…,R；
S2：Note number of users be N, each user in a sealing fashion to auction arbitration organ report oneself to virtual resource
Quantity required Sn={ sn1,sn2,…,snr,…,snR, use duration tnAnd valuation b of the user to applied virtual machinen, snr
Represent quantity required of the nth user to r item resources, n=1,2 ..., N；
S3：It is preferential that the resource requirement of resource information and reporting of user that auction arbitration organ is reported according to provider calculates which
Level, is sorted according to priority from high to low to provider and user respectively, is provided trade caravan's row and Subscriber Queue；
S4：Auction arbitration organ is mated to provider and user and resource allocation, is comprised the following steps：
S4.1：Make user's sequence number i=1；
S4.2：Make provider's sequence number j=1；
S4.3：If whether j-th provider's current residual resource meets i-th user resources demand, step is entered
S4.4, otherwise enters step S4.5；
S4.4：Resource requirement according to the virtual resource unit price and i-th user of j-th provider calculates resource total price
BijIf, Bij≤bi, then the resource requirement according to i-th user from the virtual resource of j-th provider enters to i-th user
Row resource allocation, updates the remaining virtual resource of j-th provider and can use duration, calculate final price paidStep S4.6 is entered, step S4.5 is otherwise entered；
S4.5：If j is ＜ M, j=j+1 is made, it fails to match for return to step S4.3, otherwise active user, enter step
S4.6；
S4.6：If i is ＜ N, i=i+1 is made, return to step S4.2 is otherwise mated and terminated.
Cloud computing resources distribution method of the present invention based on fair credible two way auction mechanism, every supplier is with the side of sealing
Formula provides to auction arbitration organ that the every virtual resource that oneself can be provided is univalent and quantity, and virtual resource is used
Duration, when user each user reports oneself quantity required to virtual resource, uses to auction arbitration organ in a sealing fashion
Long and valuation of the user to applied virtual machine；Resource information and reporting of user that auction arbitration organ is reported according to provider
Resource requirement calculate its priority, respectively provider and user are sorted from high to low according to priority, trade caravan is provided
Row and Subscriber Queue, are then read each user successively from Subscriber Queue and are mated with provider, the consideration money in coupling
Two aspect factor of source and total price, completes resource allocation.It can be that cloud resource provider and user provide fair height to adopt the present invention
The auction mechanism of effect,
Description of the drawings
Fig. 1 is specific embodiment of the present invention based on the cloud computing resources distribution method of fair credible two way auction mechanism
Flow chart；
Fig. 2 is user and provider's matching algorithm flow chart in the present invention.
Specific embodiment
Below in conjunction with the accompanying drawings the specific embodiment of the present invention is described, so as to those skilled in the art preferably
Understand the present invention.Requiring particular attention is that, in the following description, when known function and design detailed description perhaps
When can desalinate main contents of the invention, these descriptions will be ignored here.
Embodiment
Fig. 1 is specific embodiment of the present invention based on the cloud computing resources distribution method of fair credible two way auction mechanism
Flow chart.As shown in figure 1, concrete steps of the present invention based on the cloud computing resources distribution method of fair credible two way auction mechanism
Including：
S101：Provider reports resource information：
In auction mechanism design, it is necessary first to take out rational resource model, the foundation of resource model is later stage money
Source allocation algorithm and the premise of trusted payment calculation of price.Resource model includes provider's resource information and user's request information.
For cloud resource provider, note cloud resource provider quantity is M, and virtual resource number of types is R, and per supplies
Business is answered to provide the every virtual resource unit price V that oneself can be provided in a sealing fashion to auction arbitration organm={ vm1,vm2,…,
vmr,…,vmRAnd quantity Cm={ cm1,cm2,…,cmr,…,cmR, and Shi Yong the duration T of virtual resourcem, wherein vmrTable
Show m-th provider unit price fixed to r item resources, cmrThe number that m-th provider can be provided is represented to r item resources
Amount, m=1,2 ..., M, r=1,2 ..., R.
For example certain provider provides unit price and the quantity of the virtual resource of oneself in a sealing fashion to auction arbitration organ,
Such as CPU is pressed according to 0.04 yuan of 10G/ hours, bandwidth according to 0.05 yuan of 1G/ hours, bandwidth according to 0.03 yuan of 1 core/hour, internal memory
Offered according to 0.07 yuan of 1M/ hours, and provided the maximum supported quantity of each resource such as：800 core CPU, 1600G internal memories,
500T hard-disk capacities, the bandwidth of 500M, can be 600 minutes using duration.
It can be seen that, the information that provider submits to arbitration organ in the present invention is a vector, ＜ Vm,Cm,Tm＞, do so
Advantage of the benefit Shi Ge provider on virtual resource different, the CPU use costs of some providers are low, and some bandwidth make
With low cost, such mode can fully demonstrate the differentiation of provider, be conducive to auctioning arbitration organ and selecting having most
The provider of high-quality resource is used to user；And such resource model abstract ways are more suitable for the offer of domestic main flow
Business.
S102：Reporting of user resource requirement：
For a user, number of users is remembered for N, each user reports oneself right to auction arbitration organ in a sealing fashion
The quantity required S of virtual resourcen={ sn1,sn2,…,snr,…,snR, use duration tnAnd user is to applied virtual machine
Valuation bn, snrRepresent quantity required of the nth user to r item resources, n=1,2 ..., N.
Such as user applies for that 3 core CPU, 4G internal memories, 100G hard-disc storage space, a virtual machine of the bandwidth of 5M need
A length of 10 hours during use.
S103：Provider and user's sequence：
The resource requirement of resource information and reporting of user that auction arbitration organ is reported according to provider calculates its priority,
Respectively provider and user are sorted from high to low according to priority, trade caravan's row and Subscriber Queue is provided.
Priority computing formula can be defined according to actual needs, for provider defines a money in the present embodiment
Source density parameter come judge its sequence when priority, there is provided the Resource Density parameter value of business is lower, and priority is higher.M
Resource Density parameter d of individual providermComputing formula be：
Wherein, fmIt is the two priority classes parameter of the provider for pre-setting, is generally 1.The parameter can be with people
It is that the priority to provider is controlled, such as, for the provider that history credit rating is relatively low, f can be mademLarger, otherwise
For the higher provider of history credit rating, less f can be setm.So it is prevented that some providers are by length
Time brings down prices squeezes the situation generation of other providers.
According to the computing formula of the Resource Density parameter of provider, the parameter is tended to select resource unit price and is got over
Low, provide that resource is more, can be serviced using the longer provider of duration, i.e., the lower provider of Resource Density parameter value is more
High-quality, but all of cloud provider has the opportunity to provide the virtual resource of oneself and auction to market, Resource Density parameter can be with
The monotonicity being effectively ensured when provider's resource sorts.
For a user, similarly judged using Resource Density parameter in the present embodiment its sequence when preferential
Level, except for the difference that the Resource Density parameter of user is higher, and priority is higher.Resource Density parameter d of nth usern' calculating
Formula is：
According to the computing formula of the Resource Density parameter of user, the parameter tends to select that valuation is higher, resource is needed
The amount of asking and user that is lower, using duration shorter provide service, the i.e. higher user of Resource Density parameter more high-quality.
S104：Coupling user and provider：
Auction arbitration organ is accomplished by carrying out provider and user after provider and user is ranked up, next
Coupling and resource allocation.Fig. 2 is user and provider's matching algorithm flow chart in the present invention.As shown in Fig. 2 user in the present invention
Comprise the following steps with provider matching algorithm：
S201：Make user's sequence number i=1.
S202：Make provider's sequence number j=1.
S203：Judge whether j-th provider's current residual resource meets i-th user resources demand, it is obviously desirable to sentence
The quantity of disconnected items virtual resource and the resource requirement of user whether can be met and using duration demand using duration, if completely
Foot, enters step S204, otherwise enters step S207.
S204：Computing resource total price：
Resource requirement according to the virtual resource unit price and i-th user of j-th provider calculates resource total price Bij, meter
Calculating formula is：
S205：If Bij≤bi, i.e. resource total price is less than or equal to valuation of i-th user to applied virtual machine, then
Match somebody with somebody successfully, enter step S206, otherwise enter step S207.
S206：Resources allocation simultaneously calculates final price paid：
Resource requirement according to i-th user from the virtual resource of j-th provider carries out resource point to i-th user
Match somebody with somebody, update the remaining virtual resource of j-th provider and duration, i.e. C can be usedj=Cj-Si, Tj=Tj-ti, calculate final payment
PriceIt can be seen that, this price is expected more than or equal to provider, expects less than or equal to user, is a compromise valency
Lattice.Enter step S209.
S207：Judge whether j ＜ M, if it is, entering step S208, the resource requirement of active user is otherwise described and is estimated
Value does not have any provider meet, and it fails to match, enters step S209.
S208：Make j=j+1, otherwise return to step S203.
S209：Judge whether i ＜ N, if it is, entering step S210, otherwise illustrate that all users are mated and finish, mate
Terminate.
S210：Make i=i+1, otherwise return to step S202.
According to above flow process, the present invention is to be used as final price paid using compromise price.One believable valency
It is dull that lattice mechanism first has to meet resource distribution mode, i.e., for cloud provider, resource unit price is lower, and resource is more filled
Foot, resource more can be favored by market using the longer provider of duration；For a user, less resource or application are applied for
Same asset has higher appraisal bigger in the probability that wins.Because in the present invention, there is provided between business and user and do not know
Dawn other side's quotation, both sides can be caused damage so driving up and being brought down prices, Resource Density parameter employed in the present embodiment
Monotonicity is all ready to be intended to bid according to real ensureing provider and user.Therefore, for the present invention, auction arbitration
When mating to user and provider, the price that user pays should be higher than that cloud provider fixes a price according to oneself unit for mechanism
The resource total price for calculating, could realize coupling.
A such as user requires that 2 cores, 4G internal memories, 500G hard disks, 5M bandwidth, using 1 day, are ready to pay 18 yuan.Work as premise
For business for the unit price of this few class virtual resource be 1 cores of CPU/hour be 0.03 yuan, internal memory 1G/ hours are 0.01 yuan, hard disk
50G/ hours are 0.05 yuan, and bandwidth 1M/ hour is 0.02 yuan, and cloud provider intentionally gets 0.03*2*24+ for this demand
0.01*4*24+0.05*10*24+0.02*5*24=16.8 units, less than the price that user is ready to pay, the match is successful, then most
Whole user pays provider (18+16.8)/2=17.4 units, expects less than user, simultaneously above provider's desired value.
According to above process description, the invention provides a kind of fair believable two way auction mechanism is solving cloud meter
Calculate resource allocation problem.In unidirectional auction, cloud provider has grasped resources advantage, bat that its virtual resource arbitrarily can be fixed a price
Sell, lack the consideration to user fairness, as You Duojia clouds provider participates in two way auction, system is formed in seller's market
About, embody the fairness to user, and need to introduce third party's auction arbitration organ avoid cloud resource provider with
User is directly facing the situation for causing information resources not reciprocity.And the present invention is multiple in view of avoiding for the design of auction mechanism
Cloud resource provider forms the situation of alliance, and each cloud resource provider provides oneself to auction arbitration organ in a sealing fashion
The unit price of virtual resource, quantity and duration is used, on the other hand, user also submits oneself to auction arbitration organ in a sealing fashion
Resource bid, mainly include request and appraisal to all kinds of resources.Can so make auction mechanism relatively more fair, right
May finally obtain than oneself higher expense of expection in cloud provider, and for user can also be by paying than oneself appraisal
Also low price buys the resource that oneself wants, and for whole market, more cloud providers and user can be attracted to add
Enter, reach very positive effect.And in the calculating of final price paid, propose based on user's valuation and provider
The pricing mechanism of expected resource total price makes user true close to which to the appraisal of resource to guarantee final auction price be believable
Net price value, it is to avoid dishonest phenomenon occurs in resource auction in user, such as malice are pushed up price, or in league with multiple its
His user is bringing down prices so that cloud provider and user benefit are maximized.
Although being described to illustrative specific embodiment of the invention above, in order to the technology of the art
Personnel understand the present invention, it should be apparent that the invention is not restricted to the scope of specific embodiment, the common skill to the art
For art personnel, as long as various change is in appended claim restriction and the spirit and scope of the present invention for determining, these
Change is it will be apparent that all utilize the innovation and creation of present inventive concept in the row of protection.
Claims (2)
1. a kind of cloud computing resources distribution method based on fair credible two way auction mechanism, it is characterised in that including following step
Suddenly：
S1：Note cloud resource provider quantity is M, and virtual resource number of types is R, and every supplier is secondary to auctioning in a sealing fashion
Cut out mechanism and the every virtual resource unit price V that oneself can be provided is providedm={ vm1,vm2,…,vmr,…,vmRAnd quantity Cm=
{cm1,cm2,…,cmr,…,cmR, and Shi Yong the duration T of virtual resourcem, wherein vmrRepresent m-th provider to r items
The fixed unit price of resource, cmrRepresent the quantity that m-th provider can be provided to r item resources, m=1,2 ..., M, r=1,
2,…,R；
S2：Note number of users be N, each user in a sealing fashion to auction arbitration organ report oneself demand to virtual resource
Quantity Sn={ sn1,sn2,…,snr,…,snR, use duration tnAnd valuation b of the user to applied virtual machinen, snrRepresent
Quantity required of the nth user to r item resources, n=1,2 ..., N；
S3：The resource requirement of resource information and reporting of user that auction arbitration organ is reported according to provider calculates its priority,
Respectively provider and user are sorted from high to low according to priority, trade caravan's row and Subscriber Queue is provided；
S4：Auction arbitration organ is mated to provider and user and resource allocation, is comprised the following steps：
S4.1：Make user's sequence number i=1；
S4.2：Make provider's sequence number j=1；
S4.3：If whether j-th provider's current residual resource meets i-th user resources demand, step S4.4 is entered, no
Step S4.5 is then entered；
S4.4：Resource requirement according to the virtual resource unit price and i-th user of j-th provider calculates resource total price Bij,
If Bij≤bi, then the resource requirement according to i-th user from the virtual resource of j-th provider carried out to i-th user
Resource allocation, updates the remaining virtual resource of j-th provider and can use duration, calculate final price paidStep S4.5 is otherwise entered；
S4.5：If j is ＜ M, j=j+1 is made, it fails to match for return to step S4.3, otherwise active user, enter step S4.6；
S4.6：If i is ＜ N, i=i+1, otherwise return to step S4.2, coupling is made to terminate.
2. cloud computing resources distribution method according to claim 1, it is characterised in that in step S3, there is provided Shang He
The priority of user determines that according to Resource Density parameter the Resource Density parameter of wherein provider is lower, and priority is higher, uses
The density parameter at family is higher, and priority is higher；
Resource Density parameter d of m-th providermComputing formula be：
Wherein, fmIt is the two priority classes parameter of the provider for pre-setting；
The Resource Density parameter d ' of nth usernComputing formula be：
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610910421.7A CN106506607A (en) | 2016-10-19 | 2016-10-19 | Cloud computing resources distribution method based on fair credible two way auction mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610910421.7A CN106506607A (en) | 2016-10-19 | 2016-10-19 | Cloud computing resources distribution method based on fair credible two way auction mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106506607A true CN106506607A (en) | 2017-03-15 |
Family
ID=58294077
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610910421.7A Pending CN106506607A (en) | 2016-10-19 | 2016-10-19 | Cloud computing resources distribution method based on fair credible two way auction mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106506607A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107947983A (en) * | 2017-11-24 | 2018-04-20 | 云南大学 | A kind of maximized fair allocat method of resource utilization in cloud platform |
| CN108376105A (en) * | 2018-03-26 | 2018-08-07 | 电子科技大学 | A kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness |
| CN108572875A (en) * | 2018-04-28 | 2018-09-25 | 辽宁工程技术大学 | Resource allocation methods, apparatus and system |
| CN109559024A (en) * | 2018-11-15 | 2019-04-02 | 国家电网有限公司 | Dynamic resource scheduling method under server-free architecture for power system |
| CN110996396A (en) * | 2019-12-06 | 2020-04-10 | 成都龙腾中远信息技术有限公司 | Mobile edge network resource allocation method based on online combined auction |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103824211A (en) * | 2014-02-25 | 2014-05-28 | 清华大学 | Quotation computing system and bidding method of double-way auction |
| US8788364B1 (en) * | 2009-11-18 | 2014-07-22 | Auctionomics, Inc. | System for configuration and implementation of an assignment auction or exchange |
-
2016
- 2016-10-19 CN CN201610910421.7A patent/CN106506607A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8788364B1 (en) * | 2009-11-18 | 2014-07-22 | Auctionomics, Inc. | System for configuration and implementation of an assignment auction or exchange |
| CN103824211A (en) * | 2014-02-25 | 2014-05-28 | 清华大学 | Quotation computing system and bidding method of double-way auction |
Non-Patent Citations (2)
| Title |
|---|
| 王雅娟，王先甲: "一种激励相容的多单位在线双边拍卖机制", 《管理科学学报》 * |
| 马同伟，解瑞云，廖晓飞: "云计算环境下兼顾买卖双方利益的双向拍卖资源分配算法", 《计算机应用研究》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107947983A (en) * | 2017-11-24 | 2018-04-20 | 云南大学 | A kind of maximized fair allocat method of resource utilization in cloud platform |
| CN108376105A (en) * | 2018-03-26 | 2018-08-07 | 电子科技大学 | A kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness |
| CN108376105B (en) * | 2018-03-26 | 2021-12-03 | 电子科技大学 | Radar network task allocation method based on time-effect constraint combination bilateral auction |
| CN108572875A (en) * | 2018-04-28 | 2018-09-25 | 辽宁工程技术大学 | Resource allocation methods, apparatus and system |
| CN108572875B (en) * | 2018-04-28 | 2020-09-04 | 辽宁工程技术大学 | Resource allocation method, device and system |
| CN109559024A (en) * | 2018-11-15 | 2019-04-02 | 国家电网有限公司 | Dynamic resource scheduling method under server-free architecture for power system |
| 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 |
|---|---|---|
| Leslie et al. | Resale and rent-seeking: An application to ticket markets | |
| Teich et al. | A multi-attribute e-auction mechanism for procurement: Theoretical foundations | |
| CN106506607A (en) | Cloud computing resources distribution method based on fair credible two way auction mechanism | |
| US8566211B2 (en) | System and method for a dynamic auction with package bidding | |
| US8335738B2 (en) | System and method for a hybrid clock and proxy auction | |
| Cheng | Solving a sealed-bid reverse auction problem by multiple-criterion decision-making methods | |
| US20030041002A1 (en) | Method and system for conducting an auction for electricity markets | |
| Bapna et al. | A market design for grid computing | |
| Gong et al. | Split-award contracts with investment | |
| Zhang et al. | An optimal efficient multi-attribute auction for transportation procurement with carriers having multi-unit supplies | |
| US20040167824A1 (en) | Match-and-swap marketplace | |
| US7801769B1 (en) | Computing a set of K-best solutions to an auction winner-determination problem | |
| CN107146117A (en) | Cloud computing service marketspace provider and the pricing method of user's two day market game | |
| Ding et al. | Truthful online double auctions for on-demand integrated ride-sourcing platforms | |
| US20080114661A1 (en) | Contraint satisfaction for solutions to an auction winner-determination problem | |
| Mvelase et al. | The economics of cloud computing: A review | |
| Ghasemian Koochaksaraei et al. | An efficient cloud resource exchange model based on the double auction and evolutionary game theory | |
| Bichler et al. | Software frameworks for advanced procurement auction markets | |
| Hsieh et al. | Schemes to reward winners in combinatorial double auctions based on optimization of surplus | |
| Dauer et al. | Load balancing in the smart grid: A package auction and compact bidding language | |
| Wang et al. | Design of optimal double auction mechanism with multi-objectives | |
| US9633357B2 (en) | Net utility determination based on product replacement and service plan coverage decisions | |
| Gershkov et al. | Revenue maximizing mechanisms with strategic customers and unknown demand: Name-your-own-price | |
| Bichler et al. | An analysis of design problems in combinatorial procurement auctions | |
| CN114500303A (en) | Temporary cloud resource usage charging method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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: 20170315 |
|
| RJ01 | Rejection of invention patent application after publication |