Bandwidth-efficiency-oriented topology optimization for integrated switching systems based on circulant graphs

This work studies a topology optimization problem by leveraging a regular network topology-circulant graph. The result of the topology optimization is applied to the design of the integration network for modern integrated switching systems (ISSs), which integrate individual switching devices together to boost switching capacity and to reduce network management complexity. The target of the optimization is to maximize bandwidth efficiency on the integration links and hence to maximize the ISS capacity to accommodate traffic. This eventually translates to minimizing the average inter-node hop distance within the ISS.First, the problem is formulated into an integer linear program (ILP) and it is solved to its optimality for moderate-size networks. Then, by comparing with the Moore bound and unconstrained topology optimization, we show the circulant graph can be a qualified candidate with good bandwidth efficiency. Finally, due to the scaling limitation of the ILP approach, a dynamic programming (polynomial-time) algorithm is proposed and results show that it performs very closely to the optimal solutions induced from the ILP solver.

[1]  F. Aguiló,et al.  Triple loop networks with small transmission delay , 1997, Discret. Math..

[2]  Sanjay Mohapatra,et al.  Deploying network management solutions in enterprises , 2010, INC2010: 6th International Conference on Networked Computing.

[3]  Amin Vahdat,et al.  PortLand: a scalable fault-tolerant layer 2 data center network fabric , 2009, SIGCOMM '09.

[4]  Bhabani P. Sinha,et al.  Fault-Tolerant Routing in Distributed Loop Networks , 1995, IEEE Trans. Computers.

[5]  J.-C. Bermond,et al.  An Optimization Problem in Distributed Loop Computer Networks , 1989 .

[6]  Cruz Izu,et al.  Distance-hereditary embeddings of circulant graphs , 2003, Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing.

[7]  Dimitris S. Papailiopoulos,et al.  XORing Elephants: Novel Erasure Codes for Big Data , 2013, Proc. VLDB Endow..

[8]  W. Daniel Hillis,et al.  The network architecture of the Connection Machine CM-5 (extended abstract) , 1992, SPAA '92.

[9]  Christopher Rose Mean internodal distance in regular and random multihop networks , 1992, IEEE Trans. Commun..

[10]  P. Meijer Connectivities and diameters of circulant graphs , 1991 .

[11]  José-Ángel Gregorio,et al.  Chordal Topologies for Interconnection Networks , 2003, ISHPC.

[12]  Alex C. Snoeren,et al.  Topology Switching for Data Center Networks , 2011, Hot-ICE.

[13]  Domingo Gómez-Pérez,et al.  Optimal routing in double loop networks , 2007, Theor. Comput. Sci..

[14]  W. Daniel Hillis,et al.  The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..

[15]  Ivan Stojmenovic,et al.  Multiplicative Circulant Networks Topological Properties and Communication Algorithms , 1997, Discret. Appl. Math..

[16]  Chak-Kuen Wong,et al.  A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.

[17]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[18]  Albert G. Greenberg,et al.  The nature of data center traffic: measurements & analysis , 2009, IMC '09.

[19]  Frank K. Hwang,et al.  A survey on multi-loop networks , 2003, Theor. Comput. Sci..

[20]  Ming Zhang,et al.  Understanding data center traffic characteristics , 2010, CCRV.

[21]  Janise McNair,et al.  Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[22]  Jou-Ming Chang,et al.  Reducing the Height of Independent Spanning Trees in Chordal Rings , 2007, IEEE Transactions on Parallel and Distributed Systems.

[23]  G. Sethuraman,et al.  Graph Theory and Its Applications , 2004 .

[24]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[25]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[26]  F. Aguiló,et al.  An efficient algorithm to find optimal double loop networks , 1995, Discret. Math..

[27]  Jun Yang,et al.  A low-radix and low-diameter 3D interconnection network design , 2009, 2009 IEEE 15th International Symposium on High Performance Computer Architecture.

[28]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[29]  M. J. Karol,et al.  ShuffleNet: an application of generalized perfect shuffles to multihop lightwave networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[30]  R. Aharoni,et al.  Menger’s theorem for infinite graphs , 2005, math/0509397.

[31]  Yunnan Wu,et al.  Network coding for distributed storage systems , 2010, IEEE Trans. Inf. Theory.

[32]  Sam Toueg,et al.  On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.

[33]  Onur Mutlu,et al.  Express Cube Topologies for on-Chip Interconnects , 2009, 2009 IEEE 15th International Symposium on High Performance Computer Architecture.

[34]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[35]  Frank K. Hwang,et al.  A complementary survey on double-loop networks , 2001, Theor. Comput. Sci..

[36]  Ming Zhang,et al.  MicroTE: fine grained traffic engineering for data centers , 2011, CoNEXT '11.

[37]  EDDIE KOHLER,et al.  The click modular router , 2000, TOCS.

[38]  Helen J. Wang,et al.  SecondNet: a data center network virtualization architecture with bandwidth guarantees , 2010, CoNEXT.

[39]  Agustin Arruabarrena,et al.  Optimal Distance Networks of Low Degree for Parallel Computers , 1991, IEEE Trans. Computers.

[40]  Domingo Gómez-Pérez,et al.  Circulant Digraphs and Monomial Ideals , 2005, CASC.

[41]  Ramamurthy Badrinath,et al.  Finding Shortest Paths in Distributed Loop Networks , 1998, Inf. Process. Lett..

[42]  D. Frank Hsu,et al.  Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..

[43]  M. Karol,et al.  Shuffle Net: an application of generalized perfect shuffles to multihop lightwave networks , 1991 .

[44]  Casimer M. DeCusatis,et al.  Communication within clouds: open standards and proprietary protocols for data center networking , 2012, IEEE Communications Magazine.

[45]  Mateo Valero,et al.  Discrete Optimization Problem in Local Networks and Data Alignment , 1987, IEEE Transactions on Computers.

[46]  D. Frank Hsu,et al.  A combinatorial problem related to distributed loop networks , 1990, Networks.

[47]  D. K. Panda InfiniBand Architecture , 2001 .

[48]  Ryan Shea,et al.  Network interface virtualization: challenges and solutions , 2012, IEEE Network.