TAF PUBLISHING

Cloud computing systems are large-scale distributed systems so that they focus more on large-scale resource sharing, cooperation of several organizations, and their use in new applications. One of the main challenges in this realm is resource allocation. There are many different ways of resource allocation in cloud computing. One of the common methods of resource allocation is economic methods. Among these methods, the auctionbased method has greater prominence compared with the Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. This method includes two phases: winner determination and resource allocation. This paper presents a new method to determine the winner in double combinatorial auctionbased resource allocation using the Imperialist Competitive Algorithm (ICA). The experimental results show that the number of winner users is higher than the genetic algorithm in our new proposed method. On the other hand, in the proposed algorithm, the number of winner providers is higher in the genetic algorithm.