Paper Info
Title
An Efficient Online Placement Scheme for Cloud Container Clusters
Abstract
Containers represent an agile alternative to virtual machines (VMs), for providing cloud computing services. Containers are more flexible and lightweight, and can be easily instrumented. Enterprise users often create clusters of inter-connected containers to provision complex services. Compared to traditional cloud services, key challenges in container cluster (CC) provisioning lie in the optimal placement of containers while considering inter-container traffic in a CC. The challenge further escalates, when CCs are provisioned in an online fashion. We propose an online algorithm to address the above challenges, aiming to maximize the aggregate value of all served clusters. We first study a one-shot CC placement problem. Leveraging techniques of exhaustive sampling and ST rounding, we design an efficient one-shot algorithm to determine the placement scheme of a given CC. We then propose a primal-dual online placement scheme that employs the one-shot algorithm as a building block to make decisions upon the arrival of each CC request. Through both theoretical analysis and trace-driven simulations, we verify that the online placement algorithm is computationally efficient and achieves a good competitive ratio.
Year
DOI
Venue
2019
10.1109/JSAC.2019.2906745
IEEE Journal on Selected Areas in Communications
Keywords
Field
DocType
Cloud container clusters,online algorithms,compact exponential optimization
Online algorithm,Virtual machine,Computer science,Computer network,Provisioning,Rounding,Agile software development,Sampling (statistics),Competitive analysis,Cloud computing
Journal
Volume
Issue
ISSN
37
5
0733-8716
Citations 
PageRank 
References 
3
0.40
0
Authors
3
Name
Order
Citations
PageRank
Ruiting Zhou17315.91
Zongpeng Li22054153.21
Chuan Wu31594107.96