A Distance-based Genetic Algorithm for Robust Data-intensive Web Service Composition in Dynamic Bandwidth Environment

Soheila Sadeghiram, Hui Ma, Gang Chen
{"title":"A Distance-based Genetic Algorithm for Robust Data-intensive Web Service Composition in Dynamic Bandwidth Environment","authors":"Soheila Sadeghiram, Hui Ma, Gang Chen","doi":"10.1109/SCC49832.2020.00040","DOIUrl":null,"url":null,"abstract":"With the complex needs of the companies that cannot be met by a single service, Data-intensive Web Service Composition (DWSC) is required to compose multiple services in a distributed service environment. Compositions must satisfy functional specifications and non-functional requirements, i.e. Quality of Service (QoS). Existing approaches on DWSC make the underlying assumption that the participating Web services and communication networks are static so that their QoS and bandwidth seldom change. However, those approaches are impractical since network failures or dynamic bandwidth changes cause violations of user agreements. Additionally, they ignore the distribution of services in general, and therefore, variations in network attributes are not taken into account. In this paper, we address the problem of dynamic distributed DWSC (D2-DWSC), design a simulation model for bandwidth patterns, and propose an algorithm to generate robust solutions for D2-DWSC which can cope with the changes in dynamic environments. Experimental results verify the effectiveness of our method.","PeriodicalId":274909,"journal":{"name":"2020 IEEE International Conference on Services Computing (SCC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Services Computing (SCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC49832.2020.00040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

With the complex needs of the companies that cannot be met by a single service, Data-intensive Web Service Composition (DWSC) is required to compose multiple services in a distributed service environment. Compositions must satisfy functional specifications and non-functional requirements, i.e. Quality of Service (QoS). Existing approaches on DWSC make the underlying assumption that the participating Web services and communication networks are static so that their QoS and bandwidth seldom change. However, those approaches are impractical since network failures or dynamic bandwidth changes cause violations of user agreements. Additionally, they ignore the distribution of services in general, and therefore, variations in network attributes are not taken into account. In this paper, we address the problem of dynamic distributed DWSC (D2-DWSC), design a simulation model for bandwidth patterns, and propose an algorithm to generate robust solutions for D2-DWSC which can cope with the changes in dynamic environments. Experimental results verify the effectiveness of our method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
动态带宽环境下基于距离的鲁棒数据密集型Web服务组合遗传算法
由于单个服务无法满足公司的复杂需求,因此需要使用数据密集型Web服务组合(DWSC)在分布式服务环境中组合多个服务。组合必须满足功能规范和非功能需求,即服务质量(QoS)。现有的DWSC方法基本假设参与的Web服务和通信网络是静态的,因此它们的QoS和带宽很少变化。然而,这些方法是不切实际的,因为网络故障或动态带宽变化会导致违反用户协议。此外,它们通常忽略了服务的分布,因此没有考虑到网络属性的变化。本文针对动态分布式DWSC (D2-DWSC)的问题,设计了带宽模式的仿真模型,并提出了一种算法来生成能够应对动态环境变化的D2-DWSC鲁棒解。实验结果验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the SCC 2020 Chairs A Process Convergence Approach for Crossover Services based on Message Flow Partition and Merging SCC 2020 Organizing Commitee An IoT-owned Service for Global IoT Device Discovery, Integration and (Re)use PETA: Privacy Enabled Task Allocation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1