CloudScout: A Non-Intrusive Approach to Service Dependency Discovery

被引:23
作者
Yin, Jianwei [1 ]
Zhao, Xinkui [1 ]
Tang, Yan [1 ]
Zhi, Chen [1 ]
Chen, Zuoning [2 ]
Wu, Zhaohui [1 ]
机构
[1] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Zhejiang, Peoples R China
[2] Chinese Acad Engn, Natl Parallel Comp Engn Res Ctr, Beijing 100088, Peoples R China
基金
中国国家自然科学基金;
关键词
Monitoring data analysis; log mining; service dependency discovery; VM consolidation;
D O I
10.1109/TPDS.2016.2619715
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Nowadays, numerous enterprises are migrating their applications into cloud computing environments. Typically, the applications are composed of several dependent service components that span many hosts and network devices. In light of this, exploring the dependency between service components can be beneficial for achieving fast network application response time. Moreover, it is significant to consolidate service components according to resource constraints, service dependency, and network structure. However, it is a tedious task to discover the dependency among service components without expert knowledge of the running application. In this paper, we propose CloudScout, a non-intrusive approach that is capable of automatically discovering dependent service components. CloudScout analyzes the correlation among service components based on the time-series information from system monitoring logs. We address two key challenges in CloudScout: service distance calculation and dependent service clustering. We conduct experiments on five applications with 290 service components that span 20 physical hosts across two data centers. The experimental results demonstrate that CloudScout can successfully discover the dependency among service components and facilitate reducing the network latency of network applications and distributed applications.
引用
收藏
页码:1271 / 1284
页数:14
相关论文
共 27 条
[1]  
Aguilera M. K., 2003, Operating Systems Review, V37, P74, DOI 10.1145/1165389.945454
[2]  
[Anonymous], 2008, PROC OSDI
[3]  
[Anonymous], 2005, SIGMETRICS Perform. Eval. Rev, DOI DOI 10.1145/1071690.1064252
[4]  
Apte R., 2010, P 2 USENIX C HOT TOP, P17
[5]   Towards highly reliable enterprise network services via inference of multi-level dependencies [J].
Bahl, Paramvir ;
Chandra, Ranveer ;
Greenberg, Albert ;
Kandula, Srikanth ;
Maltz, David A. ;
Zhang, Ming .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) :13-24
[6]  
Barham P, 2004, USENIX ASSOCIATION PROCEEDINGS OF THE SIXTH SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION (OSDE '04), P259
[7]  
Biran O., 2012, Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2012), P498, DOI 10.1109/CCGrid.2012.119
[8]   Pinpoint: Problem determination in large, dynamic Internet services [J].
Chen, MY ;
Kiciman, E ;
Fratkin, E ;
Fox, A ;
Brewer, E .
INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2002, :595-604
[9]   Fay: Extensible Distributed Tracing from Kernels to Clusters [J].
Erlingsson, Ulfar ;
Peinado, Marcus ;
Peter, Simon ;
Budiu, Mihai ;
Mainar-Ruiz, Gloria .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2012, 30 (04)
[10]  
Hu L., 2012, Proceedings of the 9th international conference on Autonomic computing, P3