Optimization of Service Scheduling in Computing Force Network

To improve the users satisfaction requesting services in Computing Force Network(CFN), the issues and challenges of existing service scheduling mechanisms are examined firstly in this paper. Then in view of users' specific preference and expectation for services, a service optimization scheduling algorithm based on Bkd-tree is proposed, taking service response time, service scheduling cost, availability, and successability into consideration. The method covers a search algorithm and a reconstructing strategy. To improve the efficiency of selecting the service instances that satisfy user expectation, a pruning strategy is used to narrow search space. To support dynamic updates of the service instances, a reconstructing strategy is proposed. The experimental results show that the improved service scheduling algorithm can schedule service instances with the best overall performance while maintaining higher efficiency.