New Challenges in Scheduling Theory

October 21 - 27, 2012 --- Centre CNRS "La Villa Clythia", Frejus, France

Towards Secure Cloud Computing: Load Balancing Through Coalition Formation

SpeakerFranciszek Seredynski

Coauthor: Jakub Gasior

The efficiency in terms of load balancing and scheduling and security of both communication and computation processes are the key issues in cloud computing. While usually these problems are solved separately we propose an approach leading to working out “soft security” mechanisms providing both efficient and secure load balancing. The approach is based on the phenomena of self-organization in game-theoretical Spatially Generalized Prisoner’s Dilemma model defined in two dimensional cellular automata space. The main concept of self-organization applied here is based on a formation of temporal coalitions of the participants (computational nodes) of the spatial game in the iterative process of load balancing. We present a general framework of the approach and preliminary experimental results of our study.