地理分布云中的qos感知服务选择

Xin Li, Jie Wu, Sanglu Lu
{"title":"地理分布云中的qos感知服务选择","authors":"Xin Li, Jie Wu, Sanglu Lu","doi":"10.1109/ICCCN.2013.6614176","DOIUrl":null,"url":null,"abstract":"As more and more services are offered in clouds, it is possible to meet the diverse demands of users via service composition. Selecting the optimal set of services, in terms of QoS, is the crucial issue when many functionally equivalent services are available. In this paper, we investigate the service selection problem under the service replica limitation constraint. The objective is to select the optimal service set which brings out the minimal response time. We estimate the communication latency with the network coordinate system. Based on the estimated latencies and service composition paradigm, our selection algorithms find the services which will result in low latency under various replica limitation constraints. We evaluate our approaches via extensive simulations, the experimental results of which show that our algorithms work efficiently.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"QoS-Aware Service Selection in Geographically Distributed Clouds\",\"authors\":\"Xin Li, Jie Wu, Sanglu Lu\",\"doi\":\"10.1109/ICCCN.2013.6614176\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As more and more services are offered in clouds, it is possible to meet the diverse demands of users via service composition. Selecting the optimal set of services, in terms of QoS, is the crucial issue when many functionally equivalent services are available. In this paper, we investigate the service selection problem under the service replica limitation constraint. The objective is to select the optimal service set which brings out the minimal response time. We estimate the communication latency with the network coordinate system. Based on the estimated latencies and service composition paradigm, our selection algorithms find the services which will result in low latency under various replica limitation constraints. We evaluate our approaches via extensive simulations, the experimental results of which show that our algorithms work efficiently.\",\"PeriodicalId\":207337,\"journal\":{\"name\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2013.6614176\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2013.6614176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

随着云中提供的服务越来越多,通过服务组合来满足用户的多样化需求成为可能。当有许多功能相同的服务可用时,就QoS而言,选择最优的服务集是关键问题。本文研究了在服务副本限制约束下的服务选择问题。目标是选择产生最小响应时间的最优服务集。我们估计了与网络坐标系的通信延迟。基于估计的延迟和服务组合范式,我们的选择算法在各种副本限制约束下找到能够产生低延迟的服务。我们通过大量的模拟来评估我们的方法,实验结果表明我们的算法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
QoS-Aware Service Selection in Geographically Distributed Clouds
As more and more services are offered in clouds, it is possible to meet the diverse demands of users via service composition. Selecting the optimal set of services, in terms of QoS, is the crucial issue when many functionally equivalent services are available. In this paper, we investigate the service selection problem under the service replica limitation constraint. The objective is to select the optimal service set which brings out the minimal response time. We estimate the communication latency with the network coordinate system. Based on the estimated latencies and service composition paradigm, our selection algorithms find the services which will result in low latency under various replica limitation constraints. We evaluate our approaches via extensive simulations, the experimental results of which show that our algorithms work efficiently.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信