Combinatorial double auction-based resource allocation mechanism in cloud computing market

Tafsiri, Seyedeh Aso; Yousefi, Saleh

doi:10.1016/j.jss.2017.11.044

Cited by 53 publications

(34 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tafsiri and Yousefi [68 ] provided a combinatorial double auction‐based and an integer linear programming optimisation model for the market. The model improves the total profit of users and providers compared to Grosu's mechanism [53 ].…”

Section: Reviewing Existing Ra Mechanismsmentioning

confidence: 99%

Resource allocation mechanisms in cloud computing: a systematic literature review

et al. 2020

View full text Add to dashboard Cite

Cloud computing offers a vast number of processing opportunities and heterogeneous resources and meets the requirements of numerous applications at various levels. Thus, the allocation and management of resources are vital in cloud computing. Resource allocation is a technique in which the available resources such as central processing unit, random‐access memory, storage, and network bandwidth in cloud data centres are divided among users in a way that facilitates resource utilisation, provider profit, and user satisfaction. Integration and interaction with other modules of the resource management system, security, privacy, fairness, non‐fragmentation of resources, resource utilisation, provider profit, user satisfaction, reducing energy consumption, load balancing, flexibility, scalability, availability, improvement the number and time of virtual machine migrations, and the number of overloaded resources are considered as challenges for the resource allocation mechanism. A systematic resource allocation survey with innovations in resource management system architecture, categorising mechanisms, addressing the challenges, and issues is presented. In addition to introducing the existing resource allocation mechanisms, other similar survey papers have been reviewed. Finally, there are some suggested topics for future work.

show abstract

Section: Reviewing Existing Ra Mechanismsmentioning

confidence: 99%

Resource allocation mechanisms in cloud computing: a systematic literature review

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Moreover, the providers' workloads and amount of resources are changed over time. Therefore, in such cases ensuring the profit of providers and the satisfaction of user's Quality of Service (QoS) requirements are the main issues, which should be considered [5,6]. To satisfy the customers of CC, QoS plays an important role by providing better services to the end users [7].…”

Section: Introductionmentioning

confidence: 99%

An efficient Task Scheduling and Load Balancing in Cloud Computing using KD-Tree Algorithm

S P*,

D’Mello

2019

IJITEE

View full text Add to dashboard Cite

Cloud Computing provides the sharing ability and access for available cloud host and various distributed environments, namely Load Balancing (LB), virtualization technologies and scheduling techniques. The satisfaction of both users and cloud providers are the major issues for effective LB and task scheduling algorithms in cloud resource management, where the requirements namely high resource utilization, low monetary costs and minimum makespan. Many researchers tried to develop various heuristic and meta-heuristic algorithms to attain the aforementioned user requirements. But, when the number of tasks grows exponentially, these algorithms failed to achieve LB, lower running time, and it faces the high time complexity. In this research work, a KD-Tree algorithm is developed to address the issues of heuristic algorithms and provide efficient LB by partitioning the environments into several tasks. According to the deadline of task execution, the remaining tasks are adjusted dynamically by the proposed KD-tree algorithm in the virtual environment. The experiments are conducted to evaluate the efficiency of KD-Tree algorithm with existing heuristic techniques by using makespan, energy consumption and task migrations. When the number of tasks is 20, the proposed KD-Tree algorithm achieved 71.33% makespan and 5% task migrations.

show abstract

“…Paper [2]proposed a market based optimal resource allocation, which comprehensively considers the utilities of users and suppliers, and proved that the combined double auction model is more suitable for the problem of cloud computing resource allocation than the fixed pricing mechanism. Paper [3]put forward a combinatorial double auction market, which improved the utilities of suppliers and users in the market and reduces the waste of resources. In the actual market, there are many problem models such as the allocation of cloud resources.…”

Section: Introductionmentioning

confidence: 99%

Truthful volume discount mechanism based on combinatorial double auction

Yang¹,

Zhu²,

Zhu³

2018

EasyChair Preprints

View full text Add to dashboard Cite

In the auction market, allocation and pricing will affect participants’ behavior, honesty, and the success of the auction. A proper mechanism will help to achieve higher utility. In a combinatorial double auction, buyers bidding for commodity combinations of different sellers solve the problem of resource allocation in the real market more efficiently. In view of the problem of allocation and pricing of resource such as cloud resource allocation and spectrum auction, this paper designs the TCD4GB mechanism based on the scene of combined double auction, which determines winners, allocates goods and calculates payments. The concept of unit difference is introduced to this paper in order to solve winner determination problem in the group-buying mechanism. The matched sellers who have the minimum cost is directly chosen to be the winning sellers in the process of selecting the winning buyers. The mechanism also calculates payment by using the unit difference of overlapping buyers and apportion it to the matching sellers through the idea of second-price in VCG mechanism. This mechanism avoids the higher utility of buyers when they report falsely. Through theoretical and simulation experiments, it is proved that the TCD4GB mechanism satisfies the economic attributes of individual rationality and budget balance.

show abstract

Combinatorial double auction-based resource allocation mechanism in cloud computing market

Cited by 53 publications

References 16 publications

Resource allocation mechanisms in cloud computing: a systematic literature review

Resource allocation mechanisms in cloud computing: a systematic literature review

An efficient Task Scheduling and Load Balancing in Cloud Computing using KD-Tree Algorithm

Truthful volume discount mechanism based on combinatorial double auction

Contact Info

Product

Resources

About