Resilient Critical Infrastructure Management using Service Oriented Architecture

Abstract—The SERSCIS project aims to support the use of interconnected systems of services in Critical Infrastructure (CI) applications. The problem of system interconnectedness is aptly demonstrated by ‘Airport Collaborative Decision Making’ (ACDM). Failure or underperformance of any of the interlinked ICT systems may compromise the ability of airports to plan their use of resources to sustain high levels of air traffic, or to provide accurate aircraft movement forecasts to the wider European air traffic management systems. The proposed solution is to introduce further SERSCIS ICT components to manage dependability and interdependency. These use semantic models of the critical infrastructure, including its ICT services, to identify faults and potential risks and to increase human awareness of them. Semantics allows information and services to be described in such a way that makes them understandable to computers. Thus when a failure (or a threat of failure) is detected, SERSCIS components can take action to manage the consequences, including changing the interdependency relationships between services. In some cases, the components will be able to take action autonomously — e.g. to manage ‘local’ issues such as the allocation of CPU time to maintain service performance, or the selection of services where there are redundant sources available. In other cases the components will alert human operators so they can take action instead. The goal of this paper is to describe a Service Oriented Architecture (SOA) that can be used to address the management of ICT components and interdependencies in critical infrastructure systems. Index Terms—resilience; QoS; SOA; critical infrastructure, SLA

SLA based cloud service composition using genetic algorithm

Cloud computing tends to provide high quality on-demand services to the users. Numerous services are evolving today. Functionally similar services are having different non-functional properties such as reliability, availability, accessibility, response time and cost. A single service is inadequate for constructing the business process. Such business process is modeled as composite service. Composite service consists of several atomic services connected by workflow patterns. Selecting services for service composition with the constraints specified in Service Level Agreement is the NP-hard problem. Such a cloud service composition problem is modeled in this paper. Genetic based cloud service composition algorithm (GCSC) is proposed. Proposed algorithm is compared with the existing genetic based cloud service composition algorithm based on average utility rate and convergence time. It is proved that the proposed algorithm provides better performance as compared to the existing cloud service composition algorithm

SLA based cloud service composition using genetic algorithm

Cloud computing tends to provide high quality on-demand services to the users. Numerous services are evolving today. Functionally similar services are having different non-functional properties such as reliability, availability, accessibility, response time and cost. A single service is inadequate for constructing the business process. Such business process is modeled as composite service. Composite service consists of several atomic services connected by workflow patterns. Selecting services for service composition with the constraints specified in Service Level Agreement is the NP-hard problem. Such a cloud service composition problem is modeled in this paper. Genetic based cloud service composition algorithm (GCSC) is proposed. Proposed algorithm is compared with the existing genetic based cloud service composition algorithm based on average utility rate and convergence time. It is proved that the proposed algorithm provides better performance as compared to the existing cloud service composition algorithm

Adaptive Dispatching of Tasks in the Cloud

The increasingly wide application of Cloud Computing enables the consolidation of tens of thousands of applications in shared infrastructures. Thus, meeting the quality of service requirements of so many diverse applications in such shared resource environments has become a real challenge, especially since the characteristics and workload of applications differ widely and may change over time. This paper presents an experimental system that can exploit a variety of online quality of service aware adaptive task allocation schemes, and three such schemes are designed and compared. These are a measurement driven algorithm that uses reinforcement learning, secondly a "sensible" allocation algorithm that assigns jobs to sub-systems that are observed to provide a lower response time, and then an algorithm that splits the job arrival stream into sub-streams at rates computed from the hosts' processing capabilities. All of these schemes are compared via measurements among themselves and with a simple round-robin scheduler, on two experimental test-beds with homogeneous and heterogeneous hosts having different processing capacities.Comment: 10 pages, 9 figure

Robust Multi-criteria Service Composition in Information Systems

Service compositions are used to implement business processes in a variety of application domains. A quality of service (QoS)-aware selection of the service to be composed involves multiple, usually conflicting and possibly uncertain QoS attributes. A multi-criteria solution approach is desired to generate a set of alternative service selections. In addition, the uncertainty of QoSattributes is neglected in existing solution approaches. Hence, the need for service reconfigurations is imposed to avoid the violation of QoS restrictions. The researched problem is NP-hard. This article presents a heuristic multicriteria service selection approach that is designed to determine a Pareto frontier of alternative service selections in a reasonable amount of time. Taking into account the uncertainty of response times, the obtained service selections are robust with respect to the constrained execution time. The proposed solution approach is based on the Nondominated Sorting Genetic Algorithm (NSGA)-II extended by heuristics that exploit problem specific characteristics of the QoS-aware service selection. The applicability of the solution approach is demonstrated by a simulation study