A shortest path based automatic composition method of Semantic Web services

As the rapid growth in the number of services under Web environment, how to automatically compose Web Services according to the service requests becomes an urgent problem to solve. In this paper, we presented an automatic composition method of semantic Web services based on shortest path(SSCM), which constructs a service graph base on semantic similarity, and uses sim-shortest path algorithm to find a solution with the highest functional satisfaction while keeping good QoS performance. Composition experiments proved that this method can automatically generate a solution according to the user´s request effectively.