Font Size: a A A

Research On Runtime Detection And Resolution Of Property Conflict Of Service Composition

Posted on:2018-06-17Degree:MasterType:Thesis
Country:ChinaCandidate:H X ChiFull Text:PDF
GTID:2428330596968729Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
Feature Interaction problem originates from telecommunication domain.However,this phenomenon is not unique to the telecom,but in some software system beyond telecom.In recent years,with the rapid development of Web services,more and more enterprises and individuals released their applications to the Web in the form of Web service,but the function of a single service is very limited,it is difficult to meet the needs of a variety of practical applications,so it is necessary to composite services to meet the functional needs of a large number of users.The compatibility of services should be considered when different services are combined.Because of the independent development of Web services,the independent distribution of deployment and personalized user demands,Web services are varied and different,which may cause conflicts during the service composition and fail the combination.Therefore,effective online detection of conflicts between services is vital to the composition.In the premise of conflict,it usually requires service replacement and scheduling to resolve conflicts,and how to choose a proper replacement service and schedule it efficiently for the concurrent situation is an important problem.In this paper,we focus on the problem of online conflict detection and service selection and scheduling in the process of service composition.In order to solve the problem of conflict detection,this paper proposes a online conflict detection framework based on process mining,and implements two kinds of conflict detection methods,which can detect loop condition and non-determinism problems.The framework mine existing service log information and get Petri net models of services,then the Petri net models are analyzed and production rules of services are obtained,and after that the conflicts can be predicted by analyzing the production rules.The prototype is implemented,and the experimental results are compared with the existing methods.Experiment and comparison results show that this method can predict the loop condition conflict and non-determinism conflict without the need of understanding the service internal logic,so as to achieve the purpose of avoiding conflicts between services during the service composition process.As to the service selection and scheduling problems during the service conflict resolution process,we utilized the weighted polling queue and feedback mechanism to establish a service replacement request scheduling model,and proposed feedback mechanism based service queue and QoS model for service to improve the accuracy of service selection.The queuing theory is utilized to analyze the delay characteristics of the model.The experimental results show that the proposed method can reduce the delay of replacement requests and ensure the relative fairness of requests in the case of multiple concurrent requests,and was able to choose the best replacement service.
Keywords/Search Tags:Web Service Composition, Process Mining, Conflict Detection, Web Service Selection, Request Scheduling
PDF Full Text Request
Related items