Abstract
Aiming at the current Web service selection methods do not take into full consideration the effect of service component's dynamic on the performance of service-oriented application system, a credit-aware per-service method to service selection is proposed in our paper, which introduces credit level into service selection model and is considered as Mixed Integer Linear Programming (MILP) problem. Composite system at run time can constrain service selection according to the high-availability of service components perceived by itself and the service level requirements of users, and then dynamically bind the best of a set of services. Simulation experimental results show that the new approach can effectively lower the extra time overhead caused by repeated selection that arises from the service component's dynamic, and then enhance the QoS (Quality of Service) of composite system. Meanwhile, our method is superior to the other traditional Web service selection approaches because it improves the efficiency of CPU usage.
Sign-in/Register to access full text options 
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.
