首页> 外文期刊>Computer networks >LIAD: Adaptive bandwidth prediction based Logarithmic Increase Adaptive Decrease for TCP congestion control in heterogeneous wireless networks
【24h】

LIAD: Adaptive bandwidth prediction based Logarithmic Increase Adaptive Decrease for TCP congestion control in heterogeneous wireless networks

机译:LIAD:异构无线网络中基于自适应带宽预测的对数增加自适应减少,用于TCP拥塞控制

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

摘要

For accessing plentiful resources in the Internet through wireless mobile hosts, diverse wireless network standards and technologies have been developed and progressed significantly. The most successful examples include IEEE 802.11 WiFi for wireless networks and 3G/HSDPA/HSUPA for cellular communications. All IP-based applications are the primary motivations to make these networks successful. In TCP/IP transmissions, the TCP congestion control operates well in the wired network, but it is difficult to determine an accurate congestion window in a heterogeneous wireless network that consists of the wired Internet and various types of wireless networks. The primary reason is that TCP connections are impacted by not only networks congestion but also error wireless links. This paper thus proposes a novel adaptive window congestion control (namely Logarithmic Increase Adaptive Decrease, LIAD) for TCP connections in heterogeneous wireless networks. The proposed RTT-based LIAD has the capability to increase throughput while achieving competitive fairness among connections with the same TCP congestion mechanism and supporting friendliness among connections with different TCP congestion control mechanisms. In the Congestion Avoidance (CA) phase, an optimal shrink factor is first proposed for Adaptive Decreasing cwnd rather than a static decreasing mechanism used by most approaches. Second, we adopt a Logarithmic Increase algorithm to increase cwnd while receiving each ACK after causing three duplicate ACKs. The analyses of congestion window and throughput under different packet loss rate are analyzed. Furthermore, the state transition diagram of LIAD is detailed. Numerical results demonstrate that the proposed LIAD outperforms other approaches in goodput, fairness, and friendliness under diverse heterogeneous wireless topologies. Especially, in the case of 10% packet loss rate in wireless links, the proposed approach increases goodput up to 156% and 1136% as compared with LogWest-wood+ and NewReno, respectively.
机译:为了通过无线移动主机访问Internet中的大量资源,已经开发并显着发展了各种无线网络标准和技术。最成功的例子包括用于无线网络的IEEE 802.11 WiFi和用于蜂窝通信的3G / HSDPA / HSUPA。所有基于IP的应用程序都是使这些网络成功的主要动力。在TCP / IP传输中,TCP拥塞控制在有线网络中运行良好,但是很难确定由有线Internet和各种类型的无线网络组成的异构无线网络中的准确拥塞窗口。主要原因是TCP连接不仅受到网络拥塞的影响,还受到错误无线链接的影响。因此,本文为异构无线网络中的TCP连接提出了一种新颖的自适应窗口拥塞控制(即对数增加自适应减少,LIAD)。所提出的基于RTT的LIAD具有提高吞吐量的能力,同时在具有相同TCP拥塞机制的连接之间实现竞争公平性,并支持具有不同TCP拥塞控制机制的连接之间的友好性。在拥塞避免(CA)阶段,首先为自适应递减cwnd提出了最佳的收缩因子,而不是大多数方法使用的静态递减机制。其次,我们采用对数增加算法来在引起三个重复的ACK之后接收每个ACK的同时增加cwnd。分析了不同丢包率下的拥塞窗口和吞吐量。此外,详细描述了LIAD的状态转换图。数值结果表明,在多种异构无线拓扑下,所提出的LIAD在吞吐量,公平性和友好性方面均优于其他方法。特别是在无线链路中丢包率为10%的情况下,与LogWest-wood +和NewReno相比,所提方法的吞吐量分别提高了156%和1136%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号