Novel broadcasting scheme of the hierarchical interconnection network

A potential interconnection network named fully connected cubic network (FCCN) that demonstrates many attractive properties including efficient communication, regularity and small diameter has been proposed by Chang and Wang [Journal of Parallel and Distributed Computing, 61 (2001) 838-849]. In this paper, we propose a distributed broadcasting algorithm for FCCN(n). The height of the broadcasting tree is less than or equal to the diameter of FCCN(n). It is very simple and easy to be implemented. In fact, it requires only extra two integers included in the message; and as a node receives the message, it costs constant time to decide the neighbors to broadcast in a asynchronous environment.