Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
BCube: a high performance, server-centric network architecture for modular data centers
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
A virtual network mapping algorithm based on subgraph isomorphism detection
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
An evaluation of alternative architectures for transaction processing in the cloud
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
The impact of virtualization on network performance of amazon EC2 data center
INFOCOM'10 Proceedings of the 29th conference on Information communications
Improving MapReduce performance in heterogeneous environments
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Seawall: performance isolation for cloud datacenter networks
HotCloud'10 Proceedings of the 2nd USENIX conference on Hot topics in cloud computing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Runtime measurements in the cloud: observing, analyzing, and reducing variance
Proceedings of the VLDB Endowment
SecondNet: a data center network virtualization architecture with bandwidth guarantees
Proceedings of the 6th International COnference
Virtual network embedding through topology-aware node ranking
ACM SIGCOMM Computer Communication Review
Designing and embedding reliable virtual infrastructures
ACM SIGCOMM Computer Communication Review
Sharing the data center network
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the Performance Variability of Production Cloud Services
CCGRID '11 Proceedings of the 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing
Managing data transfers in computer clusters with orchestra
Proceedings of the ACM SIGCOMM 2011 conference
Towards predictable datacenter networks
Proceedings of the ACM SIGCOMM 2011 conference
Tasks assignment for Grid computing
International Journal of Web and Grid Services
A spectral clustering-based optimal deployment method for scientific application in cloud computing
International Journal of Web and Grid Services
Resource allocation with multi-factor node ranking in data center networks
Future Generation Computer Systems
Hi-index | 0.00 |
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.