Resource allocation with dynamic substrate network in data centre networks

Author

Li Xiaoling ; Wang Huaimin ; Ding Bo ; Li Xiaoyong ; Liu Hui

Author_Institution

Nat. Key Lab. for Parallel & Distrib. Process., Nat. Univ. of Defense Technol., Changsha, China

Volume

10

Issue

9

fYear

2013

fDate

Sept. 2013

Firstpage

130

Lastpage

142

Abstract

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

cloud computing; computer centres; computer networks; graph theory; resource allocation; GraphMap-DS; cloud providers; data centre networks; dynamic SN; dynamic substrate network; mapping algorithm; resource allocation problem; Algorithm design and analysis; Bandwidth; Database systems; Dynamic scheduling; Heuristic algorithms; Resource management; Substrates; algorithm; data centre network; resource allocation; substrate; workload;

fLanguage

English

Journal_Title

Communications, China

Publisher

ieee

ISSN

1673-5447

Type

jour

DOI

10.1109/CC.2013.6623511

Filename

6623511