SPGM: an efficient algorithm for mapping MapReduce-like data-intensive applications in data centre network Online publication date: Mon, 29-Sep-2014
by Xiaoling Li; Huaimin Wang; Bo Ding; Xiaoyong Li
International Journal of Web and Grid Services (IJWGS), Vol. 9, No. 2, 2013
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.
Online publication date: Mon, 29-Sep-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org