An Optimal Approach for Web Service Selection

Pal Bagtharia, M. H. Bohra
{"title":"An Optimal Approach for Web Service Selection","authors":"Pal Bagtharia, M. H. Bohra","doi":"10.1145/2983402.2983436","DOIUrl":null,"url":null,"abstract":"With the rapid growth in cloud computing and service computing, Web Services have combined to form the composite service. For achieving desired functionality, it is vital to select a particular service which offers similar functionality and while selecting a service, a decision should rely on the relevant Quality of Service(QoS) attributes. Emphasis is being placed on how to find an optimal service which satisfies both the functional and non-functional requirements. Existing approaches either ignore the role of requestors non-functional requirement or assigns an arbitrary value to the constraints to be considered. In this paper, we first formulate the problem mathematically by greedy approach then, generate the optimal solution for the input of service composition. For a large dataset problem of web service,use of quadratic equation is proposed. By simulation,we conclude that by using more than one heuristic approaches,more relevant and optimal results are possible if we use the summing of Z-score and decimal scaling than the min max normalization and a quadratic assignment.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"324 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third International Symposium on Computer Vision and the Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2983402.2983436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

With the rapid growth in cloud computing and service computing, Web Services have combined to form the composite service. For achieving desired functionality, it is vital to select a particular service which offers similar functionality and while selecting a service, a decision should rely on the relevant Quality of Service(QoS) attributes. Emphasis is being placed on how to find an optimal service which satisfies both the functional and non-functional requirements. Existing approaches either ignore the role of requestors non-functional requirement or assigns an arbitrary value to the constraints to be considered. In this paper, we first formulate the problem mathematically by greedy approach then, generate the optimal solution for the input of service composition. For a large dataset problem of web service,use of quadratic equation is proposed. By simulation,we conclude that by using more than one heuristic approaches,more relevant and optimal results are possible if we use the summing of Z-score and decimal scaling than the min max normalization and a quadratic assignment.
Web服务选择的最优方法
随着云计算和服务计算的快速发展,Web服务组合形成了复合服务。为了实现所需的功能,选择提供类似功能的特定服务是至关重要的,在选择服务时,决策应依赖于相关的服务质量(QoS)属性。重点是如何找到既满足功能需求又满足非功能需求的最佳服务。现有的方法要么忽略请求者非功能性需求的角色,要么为要考虑的约束分配一个任意值。本文首先用贪心法对问题进行数学表述,然后给出服务组合输入的最优解。针对web服务的大数据集问题,提出了二次方程的应用。通过模拟,我们得出结论,通过使用多种启发式方法,如果我们使用z分数和十进制缩放的总和,而不是最小最大归一化和二次赋值,则可能获得更相关和最优的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信