Abstract

For business processes based on micro service architecture in an enterprise, failures often occur because of modified business rules or goals, change of service availability, and dynamical running environment. Based on dynamical replanning technologies, these failures can be repaired at runtime. However, semantic conflicts among services from different providers can greatly decrease response efficiency and response success rate of a business goal. In this paper, we propose a novel service runtime self-adaptation framework to decrease response time and raise success rate. Distributed dynamic description logic is utilized to eliminate semantic conflicts among services and provide basic models for carrying out planning among services. Considering inputs, outputs, preconditions, and effects properties of services, local and global planning algorithms based on artificial intelligence graph planning are designed. Local planning can rapidly search a service-based path only including services from a provider, and global planning can try to explore a path including services from multiple providers. Based on these two algorithms, local and global replanning strategies are designed to handle runtime exceptions at service level and path level. We implement a prototype system by means of workflow engine Activiti and business process language BPMN2.0. Experiments show that compared with previous works, our framework can guarantee higher efficiency and success rate.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.