Online Robust Placement of Service Chains for Large Data Center Topologies
- Others:
- Design, Implementation and Analysis of Networking Architectures (DIANA) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
- ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011)
Description
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.
Abstract
International audience
Additional details
- URL
- https://hal.inria.fr/hal-02177483
- URN
- urn:oai:HAL:hal-02177483v1
- Origin repository
- UNICA