Welcome to the InfoSci Platform
A Method for Optimizing Top-k Composite Services towards Preference-Aware Service Dominance

A Method for Optimizing Top-k Composite Services towards Preference-Aware Service Dominance

Shaoqian Zhang, Wenmin Lin, Wanchun Dou, Jinjun Chen
Copyright: © 2013 |Volume: 10 |Issue: 2 |Pages: 24
ISSN: 1545-7362|EISSN: 1546-5004|EISBN13: 9781466632721|DOI: 10.4018/jwsr.2013040104
Cite Article Cite Article

MLA

Zhang, Shaoqian, et al. "A Method for Optimizing Top-k Composite Services towards Preference-Aware Service Dominance." IJWSR vol.10, no.2 2013: pp.63-86. http://doi.org/10.4018/jwsr.2013040104

APA

Zhang, S., Lin, W., Dou, W., & Chen, J. (2013). A Method for Optimizing Top-k Composite Services towards Preference-Aware Service Dominance. International Journal of Web Services Research (IJWSR), 10(2), 63-86. http://doi.org/10.4018/jwsr.2013040104

Chicago

Zhang, Shaoqian, et al. "A Method for Optimizing Top-k Composite Services towards Preference-Aware Service Dominance," International Journal of Web Services Research (IJWSR) 10, no.2: 63-86. http://doi.org/10.4018/jwsr.2013040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Web service composition allows users to create value-added composite Web services on existent services, where top-k composite services are helpful for users to find a satisfying composite service efficiently. However, with an increasing number of Web services and users' various composition preferences, computing top-k composite services dynamically for different users is difficult. In view of this challenge, an optimization method for top-k composite services is proposed, based on a preference-aware service dominance relationship. Concretely speaking, firstly, user preferences are modeled with the preference-aware service dominance. Then, in local service selection, a multi-index based algorithm is proposed, named Multi-Index, for computing candidate services of each task dynamically. After that, in global optimization, combined with a service lattice, top-k composite services are selected under a dominant number-aware service ranking. A case study is also presented for illustrating the authors’ solution. At last, an experiment was conducted to verify the proposed method.

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.