Efficient fault tolerant broadcasting algorithm for the cube-connected cycles network

The cube-connected cycles network is discussed as a cube whose 2k vertices are cycles of k nodes each. It is suitable for realization for VLSI since it satisfies the properties of degree boundedness of nodes (=3). Broadcasting is a procedure by which a processor can pass a message to all other processors in the network nonredundantly. This is extremely important for diagnosis of the network, distribution agreement or clock synchronization. A simple yet efficient algorithm is developed for broadcasting in the cube-connected cycles network. Another broadcasting algorithm for the cube-connected cycles network in the presence of some faulty processors is also developed.<>