Dynamic System Reconfiguration Via Service Composition for Dependable Computing

Abstract

Dependable service-oriented computing is challenging because it faces an open, heterogeneous, and dynamic computing environment. In a service-oriented computing system, services developed by different vendors on different platforms and in different programming languages perform computations collaboratively through open standard protocols. This paper presents an innovative dynamic reconfiguration technology that can be embedded into a service-oriented application to make the application reconfigurable. Traditional reconfiguration algorithm assumes each component can independently switch without collaboration. The proposed reconfiguration agents are embedded in different services, and they communicate via a collaborative reconfiguration protocol to achieve a consistent reconfiguration decision. In addition, the reconfiguration protocol itself is fault-tolerant.

Decentralized and on-the-fly agent-based service reconfiguration in manufacturing systems

“…Most of the works consider that reconfiguration is planned in the design phase, setting up the system to cope with expected changes [7][8][9]. In contrast, run-time reconfiguration reacts promptly to situations during the system execution to overcome unexpected events that were not considered at design-time, as illustrated by [10][11][12]. However, the reconfiguration is usually based only on the migration of services that are considered as a reconfiguration action in an automatic manner.…”

Developing Real-Time Emergency Management Applications: Methodology for a Novel Programming Model Approach

“…for a sequential component the selected algorithm whereas for a parallel computation the exploited parallelism scheme). The actual system configuration can be modified by exploiting dynamic reconfiguration activities classified in four general categories (Arshad et al, 2007;Gomes et al, 2007;Hillman & Warren, 2004;Tsai et al, 2007;Vanneschi & Veraldi, 2007):…”

Analysing and determining substitutability of different granularity Web services

“…In recent literature, there exist a good number of approaches to verify service substitutability [13][14][15][16][17][18][19][20]. However, these approaches suffer from some limitations as follows: first, most of them can limit to determining the substitutability between atomic or simple services, which can be called small granularity services.…”

“…Many researchers and developers claimed that providing highly available service-based applications in highly dynamic environments (e.g. in a clouding environment) has become an additionally urgent challenge [12,22,24], because service-based applications are by nature heterogeneous, dynamic, and collaborative, they can be recovered by service substitution when one or several of their component services fail [9,20]. Therefore, to judge service substitutability has become another significant research issue in service computing [17].…”