Double Auction used Artificial Neural Network in Cloud Computing
Keywords:
Cloud Computing, Double Auction, Artificial Neural Network, Regression Problem, Supervised Machine LearningAbstract
Double auction (DA) algorithm is widely used for trading systems in cloud computing. Distinct buyers request different attributes for virtual machines. On the other hand, different sellers offer several types of virtual machines according to their correspondence bids. In DA, getting multiple equilibrium prices from distinct cloud providers is a difficult task, and one of the major problems is bidding prices for virtual machines, so we cannot make decisions with inconsistent data. To solve this problem, we need to find the best machine learning algorithm that anticipates the bid cost for virtual machines. Analyzing the performance of DA algorithm with machine learning algorithms is to predict the bidding price for both buyers and sellers. Therefore, we have implemented several machine learning algorithms and observed their performance on the bases of accuracy, such as linear regression (83%), decision tree regressor (77%), random forest (82%), gradient boosting (81%), and support vector regressor (90%). In the end, we observed that the Artificial Neural Network (ANN) provided an astonishing result. ANN has provided 97% accuracy in predicting bidding prices in DA compared to all other learning algorithms. It reduced the wastage of resources (VMs attributes) and soared both users' profits (buyers & sellers). Different types of models were analyzed on the bases of individual parameters such as accuracy. In the end, we found that ANN is effective and valuable for bidding prices for both users.
References
I. A. T. Hashem, I. Yaqoob, N. B. Anuar, S. Mokhtar, A. Gani, and S. Ullah Khan, “The rise of ‘big data’ on cloud computing: Review and open research issues,” Inf. Syst., vol. 47, pp. 98–115, Jan. 2015, doi: 10.1016/J.IS.2014.07.006.
A. Youssef, A. Almishal, and A. E. Youssef, “Cloud Service Providers: A Comparative Study,” www.ijcait.com Int. J. Comput. Appl. Inf. Technol., vol. 5, no. April, pp. 2278–7720, 2014, [Online]. Available: https://www.researchgate.net/publication/299551297.
P. Samimi, Y. Teimouri, and M. Mukhtar, “A combinatorial double auction resource allocation model in cloud computing,” Inf. Sci. (Ny)., vol. 357, pp. 201–216, Aug. 2016, doi: 10.1016/J.INS.2014.02.008.
S. A. Tafsiri and S. Yousefi, “Combinatorial double auction-based resource allocation mechanism in cloud computing market,” J. Syst. Softw., vol. 137, pp. 322–334, Mar. 2018, doi: 10.1016/J.JSS.2017.11.044.
P. Hummel and R. Preston McAfee, “Machine learning in an auction environment,” J. Mach. Learn. Res., vol. 17, pp. 1–37, 2016.
A. Darmann, U. Pferschy, and J. Schauer, “Resource allocation with time intervals,” Theor. Comput. Sci., vol. 411, no. 49, pp. 4217–4234, 2010, doi: 10.1016/j.tcs.2010.08.028.
J. Zhang, N. Xie, X. Zhang, K. Yue, W. Li, and D. Kumar, “Machine learning based resource allocation of cloud computing in auction,” Comput. Mater. Contin., vol. 56, no. 1, pp. 123–135, 2018, doi: 10.3970/cmc.2018.03728.
V. L. Smith, “An Experimental Study of Competitive Market Behavior,” https://doi.org/10.1086/258609, vol. 70, no. 2, pp. 111–137, Oct. 2015, doi: 10.1086/258609.
M. Van Otterlo and M. Wiering, “Reinforcement learning and markov decision processes,” Adapt. Learn. Optim., vol. 12, pp. 3–42, 2012, doi: 10.1007/978-3-642-27645-3_1/COVER/.
S. Li, W. Zhang, J. Lian, and K. Kalsi, “Market-Based Coordination of Thermostatically Controlled Loads - Part I: A Mechanism Design Formulation,” IEEE Trans. Power Syst., vol. 31, no. 2, pp. 1170–1178, Mar. 2016, doi: 10.1109/TPWRS.2015.2432057.
L. Li, Y. Li, and R. Li, “Double Auction-Based Two-Level Resource Allocation Mechanism for Computation Offloading in Mobile Blockchain Application,” Mob. Inf. Syst., vol. 2021, 2021, doi: 10.1155/2021/8821583.
M. H. Degroot, “Reaching a consensus,” J. Am. Stat. Assoc., vol. 69, no. 345, pp. 118–121, 1974, doi: 10.1080/01621459.1974.10480137.
H. Dawid, “On the convergence of genetic learning in a double auction market,” J. Econ. Dyn. Control, vol. 23, no. 9–10, pp. 1545–1567, Sep. 1999, doi: 10.1016/S0165-1889(98)00083-9.
Y. Zeng, “Research on Social Talent Governance Based on Genetic Algorithm,” Sci. Program., vol. 2021, 2021, doi: 10.1155/2021/6288679.
Q. Yu, Y. Liu, D. Xia, and L. Martinez, “The Strategy Evolution in Double Auction Based on the Experience-Weighted Attraction Learning Model,” IEEE Access, vol. 7, pp. 16730–16738, 2019, doi: 10.1109/ACCESS.2019.2895875.
S. Verwer, Y. Zhang, and Q. C. Ye, “Auction optimization using regression trees and linear models as integer programs,” Artif. Intell., vol. 244, pp. 368–395, Mar. 2017, doi: 10.1016/J.ARTINT.2015.05.004.
H. Xu, H. Sun, D. Nikovski, S. Kitamura, K. Mori, and H. Hashimoto, “Deep Reinforcement Learning for Joint Bidding and Pricing of Load Serving Entity,” IEEE Trans. Smart Grid, vol. 10, no. 6, pp. 6366–6375, Nov. 2019, doi: 10.1109/TSG.2019.2903756.
X. Sui and H. F. Leung, “A Q-learning based adaptive bidding strategy in combinatorial auctions,” ACM Int. Conf. Proceeding Ser., pp. 186–194, 2009, doi: 10.1145/1593254.1593283.
J. Song and R. Guerin, “Pricing and bidding strategies for cloud computing spot instances,” 2017 IEEE Conf. Comput. Commun. Work. INFOCOM WKSHPS 2017, pp. 647–653, Nov. 2017, doi: 10.1109/INFCOMW.2017.8116453.
D. Minarolli and B. Freisleben, “Utility-based resource allocation for virtual machines in cloud computing,” Proc. - IEEE Symp. Comput. Commun., pp. 410–417, 2011, doi: 10.1109/ISCC.2011.5983872.
R. N. Calheiros, R. Ranjan, C. A. F. De Rose, and R. Buyya, “CloudSim: A Novel Framework for Modeling and Simulation of Cloud Computing Infrastructures and Services,” pp. 1–9, 2009, [Online]. Available: http://arxiv.org/abs/0903.2525.
W. S. Noble, “What is a support vector machine?,” Nat. Biotechnol., vol. 24, no. 12, pp. 1565–1567, Dec. 2006, doi: 10.1038/NBT1206-1565.
M. R. Segal, “Machine Learning Benchmarks and Random Forest Regression,” Biostatistics, no. May 2003, pp. 1–14, 2004, [Online]. Available: http://escholarship.org/uc/item/35x3v9t4.pdf.
G. K. F. Tso and K. K. W. Yau, “Predicting electricity energy consumption: A comparison of regression analysis, decision tree and neural networks,” Energy, vol. 32, no. 9, pp. 1761–1768, Sep. 2007, doi: 10.1016/J.ENERGY.2006.11.010.
A. Natekin and A. Knoll, “Gradient boosting machines, a tutorial,” Front. Neurorobot., vol. 7, no. DEC, p. 21, 2013, doi: 10.3389/FNBOT.2013.00021/BIBTEX.
S.-C. Wang, “Artificial Neural Network,” Interdiscip. Comput. Java Program., pp. 81–100, 2003, doi: 10.1007/978-1-4615-0377-4_5.
T. B Arnold, “kerasR: R Interface to the Keras Deep Learning Library,” J. Open Source Softw., vol. 2, no. 14, p. 296, 2017, doi: 10.21105/joss.00296.
S. Gopal, K. Patro, and K. Kumar Sahu, “Normalization: A Preprocessing Stage,” IARJSET, pp. 20–22, Mar. 2015, doi: 10.48550/arxiv.1503.06462.
C. J. Willmott and K. Matsuura, “Advantages of the mean absolute error (MAE) over the root mean square error (RMSE) in assessing average model performance,” Clim. Res., vol. 30, no. 1, pp. 79–82, Dec. 2005, doi: 10.3354/CR030079.
S. Tosi, “Matplotlib for Python Developers,” Packt Publ., p. 308, 2009, Accessed: Jul. 09, 2022. [Online]. Available: http://www.amazon.com/Matplotlib-Python-Developers-Sandro-Tosi/dp/1847197906.
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 50SEA
This work is licensed under a Creative Commons Attribution 4.0 International License.
