SCDA: SLA-aware Cloud Datacenter Architecture for Efficient Content Storage and Retrieval

被引:1
作者
Kassa, Debessay Fesehaye [1 ]
Nahrstedt, Klara [1 ]
机构
[1] Univ Illinois, Dept Comp Sci, Champaign, IL 61820 USA
来源
2014 IEEE 7TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD) | 2014年
关键词
D O I
10.1109/CLOUD.2014.26
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With the fast growth of (online) content and the need for high quality content services, cloud data centers are increasingly becoming the preferred places to store data and retrieve it from. With a highly variable network traffic and limited resources, efficient server selection and data transfer rate allocation mechanisms become necessary. However, current approaches rely on random server selection schemes and inefficient data transmission rate control mechanisms. In this paper we present SCDA, an efficient server selection, resource allocation and enforcement mechanism with many salient features. SCDA has prioritized rate allocation mechanism to satisfy different service level agreements (SLA)s on throughput and delays. The allocation scheme can achieve max/min fairness. SCDA has a mechanism to detect and hence mitigate SLA violation in realtime. We have implemented SCDA in the NS2 simulator. Extensive experimental results confirm sonic of the design goals of SCDA to obtain a lower content transfer time and a higher throughput. The design of SCDA can achieve a content transfer time which is about 50% lower than the existing schemes and a throughput which is higher than existing approaches by upto than 60%.
引用
收藏
页码:120 / 127
页数:8
相关论文
共 22 条
[1]  
Al-Fares M., 2010, Hedera: dynamic flow scheduling for data center networks, P19
[2]   A scalable, commodity data center network architecture [J].
Al-Fares, Mohammad ;
Loukissas, Alexander ;
Vahdat, Amin .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (04) :63-74
[3]  
[Anonymous], 2011, P 20 INT C WORLD WID
[4]  
[Anonymous], 2000, ANAL EQUAL COST MULT
[5]  
[Anonymous], 2003, P 19 ACM S OP SYST P, DOI [10.1145/1165389.945450, DOI 10.1145/1165389.945450]
[6]  
Benson T., P IMC 10 MELB AUSTR, P267
[7]  
Benson Theophilus., 2011, SoCC, P8
[8]  
Cheng X, 2008, INT WORKSH QUAL SERV, P249
[9]   Why flow-completion time is the right metric for congestion control [J].
Dukkipati, N ;
McKeown, N .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (01) :59-62
[10]  
Fesehaye D., 2013, 012013 UIUC