面向时间感知服务过程的动态价格服务选择方法

Yanhua Du, Hong Li
{"title":"面向时间感知服务过程的动态价格服务选择方法","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":"{\"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}","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

摘要

为了保证云计算中时间感知服务流程的成功执行,一个重要的要求是有效和高效地为服务流程选择合适的服务。现有的方法没有考虑候选服务的动态价格,或者在面对复杂、大规模的候选服务时缺乏高效实用的选择能力。在本文中,我们提出了一种新的方法来选择具有动态价格的具有时间感知的服务过程。首先,通过局部优化策略获得业务流程的初始执行路径;然后,我们判断这些执行路径上是否发生时间冲突。当存在时间违例时,违例校正问题自动转化为非线性规划模型,可以有效地求解。最后,得到了服务进程的最优执行路径。通过实例验证了该方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Approach to Selecting Services with Dynamic Prices for Temporal-Aware Service Processes
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信