We study a dynamic version of the Multiple-Message Broadcast problem, where packets are continuously injected in network nodes for dissemination throughout the network. Our performance metric is the ratio of the throughput of such protocol against the optimal one, for any sufficiently long period of time since startup. We present and analyze a dynamic Multiple-Message Broadcast protocol that works under an affectance model, which parameterizes the interference that other nodes introduce in the communication between a given pair of nodes. As an algorithmic tool, we develop an efficient algorithm to schedule a broadcast along a BFS tree under the affectance model. To provide a rigorous and accurate analysis, we define two novel network characteristics based on the network topology and the affectance function. The combination of these characteristics influence the performance of broadcasting with affectance (modulo a logarithmic function). We also carry out simulations of our protocol under affectance. To the best of our knowledge, this is the first dynamic Multiple-Message Broadcast protocol that provides throughput guarantees for continuous injection of messages and works under the affectance model.

我们研究了多消息广播问题的动态版本，其中数据包被连续注入网络节点以在整个网络中传播。我们的性能指标是在启动后的任何足够长的时间内，此类协议的吞吐量与最佳协议的吞吐量之比。我们提出并分析了一种在影响模型下工作的动态多消息广播协议，该协议参数化其他节点在给定节点对之间的通信中引入的干扰。作为一种算法工具，我们开发了一种有效的算法来在影响模型下沿着 BFS 树安排广播。为了提供严格而准确的分析，我们基于网络拓扑和影响函数定义了两个新颖的网络特征。这些特征的组合影响着广播的影响力（模对数函数）的性能。我们还在影响下对我们的协议进行了模拟。据我们所知，这是第一个动态多消息广播协议，它为消息的连续注入提供吞吐量保证，并在影响模型下工作。