Two-steps QoS-aware services composition algorithm for Internet of Things

Mohamed Essaid Khanouche, Sihem Mouloudj, Melissa Hammoum
{"title":"Two-steps QoS-aware services composition algorithm for Internet of Things","authors":"Mohamed Essaid Khanouche, Sihem Mouloudj, Melissa Hammoum","doi":"10.1145/3341325.3342017","DOIUrl":null,"url":null,"abstract":"The Internet of Things (IoT) is a global infrastructure that provides services having similar functionality but with different quality of service (QoS). The fast growing of these services leads to a difficulty of selecting the most appropriate services to fulfill a complex user's requirement. It is therefore necessary to automate the mechanism for selecting the appropriate services in order to satisfy both functional and non-functional user's requirements. In this paper, a two-steps QoS-aware services composition algorithm (TS-QCA) based on clustering and shuffled frog leaping algorithm (SFLA) is proposed in the context of large-scale IoT environments. This approach aims at minimizing the composition time through accelerating the algorithm convergence by using the clustering technique and the exploitation of the parallel aspect of the SFLA algorithm. The simulation results demonstrate that the proposed algorithm is scalable and achieves a near-to-optimal composition in a reduced amount of composition in comparison to other services composition approaches proposed in the literature.","PeriodicalId":178126,"journal":{"name":"Proceedings of the 3rd International Conference on Future Networks and Distributed Systems","volume":"os-53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on Future Networks and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3341325.3342017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The Internet of Things (IoT) is a global infrastructure that provides services having similar functionality but with different quality of service (QoS). The fast growing of these services leads to a difficulty of selecting the most appropriate services to fulfill a complex user's requirement. It is therefore necessary to automate the mechanism for selecting the appropriate services in order to satisfy both functional and non-functional user's requirements. In this paper, a two-steps QoS-aware services composition algorithm (TS-QCA) based on clustering and shuffled frog leaping algorithm (SFLA) is proposed in the context of large-scale IoT environments. This approach aims at minimizing the composition time through accelerating the algorithm convergence by using the clustering technique and the exploitation of the parallel aspect of the SFLA algorithm. The simulation results demonstrate that the proposed algorithm is scalable and achieves a near-to-optimal composition in a reduced amount of composition in comparison to other services composition approaches proposed in the literature.
面向物联网的两步qos感知服务组合算法
物联网(IoT)是一个全球性的基础设施,提供具有类似功能但具有不同服务质量(QoS)的服务。这些服务的快速增长导致了选择最合适的服务来满足复杂用户需求的困难。因此,有必要自动化选择适当服务的机制,以满足功能性和非功能性用户的需求。在大规模物联网环境下,提出了一种基于聚类和shuffle frog leapalgorithm (SFLA)的两步qos感知服务组合算法(TS-QCA)。该方法利用聚类技术和SFLA算法的并行性来加速算法收敛,从而最大限度地减少合成时间。仿真结果表明,与文献中提出的其他服务组合方法相比,该算法具有可扩展性,并且在减少组合量的情况下实现了接近最优的组合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信