A composite web service is essentially a combination of smaller services to provide extended functionalities. However, such services are more susceptible to failures than atomic services. This is due to its dependency on other services which are external modules to the composite service. In this paper, we introduce a heuristic distance measure which significantly reduces search space of hybrid (i.e.forward-backward) search algorithm and results in near-optimal solutions.
展开▼
