Efficient Routing in Data Center with Underlying Cayley Graph

Nowadays data centers are becoming huge facilities with hundreds of thousands of nodes, connected through a network. The design of such interconnection networks involves finding graph models that have good topological properties and that allow the use of efficient routing algorithms. Cayley Graphs, a kind of graphs that represents an algebraic group, meet these properties and therefore have been proposed as a model for these networks. In this paper we present a routing algorithm based on Shortlex Automatic Structure, which can be used on any interconnection network with an underlying Cayley Graph (of some finite group). We show that our proposal computes the shortest path between any two vertices with low time and space complexity in comparison with traditional routing algorithms.

[1]  W. Magnus,et al.  Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations , 1966 .

[2]  John J. Cannon.  Construction of defining relators for finite groups , 1973, Discret. Math..

[3]  Oded Goldreich,et al.  The Minimum-Length Generator Sequence Problem is NP-Hard , 1981, J. Algorithms.

[4]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[5]  John N. Tsitsiklis,et al.  The efficiency of greedy routing in hypercubes and butterflies , 1991, SPAA '91.

[6]  K. Wendy Tang,et al.  Vertex-transitivity and routing for Cayley graphs in GCR representations , 1992, SAC '92.

[7]  Richard M. Stafford,et al.  Processor Interconnection Networks from Cayley Graphs , 1992, Discret. Appl. Math..

[8]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[9]  John N. Tsitsiklis,et al.  Efficient Routing Schemes for Multiple Broadcasts in Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..

[10]  Derek F. Holt.  The Warwick automatic groups software , 1994, Geometric and Computational Perspectives on Infinite Groups.

[11]  Marie-Claude Heydemann,et al.  Cayley graphs and interconnection networks , 1997 .

[12]  Michel Daoud Yacoub.  Wireless technology , 2001 .

[13]  Wenjun Xiao,et al.  Cayley graphs as models of deterministic small-world networks , 2006, Inf. Process. Lett..

[14]  J. Meier,et al.  Groups, Graphs and Trees: An Introduction to the Geometry of Infinite Groups , 2008 .

[15]  Hamid Sarbazi-Azad,et al.  Analytic performance comparison of hypercubes and star graphs with implementation constraints , 2008, J. Comput. Syst. Sci..

[16]  Eyal Loz,et al.  New record graphs in the degree-diameter problem , 2008, Australas. J Comb..

[17]  Lei Wang,et al.  Topology-Based Routing for Xmesh in Dense Wireless Sensor Networks , 2009 .

[18]  K. Wendy Tang,et al.  Fault-tolerant routing on Borel Cayley graph , 2012, 2012 IEEE International Conference on Communications (ICC).

[19]  Darko Kirovski,et al.  On the feasibility of completely wireless datacenters , 2012, 2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[20]  Wenjun Xiao,et al.  A Class of Data-Center Network Models Offering Symmetry, Scalability, and Reliability , 2012, Parallel Process. Lett..

[21]  Darko Kirovski,et al.  On the Feasibility of Completely Wirelesss Datacenters , 2013, IEEE/ACM Transactions on Networking.