Approximate Algorithms for Double Combinatorial Auctions for Resource Allocation in Clouds: An Empirical Comparison

Diana Gudu, Gabriel Zachmann, Marcus Hardt, Achim Streit

Abstract

There is an increasing trend towards market-driven resource allocation in cloud computing, which can address customer requirements for flexibility, fine-grained allocation, as well as improve provider revenues. We formulate the cloud resource allocation as a double combinatorial auction. However, combinatorial auctions are NP-hard problems. Determining the allocation optimally is thus intractable in most cases. Various heuristics have been proposed, but their performance and quality of the obtained solutions are highly dependent on the input. In this paper, we perform an extensive empirical comparison of several approximate allocation algorithms for double combinatorial auctions. We discuss their performance, economic efficiency, and the reasons behind the observed variations in approximation quality. Finally, we show that there is no clear winner: no algorithm outperforms the others in all test scenarios. Furthermore, we introduce a novel artificial input generator for combinatorial auctions which uses parameterized random distributions for bundle sizes, resource type selection inside a bundle, and the bid values and reserve prices. We showcase its flexibility, required for thorough benchmark design, through a wide range of test cases.

Download


Paper Citation


in Harvard Style

Gudu D., Zachmann G., Hardt M. and Streit A. (2018). Approximate Algorithms for Double Combinatorial Auctions for Resource Allocation in Clouds: An Empirical Comparison.In Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-275-2, pages 58-69. DOI: 10.5220/0006593900580069


in Bibtex Style

@conference{icaart18,
author={Diana Gudu and Gabriel Zachmann and Marcus Hardt and Achim Streit},
title={Approximate Algorithms for Double Combinatorial Auctions for Resource Allocation in Clouds: An Empirical Comparison},
booktitle={Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2018},
pages={58-69},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006593900580069},
isbn={978-989-758-275-2},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Approximate Algorithms for Double Combinatorial Auctions for Resource Allocation in Clouds: An Empirical Comparison
SN - 978-989-758-275-2
AU - Gudu D.
AU - Zachmann G.
AU - Hardt M.
AU - Streit A.
PY - 2018
SP - 58
EP - 69
DO - 10.5220/0006593900580069