QoS-aware service replication

Kun You, Zhuzhong Qian, Bin Tang, Sanglu Lu, Daoxu Chen
{"title":"QoS-aware service replication","authors":"Kun You, Zhuzhong Qian, Bin Tang, Sanglu Lu, Daoxu Chen","doi":"10.1145/1640206.1640214","DOIUrl":null,"url":null,"abstract":"Service composition is a useful technique to assemble light, independent services to meet the complicated and dynamic requirements. Previous research has addressed the quality-of-service (QoS) aware composition path selection problem. However, as the requests growing, the selected service composition path may violate the QoS requirements. In this case, more service replicas should be deployed on suitable nodes to improve the QoS. But which service component should be selected and where these service replicas should be deployed is a challenge. In this paper, we make a deep study on this service replication problem. We give a detailed description of service replication triggering time. And then, we propose LDCS (<u>L</u>ongest <u>D</u>elay Service <u>C</u>omponent <u>S</u>election) to select the bottle-neck service component by evaluating the real-time performance of all these components. Finally, we employ MACP (<u>M</u>aximum <u>A</u>vailable <u>C</u>apacity <u>P</u>ath) algorithm to select a suitable node to deploy this service replica. Simulation results approve that our approach is effective and efficient.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1640206.1640214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Service composition is a useful technique to assemble light, independent services to meet the complicated and dynamic requirements. Previous research has addressed the quality-of-service (QoS) aware composition path selection problem. However, as the requests growing, the selected service composition path may violate the QoS requirements. In this case, more service replicas should be deployed on suitable nodes to improve the QoS. But which service component should be selected and where these service replicas should be deployed is a challenge. In this paper, we make a deep study on this service replication problem. We give a detailed description of service replication triggering time. And then, we propose LDCS (Longest Delay Service Component Selection) to select the bottle-neck service component by evaluating the real-time performance of all these components. Finally, we employ MACP (Maximum Available Capacity Path) algorithm to select a suitable node to deploy this service replica. Simulation results approve that our approach is effective and efficient.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
支持qos的服务复制
服务组合是一种有用的技术,用于组装轻量级、独立的服务,以满足复杂和动态的需求。以往的研究已经解决了服务质量(QoS)感知的组合路径选择问题。然而,随着请求的增长,所选择的服务组合路径可能会违反QoS要求。在这种情况下,应该在合适的节点上部署更多的服务副本,以提高QoS。但是应该选择哪个服务组件以及应该在哪里部署这些服务副本是一个挑战。本文对该服务复制问题进行了深入的研究。详细描述了服务复制触发时间。然后,我们提出了LDCS(最长延迟服务组件选择),通过评估所有组件的实时性能来选择瓶颈服务组件。最后,我们采用MACP (Maximum Available Capacity Path)算法选择合适的节点来部署该服务副本。仿真结果证明了该方法的有效性和高效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Internetware 2022: 13th Asia-Pacific Symposium on Internetware, Hohhot, China, June 11 - 12, 2022 Internetware'20: 12th Asia-Pacific Symposium on Internetware, Singapore, November 1-3, 2020 Internetware '19: The 11th Asia-Pacific Symposium on Internetware, Fukuoka, Japan, October 28-29, 2019 RepoLike: personal repositories recommendation in social coding communities Effa: a proM plugin for recovering event logs
×
引用
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