Litcius/Paper detail

Blender: A Container Placement Strategy by Leveraging Zipf-Like Distribution Within Containerized Data Centers

Zhaorui Wu, Yuhui Deng, Hao Feng, Yi Zhou, Geyong Min, Zhen Zhang

2021IEEE Transactions on Network and Service Management24 citationsDOI

Abstract

Instantiated containers of an application are distributed across multiple Physical Machines (PMs) to achieve high parallel performance. Container placement plays a vital role in network traffic and the performance of containerized data centers. Existing container placement techniques are inadequate due to the ignorance of container traffic patterns. To solve this issue, we first investigate the network traffic between containers and observe that it exhibits a Zipf-like distribution. Motivated by this finding, we propose a novel container placement approach- <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Blender</i> -by taking into account the Zipf-like distribution. Blender employs two algorithms called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RefineAlg</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SplitAlg</i> to divide containers of applications into blocks, and place these blocks across Virtual Machines (VMs). Blender exhibits two salient features: (i) it minimizes inter-block traffic by arranging the containers that communicate frequently in the same block. (ii) it achieves good load balancing by combining complementary blocks that request different resource types (e.g., <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">CPU-intensive</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">memory-intensive</i> blocks) and distributing these blocks across multiple VMs. The experimental results show that Blender significantly reduces communication traffic and network latency. In particular, Blender reduces the traffic of SBP and CA-WFD by 22% and 32%, respectively. Blender decreases network latency by 16% and 26% compared to SBP and CA-WFD. Furthermore, with Blender in place, the physical resources of hosting PMs are well balanced and utilized.

Topics & Concepts

Computer scienceZipf's lawContainer (type theory)Block (permutation group theory)MathematicsStatisticsGeometryEngineeringMechanical engineeringCloud Computing and Resource ManagementCaching and Content DeliverySoftware-Defined Networks and 5G
Blender: A Container Placement Strategy by Leveraging Zipf-Like Distribution Within Containerized Data Centers | Litcius