{"title":"An Approach to Selecting Services with Dynamic Prices for Temporal-Aware Service Processes","authors":"Yanhua Du, Hong Li","doi":"10.1109/DASC.2013.47","DOIUrl":null,"url":null,"abstract":"In order to guarantee the successful execution of temporal-aware service processes in cloud computing, one important requirement is to effectively and efficiently select the appropriate services for service processes. The existing methods don't consider the dynamic prices of candidate services, or lack the efficient and practical selecting ability when encountering complex and large scale candidate services. In this paper, we propose a new approach to selecting services for temporal-aware service processes with dynamic prices. First of all, the initial execution paths of service processes are obtained by local optimization policy. Then, we judge whether temporal violations occur on these execution paths. If there are some temporal violations, the problem of violation correction is automatically transformed to nonlinear programming model which can be solved efficiently. Finally, the optimal execution paths for service processes are obtained. The advantages of our approach are validated by a practical example.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.2013.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In order to guarantee the successful execution of temporal-aware service processes in cloud computing, one important requirement is to effectively and efficiently select the appropriate services for service processes. The existing methods don't consider the dynamic prices of candidate services, or lack the efficient and practical selecting ability when encountering complex and large scale candidate services. In this paper, we propose a new approach to selecting services for temporal-aware service processes with dynamic prices. First of all, the initial execution paths of service processes are obtained by local optimization policy. Then, we judge whether temporal violations occur on these execution paths. If there are some temporal violations, the problem of violation correction is automatically transformed to nonlinear programming model which can be solved efficiently. Finally, the optimal execution paths for service processes are obtained. The advantages of our approach are validated by a practical example.