Using Polymatrix Extensive Stackelberg Games in Security – Aware Resource Allocation and Task Scheduling in Computational Clouds

• Autorzy: Jakóbik A. , Wilczyński A.
• Języki publikacji: EN

Abstrakty

EN

In this paper, the Stackelberg game models are used for supporting the decisions on task scheduling and resource utilization in computational clouds. Stackelberg games are asymmetric games, where a specific group of players’ acts first as leaders, and the rest of the players follow the leaders’ decisions and make their decisions based on the leader’s actions. In the proposed model, the optimal schedules are generated under the security criteria along with the generation of the optimal virtual machines set for the scheduled batch of tasks. The security criteria are defined as security requirements for mapping tasks onto virtual machines with specified trust level. The effectiveness of the proposed method has been verified in the realistic use cases with in the cloud environment with OpenStack and Amazon Cloud standards.

Słowa kluczowe

EN

cloud computing; resource optimization; Stackelberg equilibrium; Stackelberg games

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2017
• Tom: nr 1
• Strony: 71--80
• Opis fizyczny: Bibliogr. 20 poz., rys., tab.

Twórcy

autor

Jakóbik A.

• Faculty of Physics, Mathematics and Computer Science Tadeusz Ko±ciuszko Cracow University of Technology Warszawska st 24 31-155 Cracow, Poland

autor

Wilczyński A.

• AGH University of Science and Technology Mickiewicza st 30 30-059 Cracow, Poland
• Tadeusz Kościuszko Cracow University of Technology Warszawska st 24 31-155 Cracow, Poland

Bibliografia

• [1] A. Ananth and K. Chandra Sekaran, “Game theoretic approaches for job scheduling in cloud computing: A survey”, in Proc. 5th Int. Conf. on Comp. & Commun. Technol. ICCCT 2014, Allahabad, India, 2014 (doi: 10.1109/ICCCT.2014.7001473).
• [2] A. Jakóbik, D. Grzonka, J. Kołodziej, and H. Gonzalez-Velez, “Towards secure non-deterministic meta-scheduling for clouds”, in Proc. 30th Eur. Conf. on Modell. and Simul. ECMS 2016, Regensburg, Germany, 2016, pp. 596–602 (doi: 10.7148/2016-0596).
• [3] K. Xiong, Resource Optimization and Security for Cloud Services. Wiley, 2014.
• [4] “Security and Privacy Controls for Federal Information Systems and Organizations”, SP 800-53 Rev. 4, National Institute of Standards & Technology, 2013 (doi: 10.6028/NIST.SP.800-53r4).
• [5] “NIST Cloud Computing Security Reference Architecture”, SP 500299, National Institute of Standards & Technology, 2013.
• [6] ISO/IEC 19790:2012 “Security requirements for cryptographic modules”, International Organization for Standardization, 2012.
• [7] ISO/IEC 19790:2012 “Information technology, Security techniques, Security requirements for cryptographic modules”, ISO Council, Switzerland, Geneva.
• [8] A. Jakóbik, “A cloud-aided group RSA scheme in Java 8 environment and OpenStack software”, J. Telecommun. and Inform. Technol., no. 2 pp. 53–59, 2016.
• [9] A. Jakóbik, D. Grzonka, and F. Palmieri, “Non-deterministic security driven meta scheduler for distributed cloud organizations”, Simul. Modell. Practice & Theory, 2016 [Online]. Available: http://dx.doi.org/10.1016/j.simpat.2016.10.011.
• [10] A. Ananth and K. Chandrasekaran, “Cooperative game theoretic approach for job scheduling in cloud computing”, in Proc. Int. Conf. on Comput. and Netw. Commun. CoCoNet’15, Trivandrum, India, 2015 (doi: 10.1109/CoCoNet.2015.7411180).
• [11] M. Geethanjali, J. Sujana, and T. Revathi, “Ensuring truthfulness for scheduling multi-objective real time tasks in multi cloud environments”, in Proc. Int. Conf. on Recent Trends in Inform. Technology ICRTIT 2014, Chennai, India, 2014 (doi: 10.1109/ICRTIT.2014.6996183).
• [12] X. Qiu, C. Wu, H. Li, Z. Li, and F. C. M. Lau, “Federated private clouds via broker’s marketplace: A Stackelberg-game perspective”, in Proc. 7th IEEE Int. Conf. on Cloud Comput. CLOUD 2014, Anchorage, Alaska, USA, 2014 (doi: 10.1109/CLOUD.2014.48).
• [13] M. Shie, C. Liu, Y. Lee, Y. Lin, and K. Lai, “Distributed scheduling approach based on game theory in the federated cloud”, in Proc. Int. Conf. on Inform. Science & Appl. ICISA 2014, Seoul, South Korea, 2014 (doi: 10.1109/ICISA.2014.6847388)
• [14] S. Tadelis, Game Theory: An Introduction. Princeton University Press, 2013.
• [15] A. Wilczyński, A. Jakóbik, and J. Kołodziej, “Stackelberg security games: Models, applications and computational aspects”, J. Telecommun. and Inform. Technol., no. 3, pp. 70–79, 2016.
• [16] V. Mazalov, Mathematical Game Theory and Applications. Wiley, 2014.
• [17] J. Kołodziej, Evolutionary Hierarchical Multi-Criteria Metaheuristics for Scheduling in Large-Scale Grid Systems. Springer, 2012.
• [18] J. Gan and B. An, “Minimum support size of the defender’s strong Stackelberg equilibrium strategies in security games”, in AAAI Spring Symp. on Applied Computat. Game Theory, Stanford, CA, USA, 2014 [Online]. Available: http://www.ntu.edu.sg/home/boan/papers/AAAISS14b.pdf
• [19] A. Mas-Colell, M. D. Whinston, and J. R. Green, Microeconomic Theory. Oxford University Press, 1995.
• [20] MathWorks, Documentation [Online]. Available: https://www.mathworks.com/help/optim/ug/linprog.html

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).