Abstract
The quality of service (QoS)-aware service composition (QSC) problem is to find an execution plan of a service composition process which can ensure that the quality of service meets given user requirements. This paper proposes a branch and bound for execution plan selection (BB4EPS) algorithm to solve the QSC problem. In the proposed BB4EPS algorithm, a universal QoS model is used to evaluate the QoS parameters for service composition, and the QSC problem is modeled as an extended flexible constraint satisfaction framework, in which the utility function is applied to build the objective function. Numerical simulation results show that the proposed algorithm is feasible and effective.
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 callDisclaimer: 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.
