A new class of interconnection networks based on alternating group

The authors present an analysis of a new class of interconnection scheme based on the Cayley graph of the alternating group. The definition and an analysis of the symmetry of this class of graphs are presented, and a shortest-path routing algorithm is given. An algorithm for embedding of the Hamiltonian cycle is presented, and an algorithm for embedding grids is given. A greedy spanning tree algorithm for one source broadcasting and an analysis of the contention problem are also given.<
>