Service Selection With Package Bundles and Compatibility Constraints
- 22 April 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 15 (5) , 3031-3046
Abstract
With the rapid proliferation of strategic alliances between service providers, enterprises cooperate towards service quality improvement abd provide lower cost service bundles. This paper presents a novel solution to the minimum cost service bundle selection problem for workflows in the presence of singleton subscription costs and service bundle offerings and compatibility requirements. Given a workflow specifying a set of tasks and a set of candidate services for each task, with a set of compatibility constraints between services, the selection problem has the objective of selecting the most suitable service offering(s) for each task. In this paper, we analyze the selection problem in the presence of service bundle offerings. We present a novel multi-partite hyper-graph visualization of the selection problem and analyze its hardness. Additionally we present a novel combination of ILP and abstraction refinement as a potential solution, that is shown to expedite a na\"ive ILP based solution. We present experiments to substantiate this claim.Keywords
This publication has 33 references indexed in Scilit:
- A Partial Selection Methodology for Efficient QoS-Aware Service CompositionIEEE Transactions on Services Computing, 2014
- Service Selection for Composition with QoS CorrelationsIEEE Transactions on Services Computing, 2014
- Service Selection for Web Services with Probabilistic QoSIEEE Transactions on Services Computing, 2014
- Quality-Aware Service Selection for Service-Based Systems Based on Iterative Multi-Attribute Combinatorial AuctionIEEE Transactions on Software Engineering, 2014
- Anytime QoS-aware service composition over the GraphPlanService Oriented Computing and Applications, 2013
- Investigating QoS of Real-World Web ServicesIEEE Transactions on Services Computing, 2012
- Breaking up is Never Easy: Planning for Exit in a Strategic AllianceCalifornia Management Review, 2008
- Counterexample-Guided Abstraction Refinement2000
- A Tight Analysis of the Greedy Algorithm for Set CoverJournal of Algorithms, 1997
- Matchings and covers in hypergraphsGraphs and Combinatorics, 1988