H. Yabusaki, Hiroshi Nakagoe, Koichi Murayama, Takatoshi Kato
{"title":"Wide area tentative scaling (WATS) for quick response in distributed cloud computing","authors":"H. Yabusaki, Hiroshi Nakagoe, Koichi Murayama, Takatoshi Kato","doi":"10.1109/INFCOMW.2014.6849164","DOIUrl":null,"url":null,"abstract":"As cloud computing is increasingly adopted by enterprises, a stringent service level agreement such as response time is required by the cloud in order to run business applications. This can be problematic because activity from geographically distributed terminals owing to globalization often increases the average response time. Federating various clouds enables to utilize datacenters in various geographical regions regardless of their servicers. The response time can be reduced by replicating the applications and related data at datacenters near the terminals by considering the factors of delay (e.g., data synchronization, distribution of multi-tier applications, and influence of other applications). However, it is unrealistic to accurately analyze all of the factors without any errors. We propose wide area tentative scaling (WATS) to improve the response time in a phased manner by repetitively replicate a part of the application and related data at other datacenters and selecting a better organization. The WATS approach is to repetitively change the organization to reduce the response time even if the analysis is incorrect, unlike mathematical-formulae-based approaches that require precise analysis. The drawback of this approach is that it consumes more computing resources due to repeating the replication. We therefore, applied Bayesian inference to search for a better organization with fewer trials. Evaluation results showed that WATS successfully reduced the response time in a phased manner.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"31-36"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2014.6849164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
As cloud computing is increasingly adopted by enterprises, a stringent service level agreement such as response time is required by the cloud in order to run business applications. This can be problematic because activity from geographically distributed terminals owing to globalization often increases the average response time. Federating various clouds enables to utilize datacenters in various geographical regions regardless of their servicers. The response time can be reduced by replicating the applications and related data at datacenters near the terminals by considering the factors of delay (e.g., data synchronization, distribution of multi-tier applications, and influence of other applications). However, it is unrealistic to accurately analyze all of the factors without any errors. We propose wide area tentative scaling (WATS) to improve the response time in a phased manner by repetitively replicate a part of the application and related data at other datacenters and selecting a better organization. The WATS approach is to repetitively change the organization to reduce the response time even if the analysis is incorrect, unlike mathematical-formulae-based approaches that require precise analysis. The drawback of this approach is that it consumes more computing resources due to repeating the replication. We therefore, applied Bayesian inference to search for a better organization with fewer trials. Evaluation results showed that WATS successfully reduced the response time in a phased manner.