One-to-all wormhole broadcasting in star graph networks using single port communication

The problem of broadcasting in an n-dimensional star graph with wormhole routing is studied. We have used the regular single-port communication model with intermediate node reception capability. The lower bound under the model is derived and efficient algorithms are developed to achieve broadcasting in O(n) communication time which is sub logarithmic in the number of nodes in the network.