Resource allocation with dynamic substrate network in data centre networks

The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network (SN) which are provided by the cloud providers. Existing studies consider the dynamic arrival and departure of the workloads, while the dynamics of the substrate are ignored. In this paper, we first propose the resource allocation with the dynamic SN, and denote it as GraphMap-DS. Then, we propose an efficient mapping algorithm for GraphMap-DS. The performance of the proposed algorithm is evaluated by performing simulation experiments. Our results show that the proposed algorithm can effectively solve the GraphMap-DS.