Dynamic Web Service Composition based on Network Modeling with Statistical Analysis and Backtracking
M.SureshKumar, P.Varalakshmi

TL;DR
This paper introduces a novel approach for dynamic web service composition using network analysis and backtracking, improving success rates in service integration.
Contribution
It proposes a new paradigm combining network modeling with backtracking for dynamic web service composition, along with the Zeittafel algorithm for service selection and scheduling.
Findings
Higher job success rate compared to existing methods
Effective integration of web services through the proposed paradigm
Improved scheduling efficiency with Zeittafel algorithm
Abstract
A Web service is a software system designed to support interoperable machine-to-machine interaction over a network. Web services provide a standard means of interoperating between different software applications, running on a variety of platforms and/or frameworks. One of the main advantages of the usage of web services is its ability to integrate with the other services through web service composition and realize the required functionality. This paper presents a new paradigm of dynamic web services composition using network analysis paired with backtracking. An algorithm called "Zeittafel" for the selection and scheduling of services that are to be composed is also presented. With the proposed system better percentage of job success rate is obtained compared to the existing methodology.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
