移动计算环境中顺序连接服务的机会组合

C. Groba, S. Clarke
{"title":"移动计算环境中顺序连接服务的机会组合","authors":"C. Groba, S. Clarke","doi":"10.1109/ICWS.2011.56","DOIUrl":null,"url":null,"abstract":"Dynamic service composition has emerged as a promising approach to build complex runtime-adaptable applications as it allows for binding service providers only shortly before service execution. However, the dynamic and ad hoc nature of mobile computing environments poses a significant challenge for dynamic service composition. In particular, the lack of central control and the potential volatility of service providers increase the complexity and failure probability of the composition process. Although, current research has led to decentralised composition algorithms and failure recovery strategies, the key question of how to reduce the failure probability of a composition still remains. We address this question and propose opportunistic service composition, an optimised execution model for complex service requests. The model merges the execution phase into the dynamic binding phase and supports the immediate fulfilment of partially composed service requests. We evaluated our model in mobile ad hoc network simulations. The results show an improvement over a baseline approach regarding composition success, response time, and communication effort.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Opportunistic Composition of Sequentially-Connected Services in Mobile Computing Environments\",\"authors\":\"C. Groba, S. Clarke\",\"doi\":\"10.1109/ICWS.2011.56\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dynamic service composition has emerged as a promising approach to build complex runtime-adaptable applications as it allows for binding service providers only shortly before service execution. However, the dynamic and ad hoc nature of mobile computing environments poses a significant challenge for dynamic service composition. In particular, the lack of central control and the potential volatility of service providers increase the complexity and failure probability of the composition process. Although, current research has led to decentralised composition algorithms and failure recovery strategies, the key question of how to reduce the failure probability of a composition still remains. We address this question and propose opportunistic service composition, an optimised execution model for complex service requests. The model merges the execution phase into the dynamic binding phase and supports the immediate fulfilment of partially composed service requests. We evaluated our model in mobile ad hoc network simulations. The results show an improvement over a baseline approach regarding composition success, response time, and communication effort.\",\"PeriodicalId\":118512,\"journal\":{\"name\":\"2011 IEEE International Conference on Web Services\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Web Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWS.2011.56\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Web Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWS.2011.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

动态服务组合已经成为一种很有前途的方法,用于构建复杂的、可适应运行时的应用程序,因为它只允许在服务执行前不久绑定服务提供者。然而,移动计算环境的动态性和即时性对动态服务组合提出了重大挑战。特别是,缺乏中央控制和服务提供者的潜在波动性增加了组合过程的复杂性和失败概率。尽管目前的研究已经产生了分散的合成算法和故障恢复策略,但如何降低合成故障概率的关键问题仍然存在。我们解决了这个问题,并提出了机会服务组合,这是一种针对复杂服务请求的优化执行模型。该模型将执行阶段合并到动态绑定阶段,并支持部分组合的服务请求的即时实现。我们在移动自组织网络仿真中评估了我们的模型。结果显示,在组合成功、响应时间和通信工作方面,与基线方法相比有了改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Opportunistic Composition of Sequentially-Connected Services in Mobile Computing Environments
Dynamic service composition has emerged as a promising approach to build complex runtime-adaptable applications as it allows for binding service providers only shortly before service execution. However, the dynamic and ad hoc nature of mobile computing environments poses a significant challenge for dynamic service composition. In particular, the lack of central control and the potential volatility of service providers increase the complexity and failure probability of the composition process. Although, current research has led to decentralised composition algorithms and failure recovery strategies, the key question of how to reduce the failure probability of a composition still remains. We address this question and propose opportunistic service composition, an optimised execution model for complex service requests. The model merges the execution phase into the dynamic binding phase and supports the immediate fulfilment of partially composed service requests. We evaluated our model in mobile ad hoc network simulations. The results show an improvement over a baseline approach regarding composition success, response time, and communication effort.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信