QoS constrained Large Scale Web Service Composition using Abstraction Refinement
Soumi Chattopadhyay, Ansuman Banerjee

TL;DR
This paper introduces an abstraction refinement approach for large-scale web service composition that significantly reduces search space and improves efficiency while satisfying QoS constraints through iterative refinement.
Contribution
It proposes a novel abstraction refinement method that groups services to speed up composition and refines solutions to meet QoS requirements, outperforming traditional techniques.
Findings
Significant speed-up in service composition process.
Effective reduction in search space for large-scale problems.
Successful experimental validation on real benchmarks.
Abstract
Efficient service composition in real time while providing necessary Quality of Service (QoS) guarantees has been a challenging research problem with ever growing complexity. Several heuristic based approaches with diverse proposals for taming the scale and complexity of web service composition, have been proposed in literature. In this paper, we present a new approach for efficient service composition based on abstraction refinement. Instead of considering individual services during composition, we propose several abstractions to form service groups and the composition is done on these abstract services. Abstraction reduces the search space significantly and thereby can be done reasonably fast. While this can expedite solution construction to a great extent, this also entails a possibility that it may fail to generate any solution satisfying the QoS constraints, though the individual…
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.
