Modeling and Optimizing Resource Scheduling for Service Composition Based on Queuing Petri Nets

Service composition is an important means for integrating the individual Web services to create new value added systems. However, because highly dynamic nature of service composition poses new challenges to resource management, efficient resource scheduling schemes are highly demanded. In this paper, a hierarchal service scheduling net is proposed to model different components of service composition, queuing theory is used to describe the competition process of available service, thus forming the scheduling model of service composition. On this basis, the evaluation function and resource scheduling strategy of service composition are proposed by considering the preference, the price and response time of available service. The related theories of Petri net are used to formally verify the correctness of proposed method. Both case study and simulation results show that the method can optimize the resource scheduling process of service composition, which has the merits of rich expressivity, while improving the performance.