Journal
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
Volume 24, Issue 12, Pages 1271-1295Publisher
WILEY
DOI: 10.1002/cpe.1791
Keywords
data center network (DCN); MapReduce; structure
Funding
- NSF China [60903206, 60972166, 61070216]
Ask authors/readers for more resources
Several novel data center network structures have been proposed to improve the topological properties of data centers. A common characteristic of these structures is that they are designed for supporting general applications and services. Consequently, these structures do not match well with the specific requirements of some dedicated applications. In this paper, we propose a hyper-fat-tree network (HFN): a novel data center structure for MapReduce, a well-known distributed data processing application. HFN possesses the advanced characteristics of BCube as well as fat-tree structures and naturally supports MapReduce. We then address several challenging issues that face HFN in supporting MapReduce. Mathematical analysis and comprehensive evaluation show that HFN possesses excellent properties and is indeed a viable structure for MapReduce in practice. Copyright (c) 2011 John Wiley & Sons, Ltd.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available