As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
With the rapid development of cloud computing, service computing and internet, the amount of service and service user both grow rapidly. A huge user requests to a service can form a request flow. How to select services for a composite service which is based on a request flow is an important problem. This paper firstly proposes a probability-based solution structure to solve the problem. Then an evaluation method of a solution is defined according to the solution structure. Lastly an improved artificial bee colony algorithm is applied to solve the selection of multiple composite service instances and their allocation probability at one time. Experiments show that this method can effectively guarantee the request flow constraints, and the speed of solution will not change greatly with the size of solution space. It is basically suitable for large-scale problem solving.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.