The Selection Algorithm of Composed Service Scheme for Complicated Business

The composed service for the complicated business appeared with the boom of electronic commerce. Previous routing algorithms designed for the linear and parallel service composition are not feasible since there are multiple interactive messages between service components. The feasible composed-service scheme selection algorithms are present, which regards delay as a prior consideration while finding service components, and the interactive times of messages is an important metric as well as delay and bandwidth while selecting a composed service scheme. The simulation result shows the proposed algorithms achieve shorter path length and higher success ratio compared with the previous selection algorithm ideas.