Optimal communication algorithms on the star interconnection network

We consider three fundamental communication problems on the star interconnection network, namely the multinode broadcast, the single node scattering, and the total exchange. All of these problems are studied under two different assumptions: the assumption that each node can exchange messages of fixed length with one of its neighbors at each time step, or single link availability (SLA), and the assumption that each node can exchange messages of fixed length with all of its neighbors at each time step, or multiple link availability (MLA). All the communication algorithms presented are based on the construction of spanning trees with special properties on the star network to fit different communication needs