Dcell: a scalable and fault-tolerant network structure for data centers
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
A fundamental challenge in data center networking is how to efficiently interconnect an exponentially increasing number of servers. This paper presents DCell, a novel network structure that has many desirable features for data center networking. DCell is a recursively defined structure, in which a high-level DCell is constructed from many low-level DCells and DCells at the same level are fully connected with one another. DCell scales doubly exponentially as the node degree increases. DCell is fault tolerant since it does not have single point of failure and its distributed fault-tolerant routing protocol performs near shortest-path routing even in the presence of severe link or node failures. DCell also provides higher network capacity than the traditional tree-based structure for various types of services. Furthermore, DCell can be incrementally expanded and a partial DCell provides the same appealing features. Results from theoretical analysis, simulations, and experiments show that DCell is a viable interconnection structure for data centers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
Leighton, F. T. (1991) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,460
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 · doi:10.1145/1272996.1273005 · Cited by 2,432
Bigtable: a distributed storage system for structured data
Chang, F. W., Dean, J. B., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2006) · doi:10.5555/1298455.1298475 · Cited by 1,928
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles · doi:10.1145/945445.945450 · Cited by 1,423
A group-theoretic model for symmetric interconnection networks
Akers, S. B., & Krishnamurthy, B. (1989) · IEEE Transactions on Computers · doi:10.1109/12.21148 · Cited by 1,231
Postel, J. B. (1981) · Cited by 1,130
Cited by
Cloud computing: state-of-the-art and research challenges
Zhang, Q., Cheng, L., & Boutaba, R. (2010) · Journal of Internet Services and Applications · doi:10.1007/s13174-010-0007-6 · Cited by 3,515
Network traffic characteristics of data centers in the wild
Benson, T., Akella, A., & Maltz, D. A. (2010) · Proceedings of the 10th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1879141.1879175 · Cited by 2,214
VL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592576 · Cited by 2,111
The cost of a cloud: research problems in data center networks
Greenberg, A., Hamilton, J., Maltz, D. A., & Patel, P. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1496091.1496103 · Cited by 1,621
Hedera: dynamic flow scheduling for data center networks
Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., & Vahdat, A. M. (2010) · doi:10.5555/1855711.1855730 · Cited by 1,450
BCube: a high performance, server-centric network architecture for modular data centers
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., & Lu, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592577 · Cited by 1,372
Self-citation(2010) · doi:10.5555/1855711.1855728 · Cited by 970
Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement
Meng, X., Pappas, V., & Zhang, L. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461930 · Cited by 935
PortLand: a scalable fault-tolerant layer 2 data center network fabric
Niranjan Mysore, R., Pamboris, A., Farrington, N., Huang, N., Miri, P., Radhakrishnan, S., Subramanya, V., & Vahdat, A. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592575 · Cited by 929
Helios: a hybrid electrical/optical switch architecture for modular data centers
Farrington, N., Porter, G., Radhakrishnan, S., Bazzaz, H. H., Subramanya, V., Fainman, Y., Papen, G., & Vahdat, A. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851223 · Cited by 918
Understanding network failures in data centers: measurement, analysis, and implications
Gill, P., Jain, N., & Nagappan, N. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018477 · Cited by 714
XORing elephants: novel erasure codes for big data
Sathiamoorthy, M., Asteris, M., Papailiopoulos, D., Dimakis, A. G., Vadali, R., Chen, S., & Borthakur, D. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2535573.2488339 · Cited by 689
c-Through: part-time optics in data centers
Wang, G., Andersen, D. G., Kaminsky, M., Papagiannaki, K., Ng, T. S. E., Kozuch, M., & Ryan, M. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851222 · Cited by 653
MicroTE: fine grained traffic engineering for data centers
Benson, T., Anand, A., Akella, A., & Zhang, M. (2011) · Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies · doi:10.1145/2079296.2079304 · Cited by 604
Better never than late: meeting deadlines in datacenter networks
Wilson, C., Ballani, H., Karagiannis, T., & Rowtron, A. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018443 · Cited by 579
FAWN: a fast array of wimpy nodes
Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629577 · Cited by 561
Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network
Singh, A., Ong, J., Agarwal, A., Anderson, G., Armistead, A., Bannon, R., Boving, S., Desai, G., Felderman, B., Germano, P., et al. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787508 · Cited by 556
GreenCloud: a packet-level simulator of energy-aware cloud computing data centers
Kliazovich, D., Bouvry, P., & Khan, S. U. (2012) · The Journal of Supercomputing · doi:10.1007/s11227-010-0504-1 · Cited by 553
Managing data transfers in computer clusters with orchestra
Chowdhury, M., Zaharia, M., Ma, J., Jordan, M. I., & Stoica, I. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018448 · Cited by 543
Reproducible network experiments using container-based emulation
Handigol, N., Heller, B., Jeyakumar, V., Lantz, B., & McKeown, N. (2012) · Proceedings of the 8th international conference on Emerging networking experiments and technologies · doi:10.1145/2413176.2413206 · Cited by 506
Verma, S., Kawamoto, Y., Fadlullah, Z. M., Nishiyama, H., & Kato, N. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2694469 · Cited by 422
DeTail: reducing the flow completion time tail in datacenter networks
Zats, D., Das, T., Mohan, P., Borthakur, D., & Katz, R. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342390 · Cited by 383
Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network
Singh, A., Ong, J., Agarwal, A., Anderson, G., Armistead, A., Bannon, R., Boving, S., Desai, G., Felderman, B., Germano, P., et al. (2015) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2829988.2787508 · Cited by 345
Understanding network failures in data centers: measurement, analysis, and implications
Gill, P., Jain, N., & Nagappan, N. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2043164.2018477 · Cited by 304
GreenCloud: A Packet-Level Simulator of Energy-Aware Cloud Computing Data Centers
Kliazovich, D., Bouvry, P., Audzevich, Y., & Khan, S. U. (2010) · 2010 IEEE Global Telecommunications Conference GLOBECOM 2010 · doi:10.1109/glocom.2010.5683561 · Cited by 299
Cloud Computing: Survey on Energy Efficiency
Mastelic, T., Oleksiak, A., Claussen, H., Brandic, I., Pierson, J.-M., & Vasilakos, A. V. (2015) · ACM Computing Surveys · doi:10.1145/2656204 · Cited by 276
DENS: Data Center Energy-Efficient Network-Aware Scheduling
Kliazovich, D., Bouvry, P., & Khan, S. U. (2010) · 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing · doi:10.1109/greencom-cpscom.2010.31 · Cited by 239
Network configuration synthesis with abstract topologies
Beckett, R., Mahajan, R., Millstein, T., Padhye, J., & Walker, D. (2017) · Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3062341.3062367 · Cited by 62
Network-Aware Virtual Machine Placement and Migration in Cloud Data Centers
Ferdaus, M. H., Murshed, M., Calheiros, R. N., & Buyya, R. (2015) · Advances in Systems Analysis, Software Engineering, and High Performance Computing · doi:10.4018/978-1-4666-8213-9.ch002 · Cited by 38
Interpretable deep learning for improving cancer patient survival based on personal transcriptomes
(2023) · doi:10.1038/s41598-023-38429-7 · Cited by 13
A survey and critical analysis on energy generation from datacenter
Mandal, R., Mondal, M. K., Banerjee, S., Chakraborty, C., & Biswas, U. (2021) · Data Deduplication Approaches · doi:10.1016/b978-0-12-823395-5.00005-7 · Cited by 11
Metadata
- Authors
- Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2008-08-17
- Volume
- 38
- Issue
- 4
- Pages
- 75-86
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2143065961
- Cited by
- 994
- References
- 11
- FWCI
- 56.51
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.