Search Strategies for Automatic Web Service Composition

Milanović, Nikola; Malek, Miroslaw

doi:10.4018/jwsr.2006040101

Cited by 23 publications

(16 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Forward Chaining Approach for dynamic service composition is described in [9] and is followed by [10] and [12]. FCA starts with the available input as shown in Figure 1.…”

Section: A Forward Chaining Approach (Fca)mentioning

confidence: 99%

“…Backward Chaining Approach for dynamic service composition is introduced by [9] and is followed by [11]. Figure 2 shows the flow chart of BCA.…”

Section: B Backward Chaining Approach (Bca)mentioning

confidence: 99%

“…Backward search is performed to generate composition plan and composite service [9], [10], [11], [12] from the candidate services. Candidate services are services which found to be relevant to service request and can be a part of the required composite service.…”

Section: Backward Searchmentioning

confidence: 99%

“…This overhead in turn increases the composition time required to find a composite service. Performance of backward chaining approach suffers significantly when relevant services, and thus unusable services among them, increase exponentially with each iteration [13], [9] . Experiment 2 shown in Section VII shows such a case.…”

Section: Open Issues In Fca and Bcamentioning

confidence: 99%

See 3 more Smart Citations

Dynamic Service Composition

Khakhkhar¹,

Kumar²,

Chaudhary³

2012

IJCSAI

View full text Add to dashboard Cite

Abstract-Service is a network addressable software component to perform a specific task. A service discovery mechanism can be used to find services that can be executed to satisfy a service request. A service composition generates a composition plan and a composite service to satisfy a service request. Static composition process consumes considerable amount of time and effort. It is also vulnerable to changes in input/output of services. A dynamic composition algorithm can automatically select services involved in composite plan and generate a composite service on-the-fly. Composition time taken by the algorithm to generate a composite service is the main issue with dynamic composition algorithms. Dynamic composition algorithms presented in previous work mainly follow either forward chaining approach (FCA) or backward chaining approach (BCA) to generate a composite service. Their performance suffers for certain cases to generate a composite service where the number of services explored increases exponentially as number of iterations increases. This work proposes a dynamic composition algorithm that gives consistent performance across all the cases. Proposed algorithm approaches from two directions alternatively, one follows FCA and another follows BCA. Proposed algorithm explores less number of services and takes less composition time compared to algorithms FCA or BCA.

show abstract

“…Forward Chaining Approach for dynamic service composition is described in [9] and is followed by [10] and [12]. FCA starts with the available input as shown in Figure 1.…”

Section: A Forward Chaining Approach (Fca)mentioning

confidence: 99%

“…Backward Chaining Approach for dynamic service composition is introduced by [9] and is followed by [11]. Figure 2 shows the flow chart of BCA.…”

Section: B Backward Chaining Approach (Bca)mentioning

confidence: 99%

Section: Backward Searchmentioning

confidence: 99%

Section: Open Issues In Fca and Bcamentioning

confidence: 99%

See 2 more Smart Citations

Dynamic Service Composition

Khakhkhar¹,

Kumar²,

Chaudhary³

2012

IJCSAI

View full text Add to dashboard Cite

show abstract

“…Some approaches, such as [5,6], tackle Web service composition problem via AI planning. On the other hand, some other researches [4,10] regards it as a graph search problem and solves it by shortest path, A*, etc. algorithms.…”

Section: Related Workmentioning

confidence: 99%

A QoS-Aware Hyper-graph Based Method of Semantic Service Composition

Cui

2012

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

Abstract. Semantic service composition is an important issue in web service based systems. It is about how to build a new, reusable and value-added service by combining existing semantic web services. In this paper we propose a new hyper-graph based method supporting semantic service composition, which model the service composition problem as a hyper-graph. Then the hyper-graph based service composition algorithm has been implemented and evaluated. The evaluation results have shown that the method can effectively reduce the composition time and has good robustness, especially in the case of large number of web services and concepts.

show abstract

QoS-Aware Automatic Service Composition: A Graph View

Jiang

Tian

et al. 2011

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

In the research of service composition, it demands efficient algorithms that not only retrieve correct service compositions automatically from thousands of services but also satisfy the quality requirements of different service users. However, most approaches treat these two aspects as two separate problems, automatic service composition and service selection. Although the latest researches realize the restriction of this separate view and some specific methods are proposed, they still suffer from serious limitations in scalability and accuracy when addressing both requirements simultaneously. In order to cope with these limitations and efficiently solve the combined problem which is known as QoS-aware or QoS-driven automatic service composition problem, we propose a new graph search problem, single-source optimal directed acyclic graphs (DAGs), for the first time. This novel single-source optimal DAGs (SSOD) problem is similar to, but more general than the classical single-source shortest paths (SSSP) problem. In this paper, a new graph model of SSOD problem is proposed and a Sim-Dijkstra algorithm is presented to address the SSOD problem with the time complexity of O(n log n + m) (n and m are the number of nodes and edges in the graph respectively), and the proofs of its soundness. It is also directly applied to solve the QoS-aware automatic service composition problem, and a service composition tool named QSynth is implemented. Evaluations show that Sim-Dijkstra algorithm achieves superior scalability and efficiency with respect to a large variety of composition scenarios, even more efficient than our worklist algorithm that won the performance championship of Web Services Challenge 2009.

show abstract

Search Strategies for Automatic Web Service Composition

Cited by 23 publications

References 39 publications

Dynamic Service Composition

Dynamic Service Composition

A QoS-Aware Hyper-graph Based Method of Semantic Service Composition

QoS-Aware Automatic Service Composition: A Graph View

Contact Info

Product

Resources

About