首页> 外文会议>INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE >Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times
【24h】

Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times

机译:具有异类往返时间的加减乘积全局公平性

获取原文

摘要

Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive-increase and multiplicative-decrease. We show that the source rates tend to be distributed in order to maximize an objective function called F/sub A//sup h/ ("F/sub A//sup h/ fairness"). We derive this result under the assumption of rate proportional negative feedback and for the regime of rare negative feedback. This applies to TCP in moderately loaded networks, and to those TCP implementations that are designed to interpret multiple packet losses within one RTT as a single congestion indication and do not rely on re-transmission timeout. This result provides some insight into the distribution of rates, and hence of packet loss ratios, which can be expected in a given network with a number of competing TCP or TCP-friendly sources. We validate our findings by analyzing a multiple-bottleneck scenario, and comparing with previous results (Floyd, 1991, Mathis et al, 1997) and an extensive numerical simulation with realistic parameter settings. We apply F/sub A//sup h/ fairness to gain a more accurate understanding of the bias of TCP against long round-trip times.
机译:考虑具有任意拓扑和任意通信延迟的网络,其中拥塞控制基于增加 - 增加和乘法减少。我们表明源率倾向于分布,以便最大化称为F / SUB A // SUP H /(“F / SUB A // SUP H / FALISNES”)的目标函数。我们在比例对比负反馈和罕见负面反馈的制度下获得这一结果。这适用于适度加载的网络中的TCP,以及那些设计用于将多个数据包丢失解释为RTT的多个数据包丢失,作为单个拥塞指示,不依赖于重新传输超时。该结果提供了一些对率分配的洞察,因此可以在具有多种竞争的TCP或TCP友好源的给定网络中期望的丢包比率。我们通过分析多个瓶颈方案,并与上一个结果(Floyd,1991,Mathis等,1997)进行比较,以及具有实际参数设置的广泛数值模拟的调查结果。我们申请f / sub a // sup h /公平性,以更准确地了解TCP偏见的长时间时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号