A new class of data center network structures

Proceedings - IEEE Global Communications Conference, GLOBECOM

Volumn , Issue , 2013, Pages 2852-2858

  Zhang, Jianfei ^a   Fang, Zhiyi ^a   Qu, Guannan ^a   Zheng, S Q ^b  

^a JILIN UNIVERSITY   (China)

^b The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; FORESTRY; INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

DATA CENTER NETWORKS; DATACENTER; FAT TREES; GOOD DATA; HIGH RELIABILITY; HIGH SCALABILITIES; NETWORK STRUCTURES; SCALE-UP; STRUCTURE-BASED; SWITCH UTILIZATION;

TREES (MATHEMATICS);

COMMUNICATION; DATA BASES; FORESTRY;

EID: 84904135743     PISSN: 23340983     EISSN: 25766813     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2013.6831507     Document Type: Conference Paper

References (14)

1. 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., pp. 139-162, Kluwer Academic Press, 1998.
2. C. E. Leiserson, "Fat-trees: Universal Networks for Hardware-Efficient Supercomputing," IEEE Transactions on Computers, Vol. 34, no. 10, pp. 892-901, Oct. 1985.
3. M. Al-Fares, A. Loukissas, and A. Vahdat, "A Scalable, Commodity Data Center Network Architecture," SIGCOMM Comput. Commun. Rev., 38(4): pp. 63-74, 2008.
4. W. D. Wallis, Combinatorial Designs, Marcel Dekker, New York, 1988.
5. Jooyoung Lee, Douglas R. Stinson, "A Combinatorial Approach to Key Predistribution for Distributed Sensor Networks," Wireless Communication and Network Conference, March 13-17, 2005.
6. Anupam Pattanayak and B. Majhi, "A Deterministic Approach of Merging of Blocks in Transveral Design based Key Predistribution," IACR Cryptology ePrint Archive 2009: 156 (2009).
7. L. Campbell, "Dense Group Networks," Discrete Appl. Math., 37/38, pp. 65-71, 1992.
8. 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. 41, pp. 218-220, 1992.
9. F. Comellas and J. Gomez, "New large graphs with given degree and diameter. Graph Theory, Combinatorics and Algorithms, Vol 1, Yousef Alavi and Allen Schwenk (Eds.), John Wiley & Sons, Inc.; New York (1995) pp. 221-233
10. (Proc. of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Kalamazoo, MI, USA, June 1992.)
11. C. Delorme "Large Bipartite Graphs with Given Degree and Diameter," Journal of Graph Theory, Vol 9, Issue 3, 1985.
12. The Degree Diameter Problem for Bipartite Graphs-Combinatorics Wiki, http://combinatoricswiki. org/wiki/The Degree Diameter Problem for Bipartite Graphs
13. J. C. Bermond, J. Bond, and S. Djelloul, "Dense Bus Networks of Diameter 2," Proc. Workshop on interconnection Networks, DIMACS, Feb. 1994;
14. DIMACS Ser., Volume 21, pp. 9-18, Annals New York Academy of Sciences, 1995.