Welcome to the InfoSci Platform
Efficiently Compositing and Optimizing the Quality of Heterogeneous Services

Efficiently Compositing and Optimizing the Quality of Heterogeneous Services

Hanhua Chen, Hai Jin
Copyright: © 2014 |Volume: 11 |Issue: 3 |Pages: 20
ISSN: 1545-7362|EISSN: 1546-5004|EISBN13: 9781466657465|DOI: 10.4018/ijwsr.2014070104
Cite Article Cite Article

MLA

Chen, Hanhua, and Hai Jin. "Efficiently Compositing and Optimizing the Quality of Heterogeneous Services." IJWSR vol.11, no.3 2014: pp.76-95. http://doi.org/10.4018/ijwsr.2014070104

APA

Chen, H. & Jin, H. (2014). Efficiently Compositing and Optimizing the Quality of Heterogeneous Services. International Journal of Web Services Research (IJWSR), 11(3), 76-95. http://doi.org/10.4018/ijwsr.2014070104

Chicago

Chen, Hanhua, and Hai Jin. "Efficiently Compositing and Optimizing the Quality of Heterogeneous Services," International Journal of Web Services Research (IJWSR) 11, no.3: 76-95. http://doi.org/10.4018/ijwsr.2014070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The emerging service-oriented computing bring various services together to a ‘market' for clients to request, enabling the integration of services across the distributed, heterogeneous, and wide area networks. By encapsulating diverse implementations of physical and software resources in the interface that standardizes the functions, loosely coupled services have show great potential to support a versatile integration platform for complex applications. Existing techniques can successfully support integrating services from different providers to provide applications with more complex user requirements. However, to automatically composite services with guaranteed QoS is not trivial. In this paper, the authors propose Q-SAC, a QoS optimized service automatic composition model. Two main features of Q-SAC include automatic service composition, and multidimensional QoS optimization for the composition plan. The authors show that the problem of Q-SAC QoS optimization is NP-hard, and design a heuristic simulated annealing algorithm. Through simulation the authors show that this design is practical and efficient.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.