Research Article
Near-optimal Configuration of Service Pool Size in Service Composition
@INPROCEEDINGS{10.1109/ChinaCom.2011.6158350, author={Pan He and Kaigui Wu and Qi Xie and Jie Xu}, title={Near-optimal Configuration of Service Pool Size in Service Composition}, proceedings={2nd International ICST Workshop on Advances in Data and Information Management: Recent Advances of Cloud Computing in Data and Information Management Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={ADIM}, year={2012}, month={3}, keywords={service composition reliability model web service service pool markov chain}, doi={10.1109/ChinaCom.2011.6158350} }- Pan He
Kaigui Wu
Qi Xie
Jie Xu
Year: 2012
Near-optimal Configuration of Service Pool Size in Service Composition
ADIM
IEEE
DOI: 10.1109/ChinaCom.2011.6158350
Abstract
To improve the reliability of service composition, service pools with redundant services are often registered in advance. Increasing the number of redundant services in a pool could improve the reliability while decreasing the performance or increasing unnecessary cost. Aiming at minimizing the overall cost or response time under certain reliability constraint, this paper proposed a service pool size choosing method from the point of view of service composition. It started with the reliability and performance evaluation of single service pool with multiple services and then employed architecture-based model to obtain the overall reliability/performance model for service composition with multiple service pools. These models were used as the utility function and constraint function to optimize service pool size combination. Two sensitivity-based algorithms were proposed to solve the optimization problem, which assigned more redundant services to those service pools that have higher impact on reliability change and lower impact on performance change. Empirical studies results showed that these algorithms could find the near-optimal size combination of service pools using much less time than the exhaustive iteration method.
