Cited By
View all- Maleki SAgarwal UBurtscher MPingali KLee JPetrank E(2021)BiPartProceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3437801.3441611(161-174)Online publication date: 17-Feb-2021
Switch-Centric Data Center Network Structures Based on Hypergraphs and Combinatorial Block Designs
Pages 1154 - 1164
Abstract
Fat trees are considered suitable structures for data center interconnection networking. Such structures are rigid, and hard to scale up and scale out. A good data center network structure should have high scalability, efficient switch utilization, and high reliability. In this paper we present a class of data center network structures based on hypergraph theory and combinatorial block design theory. We show that our data center network structures are more flexible and scalable than fat trees. Using switches of the same size, our data center network structures can connect more nodes than fat trees, and it is possible to construct different structures with tradeoffs among inter-cluster communication capacity, reliability, the number of switches used, and the number of connected nodes.
References
[1]
M. Al-Fares, A. Loukissas, A. Vahdat, and A. Scalable, “Commodity data center network architecture”, SIGCOMM Comput. Commun. Rev., vol. 38, no. 4, pp. 63 –74, 2008.
[2]
J. C. Bermond, J. Bond, and S. Djelloul, “Dense bus networks of diameter 2 ”, Proc. DIMACS Workshop Interconnection Netw., Feb. 1994, vol. 21, pp. 9–18.
[3]
L. Campbell, “Dense group networks ”, Discrete Appl. Math., vol. 37/38, pp. 65–71, 1992.
[4]
L. Campbell, G. E. Carlsson, M. J. Dinneen, V. Faber, M. R. Fellows, M. A. Langston, J. W. Moore, A. P. Mullhaupt, and H. B. Sexton, “Small diameter symmetric networks from linear graphs”, IEEE Trans. Comput., vol. 41, no. 2, pp. 218– 220, Feb. 1992.
[5]
F. Comellas, and J. Gomez, “New large graphs with given degree and diameter, ”, Graph Theory, Combinatorics and Algorithms, Y. Alavi, and A. Schwenk Eds. New York, Eds., NY, USA: Wiley, 1995, vol. 1, Y. Alavi and A. Schwenk Eds. New York, pp. 221–233.
[6]
C. Delorme “Large bipartite graphs with given degree and diameter,” J. Graph Theory, vol. 9,no. 3, pp. 325–334, 1985.
[7]
A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta, “VL2: A scalable and flexible data center network”, Proc. ACM SIGCOMM Conf. Data Comm., 2009, pp. 51–62 .
[8]
C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang, and S. Liu, “DCell: A scalable and fault-tolerant network structure for data centers”, Proc. ACM SIGCOMM Conf. Data Commun., Aug. 2008pp. 75–68.
[9]
C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and S. Lu, “BCube a high performance, server-centric network architecture for modular data centers”, Proc. ACM SIGCOMM Conf. Data Commun., Aug. 2009, pp. 63 –74.
[10]
D. Guo, T. Chen, D. Li, M. Li, Y. Liu, and G. Chen, “Expandable and cost-effective network structures for data centers using dual-port servers”, IEEE Trans. Comput., vol. 62, no. 7, pp. 1303– 1317, Jul. 2013.
[11]
J. Lee, and D. R. Stinson, “A combinatorial approach to key predistribution for distributed sensor networks”, Proc. Wireless Commun. Netw. Conf., Mar. 2005, pp. 13 –17.
[12]
C. E. Leiserson, “Fat-trees: Universal networks for hardware-efficient supercomputing”, IEEE Trans. Comput., vol. C-34, no. 10, pp. 892 –901, Oct. 1985.
[13]
D. Li, C. Guo, H. Wu, K. Tan, Y. Zhang, and S. Lu, “FiConn: Using backup port for server interconnection in data centers”, Proc. IEEE Conf. Comput. Commun., 2009, pp. 2276–2285.
[14]
D. Li, C. Guo, H. Wu, K. Tan, Y. Zhang, S. Lu, and J. Wu, “Scalable and cost-effective interconnection of data-center servers using dual server ports”, IEEE/ACM Trans. Netw., vol. 19, no. 1, pp. 102– 114, Feb. 2011.
[15]
D. Li, M. Xu, H. Zhao, and X. Fu, “Building mega data center from heterogeneous containers”, Proc. IEEE 19th Int. Conf. Netw. Protocols, 2011, pp. 256– 265.
[16]
A. Pattanayak and B. Majhi, “A deterministic approach of merging of blocks in transversal design based key predistribution,” IACR Cryptology ePrint Archive 2009: 156,2009.
[17]
W. D. Wallis, Combinatorial Designs, New York, NY, USA: Marcel Dekker, 1988.
[18]
The Degree Diameter Problem for Bipartite Graphs—Combinatorics Wiki. (2012) [Online]. Available: http://combinatoricswiki.org/wiki/The_Degree_Diameter_Problem_for_Bipartite_ Graphs.
[19]
H. Wu, G. Lu, D. Li, C. Guo, and Y. Zhang, “MDCube: A high performance network structure for modular data center interconnection”, Proc. 5th Int. Conf. Emerging Netw. Exp. Technol., 2009, pp. 25– 36.
[20]
Y. Zhang, and N. Ansari, “On architecture design, congestion notification, TCP incast and power consumption in data centers”, IEEE Commun. Surveys Tutorials, vol. 15, no. 1, pp. 39 –64, Jan.–Mar. 2013.
[21]
S.-Q. Zheng, “An abstract model for optical interconnection network,” Parallel Computing. Using Optical. Interconnection Networks., K. Li, Y. Pan, and S.-Q. Zheng, Eds. Norwell, MA, USA: Kluwer, 1998, pp. 139–162.
Index Terms
- Switch-Centric Data Center Network Structures Based on Hypergraphs and Combinatorial Block Designs
Index terms have been assigned to the content through auto-classification.
Recommendations
On energy consumption of switch-centric data center networks
Data center network (DCN) is the core of cloud computing and accounts for 40% energy spend when compared to cooling system, power distribution and conversion of the whole data center (DC) facility. It is essential to reduce the energy consumption of DCN ...
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
Information & Contributors
Information
Published In
Copyright © 2014.
Publisher
IEEE Press
Publication History
Published: 01 April 2015
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
Cited By
View all- Maleki SAgarwal UBurtscher MPingali KLee JPetrank E(2021)BiPartProceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3437801.3441611(161-174)Online publication date: 17-Feb-2021
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in