Online Robust Placement of Service Chains for Large Data Center Topologies - Archive ouverte HAL Access content directly
Journal Articles IEEE Access Year : 2019

Online Robust Placement of Service Chains for Large Data Center Topologies

(1) , (1) , (1)
1

Abstract

The trend today is to deploy applications and more generally Service Function Chains (SFCs) in public clouds. However, before being deployed in the cloud, chains were deployed on dedicated infrastructures where software, hardware, and network components were managed by the same entity, making it straightforward to provide robustness guarantees. By moving their services to the cloud, the users lose their control on the infrastructure and hence on the robustness. In this paper, we provide an online algorithm for robust placement of service chains in data centers. Our placement algorithm determines the required number of replicas for each function of the chain and their placement in the data center. Our simulations on large data-center topologies with up to 30,528 nodes show that our algorithm is fast enough such that one can consider robust chain placements in real time even in a very large data center and without the need of prior knowledge on the demand distribution.
Fichier principal
Vignette du fichier
Robust_Placement_of_Service_Chains_in_Data_Center_Topologies_v2(1).pdf (1.59 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02177483 , version 1 (09-07-2019)

Identifiers

Cite

Ghada Moualla, Thierry Turletti, Damien Saucez. Online Robust Placement of Service Chains for Large Data Center Topologies. IEEE Access, inPress, pp.13. ⟨10.1109/ACCESS.2019.2914635⟩. ⟨hal-02177483⟩
64 View
158 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More