Near-optimal gossiping (all-to-all-broadcasting) algorithms are given for two- and higher dimensional tori-networks. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. We propose simple time-independent routing algorithms: in all steps, the processors forward the received packets in the same way.