An Efficient Circuit-Switched Broadcasting in Star Graph

In this paper, we propose an algorithm for broadcasting in star graph using circuit-switched, half-duplex, and link-bound communication. By using the algorithm, we show that the broadcasting in an n-dimensional star graph can be done in n-1 time steps. We also study the lower bound of time steps of the circuit-switched broadcasting in star graph, and we prove that the optimal broadcasting time steps in an n-dimensional star graph is $\lceil{\rm log}_{\rm n}{\it n}!\rceil$. Finally, the computational results showed that the proposed algorithm gets nearly optimal solutions.