Asymptotically optimal communication algorithms on faulty folded Petersen networks

Efficient data communication through an interconnection network in the presence of faulty nodes and links is an important issue in multiprocessor systems. The newly proposed folded Petersen networks, constructed by iteratively applying the cartesian product operation on the well-known Petersen graph, provide a very efficient topology for multiprocessor architectures. In this paper, we construct multiple arc-disjoint spanning trees on the folded Petersen networks and utilize them for deriving fault-tolerant algorithms for several communication primitives. These primitives include single node broadcasting, gossiping, scattering, and total exchange.