Auction‐Based Resource Allocation

Schnizler, Björn

doi:10.1002/9780470455432.ch22

Cited by 6 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section we compare the proposed scheme with combinatorial auctions using the open-source combinatorial auctions simulator jCase [16]. We select for comparison the pure VCG and the Threshold algorithms proposed by Parkes et al [13].…”

Section: Comparison With Combinatorial Auctionsmentioning

confidence: 99%

A Strategy-proof Pricing Scheme for Multiple Resource Type Allocations

Teo

Mihailescu

2009

2009 International Conference on Parallel Processing

View full text Add to dashboard Cite

Resource sharing on the Internet is becoming increasingly pervasive. Recently, there is growing interest in distributed systems such as peer-to-peer and grid, with efforts being directed towards resource allocation strategies that incentivize users to share resources. While combinatorial auctions can perform multiple resource type allocations, it is computationally a NPcomplete problem. Thus, allocation in large distributed resource sharing systems focuses mainly on a single resource type. We propose a strategy-proof, VCG-based resource pricing scheme for resource allocation in dynamic markets where users behave rationally in meeting their own interest. Our mechanism is designed to meet the needs of large distributed systems, delivering the following key properties: multiple resource type allocations, individual rationality, incentive compatibility for both buyers and sellers, budget balance and computational efficiency. Simulation evaluation of our prototype based on a centralized implementation demonstrates the viability of our approach, as compared to both traditional and combinatorial auctions.

show abstract

Section: Comparison With Combinatorial Auctionsmentioning

confidence: 99%

A Strategy-proof Pricing Scheme for Multiple Resource Type Allocations

Teo

Mihailescu

2009

2009 International Conference on Parallel Processing

View full text Add to dashboard Cite

show abstract

Parallel Continuous Double Auction for Service Allocation in Cloud Computing

Farajian¹,

pour-komleh

2015

ComEngApp

View full text Add to dashboard Cite

Cloud Computing is a service oriented architecture in which every computing resources is delivered to users as a service. Nowadays market-oriented approach has attracted a lot of researchers because of its great ability to manage Cloud services efficiently and dynamically. Each service consists of various resources which all should be allocated to utilize the service. In this paper a parallel continuous double auction method for efficient service allocation in cloud computing is presented in which by using a novel parallel sorting algorithm at auctioneer, enables consumers to order various resources as workflow for utilizing requested services efficiently. Also in the presented method consumers and providers make bid and offer prices based on time factor. Experimental results show that proposed method is efficient in success rate, resource utilization and average connection time and also overall performance of system is improved by parallel approach.

show abstract

An Enhanced Job Scheduling in Cloud Environment Using Probability Distribution

Kowsigan¹,

Kalicharan²,

P³

et al. 2017

IJET

View full text Add to dashboard Cite

Abstract-Today's world is an information technology's era in that cloud computing arises as promising and developing technology. In the surroundings of cloud computing the resources are provisioned on the basis of demand, as and when required. A giant number of clients (uses cloud) in computation of cloud, can request a number of services or cloud services at the very same time The users demand to access resources are increasing now-a-days, due to this demand it becomes very hard in cloud for allocation of cloud resources accurately and efficiently to the customers, that should satisfy requirements of customers or users and preserve the SLA (service level agreement). Cloud faces many challenges as it is evolving gradually, one of them is scheduling. Here, we contemplate job scheduling, in accordance to the type, of the mission is and varying situation. To efficiently increase the allocating of resource in cloud, one of the foremost job performed is job scheduling, so to get highest profit. Here, we apply, one among of the effective algorithm, first-in-first-out (FIFO), along with markov process technique to prevent blocking probability.

show abstract

Auction‐Based Resource Allocation

Cited by 6 publications

References 18 publications

A Strategy-proof Pricing Scheme for Multiple Resource Type Allocations

A Strategy-proof Pricing Scheme for Multiple Resource Type Allocations

Parallel Continuous Double Auction for Service Allocation in Cloud Computing

An Enhanced Job Scheduling in Cloud Environment Using Probability Distribution

Contact Info

Product

Resources

About