首页> 外文期刊>Computer networks >Explicit rate multicast congestion control
【24h】

Explicit rate multicast congestion control

机译:显式速率组播拥塞控制

获取原文
获取原文并翻译 | 示例
           

摘要

In this article, we propose a new single-rate end-to-end multicast congestion control scheme called Explicit Rate Multicast Congestion Control (ERMCC) based on a new metric, TRAC (Throughput Rate At Congestion). ERMCC can be implemented only at the source and the receivers of the multicast tree. ERMCC achieves an O(1) memory complexity to maintain state information at source and receivers; requires only simple computations; and does not necessitate measurement of RTTs from all receivers to the source. ERMCC does not suffer from the drop-to-zero problem and is very effective with feedback suppression (achieves 95% suppression). Furthermore, with proper adjustment of its rate adaptation parameters, ERMCC achieves TCP friendliness only on the path to the slowest receiver. Theoretical analysis of the scheme performance is provided, and simulations have shown that ERMCC outperforms PGMCC and TFMCC under most situations. We have also implemented ERMCC over UDP and successfully run it on real testbed systems in Emulab with very good results. In addition to this implementation, we also obtained very good results in large-scale simulation tests of ERMCC.
机译:在本文中,我们提出了一种新的单速率端到端组播拥塞控制方案,该方案基于新指标TRAC(拥塞吞吐率),称为显式速率组播拥塞控制(ERMCC)。 ERMCC只能在多播树的源和接收者处实现。 ERMCC实现了O(1)内存复杂度,无法在源和接收方维护状态信息;只需要简单的计算;并且无需测量从所有接收器到信号源的RTT。 ERMCC不会掉到零问题,并且在反馈抑制方面非常有效(达到95%抑制)。此外,通过适当调整其速率自适应参数,ERMCC仅在通向最慢接收器的路径上即可实现TCP友好性。提供了该方案性能的理论分析,并且仿真表明,ERMCC在大多数情况下都优于PGMCC和TFMCC。我们还通过UDP实现了ERMCC,并在Emulab的真实测试平台系统上成功运行了ERMCC,效果非常好。除此实现外,我们还在ERMCC的大规模仿真测试中获得了非常好的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号