• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model
【24h】

Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model

机译：有界多端口模型下大规模异构平台上的广播

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider the classical problem of broadcasting a large message at an optimal rate in a large scale distributed network under the multi-port communication model. In this context, we are interested in both building an overlay network and providing an explicit algorithm for scheduling the communications. From an optimization point of view, we aim both at maximizing the throughput (i.e., the rate at which nodes receive the message) and minimizing the degree of the participating nodes, i.e., the number of TCP connections they must handle simultaneously. The main novelties of our approach are the introduction of this degree constraint and the classification of the set of participating nodes into two parts: open nodes that stay in the open-Internet and “guarded” nodes that lie behind firewalls or NATs. Two guarded nodes cannot communicate directly, but rather need to use an open node as a gateway for transmitting a message. In the case without guarded nodes, we prove that it is possible to reach the optimal throughput, at the price of a quasi-optimal (up to a small additive increase) degree of the participating nodes. In presence of guarded nodes, our main contributions are a closed form formula for the optimal cyclic throughput and the proof that the optimal solution may require arbitrarily large degrees. In the acyclic case, we propose an algorithm that reaches the optimal throughput with low degree. Then, we prove a worst case ratio between the optimal acyclic and cyclic throughput and show through simulations that this ratio is on average very close to 1, what makes acyclic solutions efficient both in terms of throughput maximization and degree minimization.
机译：我们考虑了在多端口通信模型下以最佳速率在大型分布式网络中广播大消息的经典问题。在这种情况下，我们对构建覆盖网络和提供用于调度通信的显式算法都感兴趣。从优化的角度来看，我们的目标是最大化吞吐量（即节点接收消息的速率）和最小化参与节点的程度（即它们必须同时处理的TCP连接数）。我们方法的主要新颖之处在于引入了这种程度约束，并将参与节点的集合分为两部分：位于开放Internet中的开放节点和位于防火墙或NAT之后的“受保护”节点。两个受保护节点无法直接通信，而是需要使用一个开放节点作为网关来传输消息。在没有受保护节点的情况下，我们证明可以以参与节点的准最佳（最多增加很小的增量）程度为代价达到最佳吞吐量。在存在受保护节点的情况下，我们的主要贡献是用于最佳循环吞吐量的封闭式公式，以及证明最佳解决方案可能需要任意大程度的证明。在非循环情况下，我们提出了一种算法，该算法可以在较低程度上达到最佳吞吐量。然后，我们证明了最佳非循环吞吐量与循环吞吐量之间的最坏情况比率，并通过仿真表明该比率平均非常接近1，这使非循环解决方案在吞吐量最大化和程度最小化方面均有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号