Deep Learning-Based Data Storage for Low Latency in Data Center Networks

被引:36
作者
Liao, Zhuofan [1 ,2 ]
Zhang, Ruiming [1 ,2 ]
He, Shiming [1 ,2 ]
Zeng, Daojian [1 ,2 ]
Wang, Jin [1 ,2 ,3 ]
Kim, Hye-Jin [4 ]
机构
[1] Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Changsha 410114, Hunan, Peoples R China
[2] Changsha Univ Sci & Technol, Hunan Prov Key Lab Intelligent Proc Big Data Tran, Changsha 410114, Hunan, Peoples R China
[3] Fujian Univ Technol, Sch Informat Sci & Engn, Fuzhou 350002, Fujian, Peoples R China
[4] Sungshin Womens Univ, Business Adm Res Inst, Seoul 02844, South Korea
基金
中国国家自然科学基金;
关键词
Data center networks; data storage; deep learning; k-means; DATA PLACEMENT; COVERAGE;
D O I
10.1109/ACCESS.2019.2901742
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Low-latency data access is becoming an upcoming and increasingly important challenge. The proper placement of data blocks can reduce data travel among distributed storage systems, which contributes significantly to the latency reduction. However, the dominant data placement optimization has primarily relied on prior known data requests or static initial data distribution, which ignores the dynamics of clients' data access requests and networks. The learning technology can help the data center networks (DCNs) learn from historical access information and make optimal data storage decision. Consider a more practical DCNs with fat-tree topology, we utilize a deep-learning technology k-means to help store data blocks and then improve the read and write latency of the DCN, where k is the number of cores in the fat-tree. The evaluation results demonstrate that the average write and read latency of the whole system can be lowered by 33% and 45%, respectively. And the best set of parameter k is analyzed and recommended to provide guidance to the real application, which is equal to the number of cores in the DCNs.
引用
收藏
页码:26411 / 26417
页数:7
相关论文
共 33 条
[1]  
Agarwal S., 2010, P USENIX NSDI, P1
[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]  
ALIZADEH M, 2014, P 2014 ACM C SIGC, V44, P503, DOI DOI 10.1145/2619239.2626316
[4]  
[Anonymous], IEEE T SERVICES COMP
[5]  
[Anonymous], 2011, 30 IEEE INT PERF COM
[6]  
[Anonymous], 2014, P 26 INT C SCI STAT
[7]   A View of Cloud Computing [J].
Armbrust, Michael ;
Fox, Armando ;
Griffith, Rean ;
Joseph, Anthony D. ;
Katz, Randy ;
Konwinski, Andy ;
Lee, Gunho ;
Patterson, David ;
Rabkin, Ariel ;
Stoica, Ion ;
Zaharia, Matei .
COMMUNICATIONS OF THE ACM, 2010, 53 (04) :50-58
[8]   APPROXIMATION ALGORITHMS FOR DATA PLACEMENT PROBLEMS [J].
Baev, Ivan ;
Rajaraman, Rajmohan ;
Swamy, Chaitanya .
SIAM JOURNAL ON COMPUTING, 2008, 38 (04) :1411-1429
[9]   Leveraging Endpoint Flexibility in Data-Intensive Clusters [J].
Chowdhury, Mosharaf ;
Kandula, Srikanth ;
Stoica, Ion .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04) :231-242
[10]   Composition-Driven IoT Service Provisioning in Distributed Edges [J].
Deng, Shuiguang ;
Xiang, Zhengzhe ;
Yin, Jianwei ;
Taheri, Javid ;
Zomaya, Albert Y. .
IEEE ACCESS, 2018, 6 :54258-54269