Virtual Network Embedding for Data Centers With Composable or Disaggregated Architectures

Virtual Network Embedding (VNE) is an important problem in network virtualization, involving the optimal allocation of resources from substrate networks to service requests in the form of Virtual Networks (VNs). This paper addresses a specific VNE problem in the context of Composable/Disaggregated Data Center (DDC) networks, characterized by the decoupling and reassembly of different resources into resource pools. Existing research on the VNE problem within Data Center (DC) networks primarily focuses on the Server-based DC (SDC) architecture. In the VNE problem within SDCs, a virtual node is typically mapped to a single server to fulfill its requirements for various resources. However, in the case of DDCs, a virtual node needs to be mapped to different resource nodes for different resources. We aim to design an optimization method to achieve the most efficient VNE within DDCs. To this end, we provide an embedding scheme that acts on each arriving VN request to embed the VN with minimized power consumption. Through this scheme, we demonstrate that we also achieve a high long-term acceptance ratio. We provide Mixed Integer Linear Programming (MILP) and scalable greedy algorithms to implement this scheme. We validate the efficiency of our greedy algorithms by comparing their performance against the MILP for small problems and demonstrate their superiority over baseline algorithms through comprehensive evaluations using both synthetic simulations and real-world Google cluster traces.