A truthful (1-ε)-optimal mechanism for on-demand cloud resource provisioning

Proceedings - IEEE INFOCOM

Volumn 26, Issue , 2015, Pages 1053-1061

  Zhang, Xiaoxi ^a   Wu, Chuan ^a   Li, Zongpeng ^b   Lau, Francis C M ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; ECONOMICS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; RESOURCE ALLOCATION;

AUCTION MECHANISMS; DISTRIBUTED CLOUDS; NOVEL APPLICATIONS; ON-DEMAND RESOURCE PROVISIONING; RANDOMIZED REDUCTIONS; RESOURCE ALLOCATION SCHEMES; SOCIAL WELFARE MAXIMIZATION; TRACE DRIVEN SIMULATION;

DYNAMICS;

EID: 84954230850     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2015.7218478     Document Type: Conference Paper

References (28)

1. "Amazon EC2 Instance Types," http://aws. amazon. com/ec2/instancetypes/.
2. "Recommended Memory Configurations for the MapReduce Service," https://ambari. apache. org/1. 2. 0/installing-hadoop-usingambari/ content/ambari-chap3-7-9a. html.
3. P. Barham, B. Dragovic, K. Fraser, S. Hand, T. Harris, A. Ho, R. Neugebauer, I. Pratt, and A. Warfield, "Xen and the Art of Virtualization," in Proc. of ACM SOSP, 2003.
4. "Amazon EC2 Spot Instances," http://aws. amazon. com/ec2/spotinstances/.
5. Q. Wang, K. Ren, and X. Meng, "When Cloud Meets eBay: Towards Effective Pricing for Cloud Computing," in Proc. of IEEE INFOCOM, 2012.
6. W. Wang, B. Liang, and B. Li, "Revenue Maximization with Dynamic Auctions in IaaS Cloud Markets," in Proc. of IEEE/ACM IWQoS, 2013.
7. S. Zaman and D. Grosu, "Combinatorial Auction-Based Dynamic VM Provisioning and Allocation in Clouds," in Proc. of IEEE CloudCom, 2011.
8. -, "Combinatorial Auction-based Allocation of Virtual Machine Instances in Clouds," Journal of Parallel and Distributed Computing, vol. 73, no. 4, pp. 495-508, 2013.
9. H. Zhang, B. Li, H. Jiang, F. Liu, A. V. Vasilakos, and J. Liu, "A Framework for Truthful Online Auctions in Cloud Computing with Heterogeneous User Demands," in Proc. of IEEE INFOCOM, 2013.
10. W. Vickrey, "Counterspeculation Auctions and Competitive Sealed Tenders," The Journal of Finance, vol. 16, no. 1, pp. 8-37, 1961.
11. A. Mu'alem and N. Nisan, "Truthful Approximation Mechanisms for Restricted Combinatorial Auctions," Games and Economic Behavior, vol. 64, no. 2, pp. 612-631, 2008.
12. D. Lehmann, L. I. Ocallaghan, and Y. Shoham, "Truth revelation in approximately efficient combinatorial auctions," Journal of the ACM, vol. 49, no. 5, pp. 577-602, 2002.
13. R. Lavi and C. Swamy, "Truthful and near-optimal mechanism design via linear programming," in Proc. of IEEE FOCS, 2005, pp. 595-604.
14. L. Zhang, Z. Li, and C. Wu, "Dynamic Resource Provisioning in Cloud Computing: A Randomized Auction Approach," in Proc. of IEEE INFOCOM, 2014.
15. W. Shi, L. Zhang, C. Wu, Z. Li, and F. C. M. Lau, "An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing," in Proc. of ACM SIGMETRICS, 2014.
16. D. Spielman and S.-H. Teng, "Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time," in Proc. of ACM STOC, 2001.
17. G. Gens and E. Levner, "Complexity of Approximation Algorithms for Combinatorial Problems: A Survey," ACM SIGACT News, vol. 12, no. 3, pp. 52-65, 1980.
18. A. Beloglazov, J. Abawajy, and R. Buyya, "Energy-Aware Resource Allocation Heuristics for Efficient Management of Data Centers for Cloud Computing," Future Generation Computer Systems, vol. 28, no. 5, pp. 755-768, 2012.
19. M. Alicherry and T. V. Lakshman, "Network Aware Resource Allocation in Distributed Clouds," in Proc. of IEEE INFOCOM, 2012.
20. C. Joe-Wong, S. Sen, T. Lan, and M. Chiang, "Multi-Resource Allocation: Fairness-Efficiency Tradeoffs in a Unifying Framework," in Proc. of IEEE INFOCOM, 2012.
21. H. Röglin and S.-H. Teng, "Smoothed Analysis of Multiobjective Optimization," in Proc. of IEEE FOCS, 2009.
22. D. Arthur and S. Vassilvitskii, "Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method," in Proc. of IEEE FOCS, 2006.
23. X. Chen, X. Deng, and S.-H. Teng, "Computing Nash Equilibria: Approximation and Smoothed Complexity," in Proc. of IEEE FOCS, 2006.
24. S. Dughmi and T. Roughgarden, "Black-Box Randomized Reductions in Algorithmic Mechanism Design," in Proc. of IEEE FOCS, 2010.
25. "A Truthful Near-Optimal Mechanism for Ondemand Cloud Resource Provisioning," Tech. Rep., https://www. dropbox. com/s/58ngejldyblqeu6/TechReport. pdf 2014.
26. S. Dobzinski and S. Dughmi, "On the Power of Randomization in Algorithmic Mechanism Design," in Proc. of IEEE FOCS, 2009.
27. G. L. Nemhauser and Z. Ullmann, "Discrete Dynamic Pprogramming and Capital Allocation," Management Science, vol. 15, no. 9, pp. 494-505, 1969.
28. C. Reiss, J. Wilkes, and J. L. Hellerstein, "Google cluster-usage traces: format + schema," Google Inc., Mountain View, CA, USA, Technical Report, Nov. 2011, revised 2012. 03. 20. Posted at URL http://code. google. com/p/googleclusterdata/wiki/TraceVersion2.