Paper Info
Title
SPGM: an efficient algorithm for mapping MapReduce-like data-intensive applications in data centre network
Abstract
In traditional data centre network, how to efficiently allocate the virtual data centres VDCs on the physical data centre network PDCN is a challenging problem, which is denoted as GraphMap. GraphMap refers to map the virtual nodes to the substrate nodes and the virtual links to the substrate paths, respectively. The existing heuristic approaches attempt a two stage solution by solving the node mapping in a first stage and doing the link mapping in a second stage, which results in the mapping time being very large. In this paper, we propose an efficient mapping algorithm based on shortest path graph matching SPGM for online MapReduce-like data-intensive applications; the simulations show that SPGM can efficiently allocate the MapReduce-like data intensive applications on the PDCN in a much shorter time compared to the existing heuristic algorithms and maintain good performance.
Year
DOI
Venue
2013
10.1504/IJWGS.2013.054112
IJWGS
Keywords
DocType
Volume
link mapping,mapping time,physical data,node mapping,data centre network,efficient algorithm,stage solution,MapReduce-like data,MapReduce-like data-intensive application,centre network,traditional data,virtual data,efficient mapping algorithm
Journal
9
Issue
ISSN
Citations 
2
1741-1106
2
PageRank 
References 
Authors
0.37
23
4
Name
Order
Citations
PageRank
Xiaoling Li1808.02
Wang Huaimin21025121.31
bo3182.30
Xiaoyong Li4193.76