Continuous Query for QoS-Aware Automatic Service Composition

Jiang, Wei; Hu, Songlin; Lee, Dongwon; Gong, Shuai

doi:10.1109/icws.2012.44

Cited by 33 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We do not consider the situation of dynamic QoS or service in this paper. If you are interested in dynamic QoS and services, please refer to our paper [19].…”

Section: Web Service Matchmentioning

confidence: 99%

Top K Query for QoS-Aware Automatic Service Composition

Jiang

2014

IEEE Trans. Serv. Comput.

Self Cite

View full text Add to dashboard Cite

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 brings 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, a progressive and incremental Key-Path-Based Loose (KPL) algorithm with 100% 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.

show abstract

“…We do not consider the situation of dynamic QoS or service in this paper. If you are interested in dynamic QoS and services, please refer to our paper [19].…”

Section: Web Service Matchmentioning

confidence: 99%

Top K Query for QoS-Aware Automatic Service Composition

Jiang

2014

IEEE Trans. Serv. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…A significant amount of work has been done by considering different perspectives of service composition and discovery [1], [24], [25], [26]. The primary objective of service composition methods has been the computation of the optimal service composition result [5], [6], [19], [27] considering functional and non-functional attributes.…”

Section: Related Workmentioning

confidence: 99%

QoS Constrained Large Scale Web Service Composition Using Abstraction Refinement

Chattopadhyay

Banerjee

2020

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Efficient service composition in real time, while satisfying desirable Quality of Service (QoS) guarantees for the composite solution has always been one of the topmost research challenges in the domain of service computing. On one hand, optimal QoS aware service composition algorithms, that come with the promise of solution optimality, are inherently compute intensive, and therefore, often fail to generate the optimal solution in real time for large scale web services. On the other hand, heuristic solutions that have the ability to generate solutions fast and handle large and complex service spaces, settle for sub-optimal solution quality. The problem of balancing the trade-off between compute efficiency and optimality in service composition has alluded researchers for several decades, and several proposals for taming the scale and complexity of web service composition have been proposed in literature. In this paper, we present a new perspective towards this trade-off in service composition based on abstraction refinement, that can be seamlessly integrated on top of any off-the-shelf service composition method to tackle the space complexity, thereby, making it more time and space efficient. Instead of considering services individually during composition, we propose a set of abstractions and corresponding refinements to form service groups based on functional characteristics. The composition and QoS satisfying solution construction steps are carried out in the abstract service space. Our abstraction refinement methods give a significant speed-up compared to traditional composition techniques, since we end up exploring a substantially smaller space on average. Experimental results on benchmarks show the efficiency of our proposed mechanism in terms of time and the number of services considered for building the QoS satisfying composite solution.

show abstract

“…Yu Lei and control policy planning which is based on heuristics function [7], logic planning which is based on model checking [8], graph planning which is based on Graphplan [9,10], and uncertainty planning which is based on Markov Decision Processes. Gao et al [11] modeled service composition based on MDP, viewing a task collection as a state, and viewing success rate of invocations as transition probabilities.…”

Section: There Can Be Composite Services When You Believementioning

confidence: 99%

There Can Be Composite Services When You Believe

Lei¹

2016

STSC

View full text Add to dashboard Cite

Web services on the internet are distributed, heterogeneous, autonomous and dynamic, which leads to uncertainty of web services. These uncertain factors affect success rate of service composition. The web service composition problem should be considered as an uncertain planning problem. Therefore, we use an uncertainty planning method to deal with the uncertain planning problem for service composition. Without knowing complete information, our method uses an estimated value function to obtain a composite service. We give details and examples that how to compose services by our method. In addition, we shows relations among user requirements, service invocations and Quality of services. The experiments verify the validity of the algorithm.

show abstract

Continuous Query for QoS-Aware Automatic Service Composition

Cited by 33 publications

References 23 publications

Top K Query for QoS-Aware Automatic Service Composition

Top K Query for QoS-Aware Automatic Service Composition

QoS Constrained Large Scale Web Service Composition Using Abstraction Refinement

There Can Be Composite Services When You Believe

Contact Info

Product

Resources

About