Skip to Main content Skip to Navigation
Journal articles

Online Robust Placement of Service Chains for Large Data Center Topologies

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.
Complete list of metadatas

Cited literature [40 references]  Display  Hide  Download

https://hal.inria.fr/hal-02177483
Contributor : Thierry Turletti <>
Submitted on : Tuesday, July 9, 2019 - 9:32:12 AM
Last modification on : Monday, May 4, 2020 - 11:39:32 AM

File

Robust_Placement_of_Service_Ch...
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

99

Files downloads

726