The Community for Technology Leaders
Green Image
Issue No. 04 - Oct.-Dec. (2014 vol. 7)
ISSN: 1939-1374
pp: 681-695
Wei Jiang , Chinese Academy of Sciences, Institute of Computing Technology, China
Songlin Hu , Chinese Academy of Sciences, Institute of Computing Technology, China
Zhiyong Liu , Chinese Academy of Sciences, Institute of Computing Technology, China
With the proliferation of Web services, service engineers demand automatic service composition algorithms that not only synthesize the correct service compositions from thousands of services but also satisfy the quality requirements of users. This is known as QoS-aware automatic service composition problem. Our observation is that current research of only finding the optimal service composition result has several shortcomings. Users have to utilize the optimal one, which will make it rigid, and consequently bring about problems, such as overload of “hot services” and lack of choices for users. To cope with these problems, a top k query mechanism is introduced in this paper, and a progressive and incremental Key-Path-Based Loose (KPL) algorithm with 100 percent accuracy is proposed. Our QSynth, which won the performance championship of Web Service Challenge 2009 and 2010, is extended to support top k query based on KPL algorithm. Evaluations show that, compared to the state of the art, KPL algorithm achieves superior scalability and accuracy with respect to a large variety of composition scenarios. Moreover, we generalize a new graph problem: top k DAGs (Directed Acyclic Graphs) problem based on the above work. Applications of this new graph problem contain API recommender, supply chain, and so on. KPL algorithm illustrated in this paper can address them efficiently, too.
Quality of service, Facsimile, Time factors, Web services, Portable document format, Service-oriented architecture

W. Jiang, S. Hu and Z. Liu, "Top K Query for QoS-Aware Automatic Service Composition," in IEEE Transactions on Services Computing, vol. 7, no. 4, pp. 681-695, 2014.
102 ms
(Ver 3.3 (11022016))