INSC: An Iterative Negotiation Approach for Service Compositions

Qiang He, Yun Yang, Jun Yan, Hai Jin
{"title":"INSC: An Iterative Negotiation Approach for Service Compositions","authors":"Qiang He, Yun Yang, Jun Yan, Hai Jin","doi":"10.1109/SCC.2012.38","DOIUrl":null,"url":null,"abstract":"The service-oriented paradigm offers support for engineering service-based systems (SBSs) based on service compositions. The selection of services with the aim to fulfil the quality constraints for SBSs and to achieve the optimisation goals is a critical and challenging issue. In particular, when the quality-of-service (QoS) constraints for a SBS are severe, it is often difficult to find an optimal solution for the SBS. Exploiting the competition among service providers can help SBS developers obtain favourable QoS offers for the component services of SBSs and increase the possibility of finding optimal solutions for the SBSs. In this paper, we present a novel joint optimisation and negotiation approach named Iterative Negotiation for Service Composition (INSC) that supports effective and efficient QoS-aware service selection for SBSs. We evaluate INSC experimentally using example SBSs that are synthetically generated based on a real-world Web service dataset. The experimental results show that INSC can significantly and efficiently increase the possibility of finding optimal solutions in severe service composition scenarios.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Ninth International Conference on Services Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2012.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The service-oriented paradigm offers support for engineering service-based systems (SBSs) based on service compositions. The selection of services with the aim to fulfil the quality constraints for SBSs and to achieve the optimisation goals is a critical and challenging issue. In particular, when the quality-of-service (QoS) constraints for a SBS are severe, it is often difficult to find an optimal solution for the SBS. Exploiting the competition among service providers can help SBS developers obtain favourable QoS offers for the component services of SBSs and increase the possibility of finding optimal solutions for the SBSs. In this paper, we present a novel joint optimisation and negotiation approach named Iterative Negotiation for Service Composition (INSC) that supports effective and efficient QoS-aware service selection for SBSs. We evaluate INSC experimentally using example SBSs that are synthetically generated based on a real-world Web service dataset. The experimental results show that INSC can significantly and efficiently increase the possibility of finding optimal solutions in severe service composition scenarios.
INSC:服务组合的迭代协商方法
面向服务的范例为基于服务组合的基于服务的工程系统(sbs)提供了支持。选择服务以满足SBSs的质量约束和实现优化目标是一个关键和具有挑战性的问题。特别是,当SBS的服务质量(QoS)约束非常严格时,通常很难找到SBS的最佳解决方案。利用服务提供商之间的竞争可以帮助SBS开发人员为SBS的组件服务获得有利的QoS提供,并增加为SBS找到最佳解决方案的可能性。在本文中,我们提出了一种新的联合优化和协商方法,称为服务组合迭代协商(INSC),该方法支持服务组合的有效和高效的qos感知服务选择。我们使用基于真实Web服务数据集合成的示例SBSs对INSC进行了实验评估。实验结果表明,INSC可以显著有效地提高在严重业务组合场景下找到最优解的可能性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信