Co-locating ContainerizedWorkload Using Service Mesh Telemetry

被引:10
作者
Cao, Lianjie [1 ]
Sharma, Puneet [1 ]
机构
[1] Hewlett Packard Labs, Palo Alto, CA 94304 USA
来源
PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON EMERGING NETWORKING EXPERIMENTS AND TECHNOLOGIES, CONEXT 2021 | 2021年
关键词
Cloud computing; Service mesh; Microservice; ALGORITHM;
D O I
10.1145/3485983.3494867
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The cloud-native architecture and container-based technologies are revolutionizing how online services and applications are designed, developed, and managed by offering better elasticity and flexibility to developers and operators. However, the increasing adoption of microservice and serverless designs makes application workload more decomposed and transient at a larger scale. Most existing container orchestration systems still manage application workload based on simple system-level resource usage and policies manually created by operators, leading to ineffective application-agnostic scheduling and extra management burden for operators. In this work, we focus on workload placement for containerized applications and services and argue for the integration of application-level telemetry for profiling application status and colocating application workload. To avoid extra performance overhead and modifications to existing applications, we propose to use the telemetry collected by service mesh to model the application communication patterns with a graph-based representation. By applying a graph partitioning algorithm, we create co-location groups for application workload that minimize cross-group communication traffic to improve the overall application performance, i.e., response time. Our preliminary experiments with a realistic online e-commerce application show that our solution can reduce the average response time by up to 58% compared to the default Kubernetes scheduler.
引用
收藏
页码:168 / 174
页数:7
相关论文
共 28 条
[1]  
[Anonymous], about us
[2]  
[Anonymous], about us
[3]  
[Anonymous], about us
[4]  
BARNARD ST, 1993, PROCEEDINGS OF THE SIXTH SIAM CONFERENCE ON PARALLEL PROCESSING FOR SCIENTIFIC COMPUTING, VOLS 1 AND 2, P711
[5]   ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping [J].
Chowdhury, Mosharaf ;
Rahman, Muntasir Raihan ;
Boutaba, Raouf .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (01) :206-219
[6]  
cloud.google, Knative
[7]  
cloudify, Migrating pods with containerized applications between nodes in the same kubernetes cluster using cloudify
[8]  
dtc.umn, Metis-serial graph partitioning and fill-reducing matrix ordering
[9]  
github, Online boutique-microservice demo application
[10]   AN IMPROVED SPECTRAL GRAPH PARTITIONING ALGORITHM FOR MAPPING PARALLEL COMPUTATIONS [J].
HENDRICKSON, B ;
LELAND, R .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1995, 16 (02) :452-469