Algorithm of Web Services query based on bottleneck cost
一种基于瓶颈开销的Web服务查询算法

Web Service has become a standard method of sharing data and functionality among loosely-coupled systems. An algorithm based on bottleneck cost metric to arrange a query's Web service calls in optimal fashion was proposed. Optimal exploits parallelism among Web services was used to minimize the query's total running time. The optimal plan can be used in the presence of arbitrary precedence constraints among Web services. Compared with other optimal decisions, the experimental results prove the validity of the algorithm.