Distributed Scheduling Approach Based on Game Theory in the Federated Cloud

Abstract

The development of cloud computing brings the revolution of information technology (IT). Because the resource in any physical cloud infrastructure is finite, resource outsourcing is an important issue in cloud computing. This study proposes a distributed scheduling approach based on game theory for the resource competition problem in the federated cloud. In this study, each job consists of one or more tasks, and has specific communication behavior between tasks. The proposed approach groups tasks according to communication behavior to minimize communication overhead. In the meantime, when multiple providers access the same resources, the resourceconflict occurs. This study also tries to achieve the Nash equilibrium to improve the benefit obtained from the federated clouds. This work evaluates some benchmarks over Taiwan Uni-Cloud. Experimental results demonstrate that the cloud provider could obtain extra profits by outsourcing resources while the federated cloud has enough remaining resources.

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

“…Shie et al [13] use the game theory in their scheduling model for solving the resource competition game in the federated cloud. The Nash games are used.…”

A simple model to exploit reliable algorithms in cloud federations

“…Making the most of soft computing, particle swarm optimization (Xu et al, 2015), bee colonies (Babu and Venkata, 2013) and genetic algorithms (Wang et al, 2016;Tao et al, 2014) are used, but all those focus on the placement of VMs in single IaaS providers. Unlike last approaches, game theory (Shie et al, 2014) can also be applied to federations.…”