Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. GA-Par: Dependable Microservice Orchestration Framework for Geo-Distributed Clouds
 
research article

GA-Par: Dependable Microservice Orchestration Framework for Geo-Distributed Clouds

Wen, Zhenyu
•
Lin, Tao  
•
Yang, Renyu
Show more
January 1, 2020
Ieee Transactions On Parallel And Distributed Systems

Recent advances in composing Cloud applications have been driven by deployments of inter-networking heterogeneous microservices across multiple Cloud datacenters. System dependability has been of the upmost importance and criticality to both service vendors and customers. Security, a measurable attribute, is increasingly regarded as the representative example of dependability. Literally, with the increment of microservice types and dynamicity, applications are exposed to aggravated internal security threats and externally environmental uncertainties. Existing work mainly focuses on the QoS-aware composition of native VM-based Cloud application components, while ignoring uncertainties and security risks among interactive and interdependent container-based microservices. Still, orchestrating a set of microservices across datacenters under those constraints remains computationally intractable. This paper describes a new dependable microservice orchestration framework GA-Par to effectively select and deploy microservices whilst reducing the discrepancy between user security requirements and actual service provision. We adopt a hybrid (both whitebox and blackbox based) approach to measure the satisfaction of security requirement and the environmental impact of network QoS on system dependability. Due to the exponential grow of solution space, we develop a parallel Genetic Algorithm framework based on Spark to accelerate the operations for calculating the optimal or near-optimal solution. Large-scale real world datasets are utilized to validate models and orchestration approach. Experiments show that our solution outperforms the greedy-based security aware method with 42.34 percent improvement. GA-Par is roughly 4x faster than a Hadoop-based genetic algorithm solver and the effectiveness can be constantly guaranteed under different application scales.

  • Details
  • Metrics
Type
research article
DOI
10.1109/TPDS.2019.2929389
Web of Science ID

WOS:000535489700009

Author(s)
Wen, Zhenyu
Lin, Tao  
Yang, Renyu
Ji, Shouling
Ranjan, Rajiv
Romanovsky, Alexander
Lin, Changting
Xu, Jie
Date Issued

2020-01-01

Publisher

IEEE COMPUTER SOC

Published in
Ieee Transactions On Parallel And Distributed Systems
Volume

31

Issue

1

Start page

129

End page

143

Subjects

Computer Science, Theory & Methods

•

Engineering, Electrical & Electronic

•

Computer Science

•

Engineering

•

service orchestration

•

dependability

•

microservice

•

placement

•

algorithm

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
MLO  
Available on Infoscience
June 11, 2020
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/169229
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés