The Community for Technology Leaders
2013 IEEE 20th International Conference on Web Services (2013)
Santa Clara, CA, USA USA
June 28, 2013 to July 3, 2013
pp: 75-82
Web service composition lets users 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, a top-k composite services selection method is proposed, based on a preference-aware service dominance relationship. Concretely speaking, firstly, user preferences are modeled with the preference-aware service dominance, and then, in local service selection, a multi-index based algorithm is proposed, named Multi-Index, for computing candidate services of each task dynamically. Then, in global optimization, combined with a service lattice, top-k composite services are selected under a dominant number-aware service ranking. At last, an experiment is presented to verify our method.
Quality of service, Lattices, Uninterruptible power systems, Indexes, Web services, Optimization, Heuristic algorithms

S. Zhang, W. Dou and J. Chen, "Selecting Top-k Composite Web Services Using Preference-Aware Dominance Relationship," 2013 IEEE 20th International Conference on Web Services(ICWS), Santa Clara, CA, USA USA, 2013, pp. 75-82.
211 ms
(Ver 3.3 (11022016))