动态多信息广播:情感模型中的边界条件
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
摘要:
我们研究了一个动态版本的多消息广播问题,其中数据包不断注入网络节点在整个网络中传播。我们的性能指标是这样的协议对最佳的吞吐量的比率,对于任何足够长的时间,因为启动。我们提出并分析了一个动态的多消息广播协议,工作在一个affectance模型,参数化的干扰,其他节点之间的通信中引入一对给定的节点。作为一种算法工具,我们开发了一个有效的算法,沿BFS树下的影响模型的广播。为了提供一个严格和准确的分析,我们定义了两个新的网络特性的基础上的网络拓扑结构和影响函数。这些特性的组合影响广播的性能与影响(模对数函数)。我们还进行了模拟我们的协议下的影响。据我们所知,这是第一个动态的多消息广播协议,提供吞吐量保证连续注入的消息和工作的影响模型。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。