Skip to main content
Log in

Truthful mechanism design for bin packing with applications on cloud computing

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper, we study a mechanism design for the bin packing problem, which can model a reversed auction on cloud computing. A cloud computing platform has a set of jobs and would like to rent VM instances to process these jobs from cloud providers. In the auction model, each cloud provider (agent) who owns VM instances will submit a bid on the costs for using such VM instances. The mechanism determines the number of VM instances from each agent, and payments that have to be paid for using the chosen VM instances. The utility of an agent is the payment received minus the true cost. Our proposed mechanism is a deterministic truthful mechanism that the utility of each agent is maximized by revealing the true cost. Next, we provide the analysis of the approximation ratios, and then run experiments using both realistic workload and uniformly random data to show the performance of the proposed mechanisms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Archer A (2004) Mechanisms for discrete optimization with rational agents. Ph.D. thesis, Cornell University

  • Archer A, Tardos E (2001) Truthful mechanisms for one-parameter agents. In: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science. IEEE Computer Society, pp 482–491

  • Bansal N, Elias M, Khan A (2016) Improved approximation for vector bin packing. In: Proceedings of the 27th annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM, pp 1561–1579

  • Briest P, Krysta P, Vöcking B (2011) Approximation techniques for utilitarian mechanism design. SIAM J Comput 40(6):1587–1622

    Article  MathSciNet  Google Scholar 

  • Chekuri C, Gamzu I (2009) Truthful mechanisms via greedy iterative packing. In: Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Springer, pp 56–69

  • Chekuri C, Khanna S (2004) On multidimensional packing problems. SIAM J Comput 33(4):837–851

    Article  MathSciNet  Google Scholar 

  • Coffman EG Jr, Csirik J, Galambos G, Martello S, Vigo D (2013) Bin packing approximation algorithms: survey and classification. In: Handbook of combinatorial optimization. Springer, pp 455–531

  • de La Vega WF, Lueker GS (1981) Bin packing can be solved within 1+ \(\varepsilon \) in linear time. Combinatorica 1(4):349–355

    Article  MathSciNet  Google Scholar 

  • Epstein L, Levin A (2008) An aptas for generalized cost variable-sized bin packing. SIAM J Comput 38(1):411–428

    Article  MathSciNet  Google Scholar 

  • Friesen DK, Langston MA (1986) Variable sized bin packing. SIAM J Comput 15(1):222–230

    Article  Google Scholar 

  • Gabay M, Zaourar S (2015) Vector bin packing with heterogeneous bins: application to the machine reassignment problem. Ann Oper Res 242:161–194

    Article  MathSciNet  Google Scholar 

  • Johnson DS (2016) Vector bin packing. In: Encyclopedia of algorithms, pp 2319–2323

  • Kang J, Park S (2003) Algorithms for the variable sized bin packing problem. Eur J Oper Res 147(2):365–372

    Article  MathSciNet  Google Scholar 

  • Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin

    Book  Google Scholar 

  • Mashayekhy L, Nejad MM, Grosu D (2015a) Physical machine resource management in clouds: a mechanism design approach. IEEE Trans Cloud Comput 3(3):247–260

    Article  Google Scholar 

  • Mashayekhy L, Nejad MM, Grosu D (2015b) A ptas mechanism for provisioning and allocation of heterogeneous cloud resources. IEEE Trans Parallel Distrib Syst 26(9):2386–2399

    Article  Google Scholar 

  • Mu’Alem A, Nisan N (2008) Truthful approximation mechanisms for restricted combinatorial auctions. Games Econ Behav 64(2):612–631

    Article  MathSciNet  Google Scholar 

  • Murgolo FD (1988) Anomalous behavior in bin packing algorithms. Discrete Appl Math 21(3):229–243

    Article  MathSciNet  Google Scholar 

  • Nejad MM, Mashayekhy L, Grosu D (2013) A family of truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. In: IEEE CLOUD, pp 188–195

  • Nisan N, Ronen A (2007) Computationally feasible VCG mechanisms. J Artif Intell Res (JAIR) 29:19–47

    Article  MathSciNet  Google Scholar 

  • Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic game theory, vol 1. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Reiss C, Wilkes J, Hellerstein JL (2011) Google cluster-usage traces: format + schema. Technical report, Google Inc., Mountain View, CA, USA, Nov 2011. Revised 2012.03.20. Posted at http://code.google.com/p/googleclusterdata/wiki/TraceVersion2

  • Reiss C, Katz RH, Kozuch MA (2012) Towards understanding heterogeneous clouds at scale: Google trace analysis. ISTC-CC-TR-12-101, Carnegie Mellon University

  • Stillwell M, Schanzenbach D, Vivien F, Casanova H (2010) Resource allocation algorithms for virtualized service hosting platforms. J Parallel Distrib Comput 70(9):962–974

    Article  Google Scholar 

  • Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Finance 16(1):8–37

    Article  MathSciNet  Google Scholar 

  • Woeginger GJ (1997) There is no asymptotic ptas for two-dimensional vector packing. Inf Process Lett 64(6):293–297

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deshi Ye.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supported in part by NSFC (U1866602, 11671355, 11531014).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ye, D., Xie, F. & Zhang, G. Truthful mechanism design for bin packing with applications on cloud computing. J Comb Optim 44, 2224–2245 (2022). https://doi.org/10.1007/s10878-020-00601-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-020-00601-4

Keywords

Navigation