Efficient Skyline computation for optimal service composition with fuzzy preference relationships

Fatma Rhimi, S. B. Yahia, S. Ahmed
{"title":"Efficient Skyline computation for optimal service composition with fuzzy preference relationships","authors":"Fatma Rhimi, S. B. Yahia, S. Ahmed","doi":"10.1109/ISNCC.2015.7238580","DOIUrl":null,"url":null,"abstract":"Service composition is arising as an effective process to ensure the integration of multiple atomic web services in order to create customized composite web services. However, the exploding number of the deployed service candidates that is constantly increasing makes the process of choosing the best service candidates an important challenge. When there are multiple web services that offer the same functionalities, we need to select the best one according to its non-functional criteria (e.g. response time, price, reliability). Skyline is a technique that helps reducing the size of our search space and comes as a complementary approach to the optimization methods. In fact, Skyline consists in preselecting the best candidates in the search space according to their non-functional criteria. Most of the current Skyline computation relies on a strict dominance relationship called Pareto-dominance. In this paper, we propose a new method to compute the Skyline points with a fuzzy approach which allows taking into consideration the users preferences. We will through this paper show how we could construct a consistent fuzzy model to overcome the limitations of web service composition computation. Experimental evaluation demonstrates the effectiveness of the proposed concept and the efficiency of our implementation.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISNCC.2015.7238580","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Service composition is arising as an effective process to ensure the integration of multiple atomic web services in order to create customized composite web services. However, the exploding number of the deployed service candidates that is constantly increasing makes the process of choosing the best service candidates an important challenge. When there are multiple web services that offer the same functionalities, we need to select the best one according to its non-functional criteria (e.g. response time, price, reliability). Skyline is a technique that helps reducing the size of our search space and comes as a complementary approach to the optimization methods. In fact, Skyline consists in preselecting the best candidates in the search space according to their non-functional criteria. Most of the current Skyline computation relies on a strict dominance relationship called Pareto-dominance. In this paper, we propose a new method to compute the Skyline points with a fuzzy approach which allows taking into consideration the users preferences. We will through this paper show how we could construct a consistent fuzzy model to overcome the limitations of web service composition computation. Experimental evaluation demonstrates the effectiveness of the proposed concept and the efficiency of our implementation.
模糊偏好关系下最优服务组合的高效Skyline计算
服务组合作为确保多个原子web服务集成以创建自定义组合web服务的有效流程而出现。然而,部署的候选服务数量不断增加,这使得选择最佳候选服务的过程成为一个重要的挑战。当有多个web服务提供相同的功能时,我们需要根据它的非功能标准(例如响应时间、价格、可靠性)选择最好的一个。Skyline是一种有助于减少搜索空间大小的技术,并作为优化方法的补充。事实上,Skyline是根据非功能标准在搜索空间中预先选择最佳候选项。目前Skyline的大部分计算都依赖于一种严格的支配关系,即帕累托支配关系。在本文中,我们提出了一种新的方法来计算地平线点与模糊的方法,允许考虑用户的偏好。我们将通过本文展示如何构建一个一致的模糊模型来克服web服务组合计算的局限性。实验评估证明了所提出概念的有效性和我们实施的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信