A Real-Time Group Auction System for Efficient Allocation of Cloud Internet Applications
A Real-Time Group Auction System for Efficient Allocation of Cloud Internet Applications
复制标题
DOI：
10.1109/tsc.2013.24
复制
发表时间：
2013-04
影响因子：
8.1
通讯作者：
Chonho Lee;Ping Wang;D. Niyato
中科院分区：
文献类型：
--
作者：
Chonho Lee;Ping Wang;D. Niyato
越来越多的基于云的互联网应用导致了对高效资源和成本管理的需求。提出了一种面向云实例市场的实时群拍卖系统。该系统是基于组合双向拍卖设计的，其适用性和有效性是根据拍卖参与者的资源效率和货币收益来评估的（例如，云用户和提供商）。拟议中的拍卖系统帮助他们决定供应商何时以及如何分配资源以及分配给哪些用户。此外，我们提出了一个分布式算法，使用一个组形成游戏，确定哪些用户和供应商将交易资源，他们的合作决定。为了找到如何分配资源，效用优化问题被制定为一个二进制整数规划问题，并通过具有二次时间复杂度的启发式算法获得的近最优解。在比较研究中，所提出的合作实时群组拍卖系统在资源效率方面优于单独拍卖（例如，用户的请求接受率和提供商的资源利用率）和货币收益（例如，用户的平均支付和提供商的总利润）。
The increasing number of cloud-based Internet applications has led to the demand for efficient resource and cost management. This paper proposes a real-time group auction system for the cloud instance market. The system is designed based on a combinatorial double auction, and its applicability and effectiveness are evaluated in terms of resource efficiency and monetary benefits to auction participants (e.g., cloud users and providers). The proposed auction system helps them decide when and how providers will allocate their resources and to which users. Furthermore, we propose a distributed algorithm using a group formation game that determines which users and providers will trade resources by their cooperative decisions. To find how to allocate the resources, the utility optimization problem is formulated as a binary integer programming problem and the nearly optimal solution is obtained by a heuristic algorithm with quadratic time complexity. In comparison studies, the proposed real-time group auction system with cooperation outperforms an individual auction in terms of the resource efficiency (e.g., the request acceptance rate for users and resource utilization for providers) and monetary benefits (e.g., average payments for users and total profits for providers).