Projects
Efficient and secure computation in cloud computing systems
Franciszek Seredyński (Institute of Computer Science) sered >at> ipipan.waw.pl
Description: Cloud computing (CC) (Buyya et al., 2009), a natural extension of grid computing is a new concept of distributed computing, which has emerged recently. It assumes that customers do not own or rent any computational infrastructure but they simply use available resources and pay for what they use. The potential platforms - solutions of CC concept will base on two classes of computational resources:
The purpose of the research topic is to develop a generic model and build environment of secured and trusted distributed computing in CC environment characterized by fault-tolerance phenomena of computational infrastructure. The work will be focused on secure and robust load balancing and scheduling algorithms which fulfill not only optimization criteria, like e.g. a minimal computational time but also provide confidentiality of data and programs, authentication of users and resources, resistance to attacks and malicious behavior of other actors of CC and take into account trust management criteria (Święcicka et al., 2006), (Szaban and Seredyński, 2010), (Ostaszewski et al., 2007). To build computational models and design secure and effective algorithms solving NP-hard nature problems a set of nature inspired paradigms will be used. This will include cellular automata, artificial immune networks, evolutionary algorithms, etc. Also computational frameworks and tools like game theory and multi-objective optimization will be useful.
- private or public computing clusters,
- desktop workstations present in companies or universities, which are known to be idle around 50% of the time.
The purpose of the research topic is to develop a generic model and build environment of secured and trusted distributed computing in CC environment characterized by fault-tolerance phenomena of computational infrastructure. The work will be focused on secure and robust load balancing and scheduling algorithms which fulfill not only optimization criteria, like e.g. a minimal computational time but also provide confidentiality of data and programs, authentication of users and resources, resistance to attacks and malicious behavior of other actors of CC and take into account trust management criteria (Święcicka et al., 2006), (Szaban and Seredyński, 2010), (Ostaszewski et al., 2007). To build computational models and design secure and effective algorithms solving NP-hard nature problems a set of nature inspired paradigms will be used. This will include cellular automata, artificial immune networks, evolutionary algorithms, etc. Also computational frameworks and tools like game theory and multi-objective optimization will be useful.