{"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}
引用次数: 20
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.