Maximally Fault Tolerant Directed Network Graph with Sublogarithmic Diameter for Arbitrary Number of Nodes

An efficient fault tolerant communication network is an integral part of designing today´s parallel processing systems. In this paper we propose a new family of almost regular directed network graphs based on permutation of groups of elements for an arbitrary number of nodes. The graph is shown to have sublogarithmic diameter and almost linear number of edges and is proved to be maximally fault tolerant.