Optimal Neighborhood Broadcast in Star Graphs

摘要

In this paper, we consider the problem of constructing a multicast tree in star interconnection networks under the single-port communication model. Unlike previous schemes for constructing space-efficient multicast trees, we adopt the completion time of each multicast as the objective function to be minimized. In particular, we study a special case of the problem in which all destination vertices are immediate neighbors of the source vertex, and propose a multicast scheme of log_2 n + O((log n)~(1/2)) time units for the star graph of dimension n.