Throughput and packet displacements of dynamic broadcasting algorithms

Most dynamic broadcasting algorithms focus on maximizing throughput. We present several broadcasting algorithms focusing on low maximum displacement, that is, that limit how far out of order packets may be received. Experiments show that in many settings our algorithms have smaller displacement than existing algorithms, while still guaranteeing high throughput. As a result of independent interest, we show that modelling decisions on the order of edge activations in one round of a broadcasting algorithm can have substantial impact on the throughput