1 / 16

Failure Recovery of Composite Semantic Web Services using Subgraph Replacement

Failure Recovery of Composite Semantic Web Services using Subgraph Replacement. Hadi Saboohi Amineh Amini Hassan Abolhassani Karaj Islamic Azad University, IRAN. Web Services. A software system designed to support interoperable Machine to Machine interaction over a network Web APIs.

boyce
Download Presentation

Failure Recovery of Composite Semantic Web Services using Subgraph Replacement

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Failure Recovery of Composite Semantic Web Services using Subgraph Replacement HadiSaboohi AminehAmini Hassan Abolhassani Karaj Islamic Azad University, IRAN

  2. Web Services • A software system designed to support interoperable Machine to Machine interaction over a network • Web APIs ICCCE’08

  3. Semantic Web • Extension of current web • Giving well-defined meaning to information • Enabling computers and people to work in cooperation ICCCE’08

  4. Semantic Web Services • Semantically marked-up software resources that can be published, discovered, composed and executed across the Web in a task driven semi-automatic way • Dynamic part of the semantic web ICCCE’08

  5. Semantic Web Services, continued Dynamic Resources Web Services Semantic Web Services Static Resources Semantic Web WWW Interoperable Syntax Interoperable Semantics ICCCE’08

  6. Service Broker Service Requester Service Providers Service Registry Concepts Registry Ontology Cache Composed Services Cache Matchmaker Adapter Composer Ontology Manager Registry Manager Kernel Executor Service Broker Ref. 4 ICCCE’08

  7. IB, PB O, E I, P ISi, PSi Si A B OSi, ESi OA, EA Modeling Composite Semantic Web Services • Directed Acyclic Graph • Nodes: Web Services • Edges: Services inputs and outputs ICCCE’08

  8. Execution problem of a composite semantic web service • Execution of whole process depends on well-execution of all sub-processes • In execution failure of any constitutive web service, failure recovery is a better solution • Our approach • Replace a sequence of web services containing failed service in case a “same skilled” one is not exists ICCCE’08

  9. Replacement Strategy • Responsible for: • Finding best substitution alternative • Managing differences between old and new service(s) ICCCE’08

  10. Replacement Steps • Finding all possible alternatives • Subgraph calculation • Alternative search • Ranking alternatives • Replacement ICCCE’08

  11. 1. a. Subgraph calculation A S B Composite Graph All possible subgraphs S A S B A S A S B B ICCCE’08

  12. 1. b. Alternative search • Search for compatible replacement alternatives • Compatibility • Functional attributes (Inputs, Outputs, Effects and Preconditions) • Non-functional • Response time • Availability • Reliabiity • Cost • … ICCCE’08

  13. 2. Ranking alternatives • Each constitutive web service may exist in more than one subgraph • For example: S is in four subsets of subgraphs ({S}, {A,S}, {S,B}, {A,S,B}) • Each subgraph may have several alternatives ICCCE’08

  14. 3. Replacement • First: re-execution attempts • Second: Replacing best ranked subgraph • Compensation of well-executed web services in old subgraph ICCCE’08

  15. Replacement Patterns • Managing differences between old and new subgraphs • New subgraph may have additional IOPE(s) than old one and vice versa • Prepare required inputs and preconditions • Mark the composite as non-optimized and inspect to execute without additional outputs and effects ICCCE’08

  16. Conclusion and Future Works • Alleviate failure of software systems (CSWS) • Replacing a sequence of web services • Using forward and backward mechanisms • Heuristic algorithms to decrease number of subgraphs • Extend for all composition graphs ICCCE’08

More Related