Component connectivity of the data center network DCell
References
[1]
J.A. Bondy, U.S.R. Murty, Graph Theory, Springer, New York, 2007.
[2]
G. Chartrand, S.F. Kapoor, L. Lesniak, D.R. Lick, Generalized connectivity in graphs, Bombay Math. Colloq. Bull. 2 (1984) 1–6.
[3]
J. Chang, K. Pai, R. Ro, J. Yang, The 4-component connectivity of alternating group networks, Theor. Comput. Sci. 766 (2019) 38–45.
[4]
E. Cheng, K. Qiu, Z. Shen, Connectivity results of hierarchical cubic networks as associated with linearly many faults, Proceedings of the International Conference on Computational Science and Engineering, 2014, pp. 1213–1220.
[5]
E. Cheng, K. Qiu, Z. Shen, Connectivity results of complete cubic networks as associated with linearly many faults, J. Interconnect. Netw. 15 (2015) 1550007.
[6]
E. Cheng, K. Qiu, Z. Shen, Structural properties of generalized exchanged hypercubes, Emergent Computation, Springer, Cham, 2017, pp. 215–232.
[7]
T. Ding, P. Li, M. Xu, The component (edge) connectivity of shuffle-cubes, Theor. Comput. Sci. 835 (2020) 108–119.
[8]
D. Ferrero, S. Hanusch, Component connectivity of generalized petersen graphs, Int.J. Comput. Math. 91 (2014) 1940–1963.
[9]
C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang, S. Lu, DCell: a scalable and fault-tolerant network structurre for data centers, Special Interest Group on Data Communication, 2008, pp. 75–86.
[10]
M. Gu, J. Chang, R. Hao, On computing component (edge) connectivities of balanced hypercubes, Comput. J. 63 (2020) 1311–1320.
[11]
M. Gu, R. Hao, S. Tang, J. Chang, Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs, Discrete Appl. Math. 279 (2020) 80–91.
[12]
M. Gu, S. He, R.-X. Hao, E. Cheng, Strongly menger connectedness of data center network and ( n, k )-star graph, Theor. Comput. Sci. 799 (2019) 94–103.
[13]
L.-H. Hsu, E. Cheng, L. Lipták, J.M. Tan, C.-K. Lin, T.Y. Ho, Component connectivity of the hypercubes, Int. J. Comput. Math. 89 (2012) 137–145.
[14]
M. Kliegl, J. Lee, J. Li, X. Zhang, C. Guo, D. Rincon, Generalized dcell structure for load-balanced data center networks, Proceedings of the International Conference on Computer Communications, 2010, pp. 1–5.
[15]
X. Li, C.-K. Lin, J. Fan, X. Jia, B. Cheng, J. Zhou, Relationship between extra connectivity and component connectivity in networks, Comput. J. 64 (2021) 38–53.
[16]
X. Li, J. Fan, C.-K. Lin, B. Cheng, X. Jia, The extra connectivity, extra conditional diagnosability and t/k-diagnosability of the data center network DCell, Theor. Comput. Sci. 766 (2019) 16–29.
[17]
X. Liu, J. Meng, Strongly menger-edge-connectedness of DCell networks, Theor. Comput. Sci. 922 (2022) 308–311.
[18]
X. Liu, J. Meng, The k-restricted edge-connectivity of the data center network DCell, Appl. Math. Comput. 396 (2021) 125941.
[19]
H. Lv, T. Wu, Super edge-connectivity and matching preclusion of data center networks, Discrete Math. Theor. Comput. Sci. 21 (2019) 2.
[20]
M. Lv, J. Fan, J. Zhou, J. Yu, X. Jia, The reliability of k-ary n-cube based on component connectivity, Comput. J. 65 (2022) 2197–2208.
[21]
E. Sampathkumar, Connectivity of a graph-a generalization, J. Comb. Inf. Syst. Sci. 9 (1984) 71–78.
[22]
X. Wang, A. Erickson, J. Fan, X. Jia, Hamiltonian properties of dcell networks, Comput. J. 58 (2016) 2944–2955.
[23]
X. Wang, J. Fan, J. Zhou, C.K. Lin, The restricted h-connectivity of the data center network DCell, Discrete Appl. Math. 203 (2016) 144–157.
[24]
L. Xu, L. Guo, Analysis on the component connectivity of enhanced hypercubes, Comput. J. 65 (2022) 890–896.
[25]
S. Zhao, W. Yang, S. Zhang, Component connectivity of hypercubes, Theor. Comput. Sci. 640 (2016) 115–118.
[26]
S. Zhao, W. Yang, Conditional connectivity of folded hypercubes, Discrete Appl. Math. 257 (2019) 388–392.
Index Terms
- Component connectivity of the data center network DCell
Index terms have been assigned to the content through auto-classification.
Recommendations
The restricted h -connectivity of the data center network DCell
Traditional data center networks (DCNs) are faced with many challenges with the development of cloud computing. This fact makes design of new DCNs represented by DCell networks become a hot research topic. For any integers k 0 and n 2 , the k -...
Dcell: a scalable and fault-tolerant network structure for data centers
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 ...
Dcell: a scalable and fault-tolerant network structure for data centers
SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communicationA 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 ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Elsevier Inc.
Publisher
Elsevier Science Inc.
United States
Publication History
Published: 01 May 2023
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 17 Feb 2025