.png){kind=icon}
.png){kind=icon}
Return
Resource Allocation with Dynamic Substrate Network in Data Centre Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/CC.2013.6623511.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
resource allocation
data centre network
workload
substrate
algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
1.9K
Citations:
5.0K