Circuit-switched broadcasting in torus networks

Symmetric flows and broadcasting in hypercubes

“…Hence, a lower bound on the number of steps necessary to broadcast in a graph G with maximal degree A is at least log^+i |^(G)|. This bound has been proved to be attained for cycles (see [25]), 2-dimensional toroidal grids in [23] and almost attained for n-dimensional grids in [7]. For H{n)^ the lower bound becomes n bpWn))^l og2(n+ 1) I Different algorithms have been given for broadcasting in H(n): McKinley and Trefftz [22] presented an algorithm of |"-n'| rounds, based on edgedisjoint spanning trees.…”

Oblivious Gossiping on Tori

“…A substantial amount of research has been carried out on variants of the gossiping problem on meshes and tori [3,4,7,12,16,17]. RecentlyŠoch and Tvrdík [21] have analyzed the following variant of the gossiping problem:…”

Broadcasting in hypercubes in the circuit switched model

“…Hence, a lower bound on the number of steps necessary to broadcast in a graph G with maximal degree is at least log +1 jV Gj. This bound has been proved to be attained for cycles (see [19]), 2-dimensional toroidal grids in [17] and almost attained for n-dimensional grids in [7]. For Hn, the lower bound becomes b F Hn l n log 2 n+1 m .…”