The Study On The Optimizing Method Of Process Oriented Composition Cost

Web service is a new form of Internet Software that can be universally deployed and invoked in standard protocol. Therefore, the useing such technology, different service provider services can be easily integrated process to form an integrated service. Integrated Web service can be done through static methods or dynamic method. These methods can be selected on the basis of functional requirements and performance constraints. For many distributed applications composed by Web services, the runtime performance (e.g. end-to-end delay, overall cost, service reliability and availability) is measured by its runtime performance, rather than the performance of any individual service component. What the users most care for is the performance of the composition services, rather than the individual service. So, a mechanism is needed to ensure that the cost of business process with composite Web services is acceptable.In this paper, the main target is aimed at the conpositon and optimization of servises under the restiction of overall performance of the services. Agent for composing services is established to deal with the work of communication, coordination and service choice between Web users and providers. Then getting all satisfactory services, selecting services according to user's functional demands and getting the service promise from service provider. This approach has made the field of Web professionals can be more easily used by ordinary users with the cost of users greatly reduced. Whatmore, it can deal with the problems between the interaction of services and improve the reliability of the system.In the service selection process, , we designed a service selection algorithm in order to meet the overall performance constraints. The goal of the algorithm is to meet the cost of the total portfolio process on the basis of constraint in order to maximize the interests in the whole process. We select algorithm based on cost of service, service response time, service load, and network delay performance attributes to select the best end-to-end service performance constraints. We divide price restraint choice of services into single-issue binding choice of services and multiple binding options. We can deal with single binding choice of services as choicer knapsack problem, incorporates multiple binding choices of services to more abstract scale multi-choice knapsack problem, but also more abstract constrained optimal routing problem. These issues were discussed and analyzed, and highly effective solution is proposed.These algorithms guaranteed that the services portfolio flow generated in composing process on the basis of According to users of the portfolio service performance requirements, can access to higher overall performance of the portfolio services, and further get the interests maximize function and the best mix of services results.Finally, the method is adapted in SmartFlow model for the application, and obtained good results.