基于ECN带预测验证的拥塞控制算法

提出了一种新的拥塞控制源算法FAV(Forecast and Verify),这是一种在接收方测量分组到达的延迟来预测网络中是否将出现拥塞的算法,并结合ECN来验证预测的准确性。通过和TCP Reno、TCP Vegas算法进行比较实验,表明FAV算法能够有效地减小丢失率和链路延迟,同时保持较高的链路利用率,从而使网络中的拥塞得到较好控制。     

TCP Yolanda:无线和有线混合网络中的TCP改进算法

在TCP Westwood基础上提出了一种适合无线有线混合网络的TCP改进算法——TCP Yolanda,该算法以瓶颈链路缓冲区长度测量值为参数,采用分两个子阶段的方式改进拥塞避免阶段以更有效进行传输控制,使传输过程能更长时间保持在稳定的高速率状态,并能在误码率较高的无线网络环境下快速恢复拥塞窗口大小,另外在传输发生错误时能判断丢包原因并进行区别处理。基于ns2的仿真实验表明,改进后的TCP算法在网络传输吞吐率、传输稳定性等方面的性能有较大提升,并且保持较好的连接公平性和友好性。     

TCP拥塞控制算法研究

随着互联网规模的增长，互联网上的用户和应用都在快速的增长，拥塞已经成为一个十分重要的问题。近年来，在拥塞控制领域开展了大量的研究工作。拥塞控制算法可以分为两个主要部分：在端系统上使用的源算法和在网络设备上使用的链路算法。在介绍拥塞控制算法的基本概念后，本文总结了在TCP协议方面拥塞控制算法的研究现状，并分析了进一步的研究方向。     

无线传感器网络自适应差错控制技术研究

基于IEEE802.15.4标准建立了自动请求重传(ARQ)和前向纠错(FEC)两种差错控制技术的能量效率模型,分析了各参数对两种技术能量效率的影响,得到了ARQ技术最优负载长度和FEC技术最优纠错码参数,进而提出了一种根据无线链路接收信号强度自适应选择使用ARQ或FEC的差错控制方案,以适应无线传感器网络中无线链路质...     

一种保证TCP上下行时间公平的新调度算法

针对无线局域网中传输控制协议(TCP)闭环拥塞控制的贪婪性、媒体接入控制(MAC)协议节点接入的公平性和无线信道的异构性导致TCP出现的上下行不公平和时间不公平问题,提出了一种在接入点上实现上下行时间公平的UDTFLAS (Up/Down Time Fair LAS)调度算法.UDTFLAS算法依据信道数据发送速率,给无线信道速率较高的TCP流提供更大的发送概率,以保证上下行各TCP流占用相等的无线信道时间.实验结果表明,UDTFLAS算法可以保护单流的吞吐率,实现上下行流的时间公平,能有效提高网络总吞吐量.     

网络拥塞控制算法

随着计算机网络的持续快速发展,各种网络应用需求不断涌现,造成网络数据流量的激增。网络拥塞问题变得越来越严重,网络拥塞控制也一直是网络研究的最关键热点问题之一。在本文中,作者着重阐述了TCP／IP拥塞控制中的典型算法,并指出了这些算法的优缺点。     

TCP拥塞控制与算法概述

随着Internet广泛应用,拥塞控制技术已成为网络研究热点之一,描述Internt端到端产生拥塞的基本原因,重点阐述TCP拥塞控制策略和拥塞控制四种算法的性能及应用,进一步分析TCP拥塞控制技术最新研究成果及方向。     

一种改进的FAST TCP协议及其在OPNET下的仿真实现

FASTTCP在地面大带宽时延积网络中具有很好的性能,针对FAST TCP拥塞控制机制在卫星网络中的应用开展研究,卫星网络链路随机丢包严重导致FAST TCP吞吐量下降的问题,采用对网络可用带宽估计的方法区分丢包原因,提出一种改进的FAST TCP协议。通过在OPNET下的实现,对改进FAST TCP协议在大带宽、长延时、链路随机丢包严重的网络中的吞吐量情况进行仿真,验证协议性能。     

一种融合MAC层拥塞通告的混合网络TCP协议

在研究无线网络媒体接入控制(MAC)层拥塞测度的基础上,提出了一种跨层的显式拥塞通告(ECN)机制,即:当数据包中记录的请求发送(RTS)次数超过给定阈值时,通过ECN向传输控制协议(TCP)源端发送拥塞通告,从而启动TCP拥塞控制.这种跨层设计是对有线网络中基于主动队列管理(AQM)的拥塞控制的有效补充,由此可以得到一种与已有的协议无缝连接的混合网络TCP模型.通过在网络模拟器NS2中构造多流无线局域网和多跳无线/有线混合网络,对所提出的方法进行了仿真,实验结果说明该方法能够提高混合网络的性能,并且具备良好的扩展性.     

Google WebRTC网络拥塞控制策略的研究

伴随着近几年人们对网络视频，语音通讯需求的极大增长，国内网络带宽提速的脚步依然很慢。从而使得网路拥塞的现象更加严重。在本文中，作者阐述了当前TCP拥塞控制的典型算法，着重针对GoogleWebRTC技术中的拥塞解决方案进行分析和研究，达到了理论与实际相互结合的目的。     

TCPW BR: A Wireless Congestion Control Scheme Base on RTT

The wireless network is limited by the transmission medium, and the transmission process is subject to large interference and jitter. This jitter can cause sporadic loss and is mistaken for congestion by the congestion control mechanism. The TCP Westwood protocol (referred to as TCPW) is such that it cannot distinguish between congestion loss and wireless jitter loss, which makes the congestion mechanism too sensitive and reduces bandwidth utilization. Based on this, the TCPW protocol is modified based on the estimate of the Round-Trip Time (referred to as RTT) value-called TCPW BR. The algorithm uses the measured smooth RTT value and divides the congestion level according to the weighted average idea to determine congestion loss and wireless jitter loss. The simulation results show that the TCPW BR algorithm enhances the wireless network’s ability to judge congestion and random errors.     

TCP-friendly congestion control for streaming real-time applications over wireless networks

Congestion control for streaming real-time applications, which need smoothness of the transmission rate, should be transmission control protocol (TCP)-friendly. Moreover, in wireless networks, TCP-friendly congestion control should be based on differentiation of packet losses due to congestion and wireless link error to improve network utilisation. The authors propose a TCP-friendly congestion control algorithm based on explicit congestion notification over the wireless networks. The simulation results show that the proposed algorithm utilises the link bandwidth efficiently, providing smoothness of the transmission rate.     

Congestion-aware proactive vertical handoff algorithm in heterogeneous wireless networks

In heterogeneous wireless networks, when a mobile host/handset (MH) with multiple wireless interfaces changes its location or requires a certain network service, the MH will require a switch between different wireless networks (namely vertical handoff). A congestion-aware proactive vertical handoff algorithm is proposed, which uses a data pre-deployment technology to realise soft handoff between cellular interface and ad hoc interface. Here, the vertical handoff algorithm is implemented in an experimental heterogeneous network structure called converged ad hoc and cellular network, which is an ad hoc overlay system considering the balancing of the traffic between adjacent cellular cells. By evaluations, it is shown that the proposed algorithm can realise low handoff delay and low packet losses, and help to ease congestion issue existing in the heterogeneous networks.     

Robust end-to-end loss differentiation scheme for transport control protocol over wired/wireless networks

The authors propose a robust end-to-end loss differentiation scheme to identify the packet losses because of congestion for transport control protocol (TCP) connections over wired/wireless networks. The authors use the measured round trip time (RTT) values to determine whether the cause of packet loss is because of the congestion over wired path or regular bit errors over wireless paths. The classification should be as accurate as possible to achieve high throughput and maximum fairness for the TCP connections sharing the wired/wireless paths. The accuracies of previous schemes in the literature depends on varying network parameters such as RTT, buffer size, amount of cross traffic, wireless loss rate and congestion loss rate. The proposed scheme is robust in that the accuracy remains rather stable under varying network parameters. The basic idea behind the scheme is to set the threshold for the classification to be a function of the minimum RTT and the current sample RTT, so that it may automatically adapt itself to the current congestion level. When the congestion level of the path is estimated to be low, the threshold for a packet loss to be classified as a congestion loss is increased. This avoids unnecessary halving of the congestion window on packet loss because of the regular bit errors over the wireless path and hence improves the TCP throughput. When the congestion level of the path is estimated to be high, the threshold for a packet loss to be classified as the congestion loss not to miss any congestion loss is decreased and hence improves the TCP fairness. In ns 2 simulations, the proposed scheme correctly classifies the congestion losses under varying network parameters whereas the previous schemes show some dependency on subsets of parameters.     

On window control algorithm for TCP efficiency over wireless networks with high bandwidth-delay product

The existing congestion control algorithms such as TCP Reno are not suitable for efficient utilisation of networks with a high bandwidth-delay product because it takes a very long time to achieve the full link utilisation. Furthermore, it is difficult to guarantee the fairness among the TCP connections with different round-trip times. To overcome these problems, a new window control algorithm using the buffer state and variable gains is proposed. The simulation results show that our algorithm improves the performance of TCP in the wireless networks     

An Adjust Duty Cycle Method for Optimized Congestion Avoidance and Reducing Delay for WSNs

With the expansion of the application range and network scale of wireless sensor networks in recent years, WSNs often generate data surges and delay queues during the transmission process, causing network paralysis, even resulting in local or global congestion. In this paper, a dynamically Adjusted Duty Cycle for Optimized Congestion based on a real-time Queue Length (ADCOC) scheme is proposed. In order to improve the resource utilization rate of network nodes, we carried out optimization analysis based on the theory and applied it to the adjustment of the node’s duty cycle strategy. Using this strategy to ensure that the network lifetime remains the same, can minimize system delay and maximize energy efficiency. Firstly, the problems of the existing RED algorithm are analyzed. We introduce the improved SIG-RED algorithm into the ADCOC mechanism. As the data traffic changes, the RED protocol cannot automatically adjust the duty cycle. A scheduler is added to the buffer area manager, referring to a weighted index of network congestion, which can quickly determine the status of network congestion. The value of the weighting coefficient W is adjusted by the Bayesian method. The scheduler preferably transmits severely urgent data, alleviating the memory load. Then we combined improved data fusion technology and information gain methods to adjust the duty cycle dynamically. By simulating the algorithm, it shows that it has faster convergence speed and smaller queue jitter. Finally, we combine the adjusted congestion weight and the duty cycle growth value to adjust the data processing rate capability in the real-time network by dynamically adjusting it to adapt to bursts of data streams. Thus, the frequency of congestion is reduced to ensure that the system has higher processing efficiency and good adaptability.     

Efficient Routing Protocol with Localization Based Priority & Congestion Control for UWSN

The nodes in the sensor network have a wide range of uses, particularly on under-sea links that are skilled for detecting, handling as well as management. The underwater wireless sensor networks support collecting pollution data, mine survey, oceanographic information collection, aided navigation, strategic surveillance, and collection of ocean samples using detectors that are submerged in water. Localization, congestion routing, and prioritizing the traffic is the major issue in an underwater sensor network. Our scheme differentiates the different types of traffic and gives every type of traffic its requirements which is considered regarding network resource. Minimization of localization error using the proposed angle-based forwarding scheme is explained in this paper. We choose the shortest path to the destination using the fitness function which is calculated based on fault ratio, dispatching of packets, power, and distance among the nodes. This work contemplates congestion conscious forwarding using hard stage and soft stage schemes which reduce the congestion by monitoring the status of the energy and buffer of the nodes and controlling the traffic. The study with the use of the ns3 simulator demonstrated that a given algorithm accomplishes superior performance for loss of packet, delay of latency, and power utilization than the existing algorithms.     

TCP with header checksum option for wireless links: An analytical approach towards performance evaluation

TCP performs poorly in wireless mobile networks due to large bit error rates. Basically, the TCP sender responds to these losses as if they were due to congestion in the network, and reduces the congestion window unnecessarily. In earlier work, it has been shown that adding a TCP header checksum is very useful in differentiating between congestion loss and corruption loss. With the modified TCP, receivers can explicitly indicate corruption of received packets by generating “Explicit Loss Notifications (ELNs).” This paper focuses on an analytical study of this modified TCP protocol. We derive an expression for the probability of a receiver generating successful ELN, assuming a generic link layer protocol for data transfer over wireless links. Next, we develop an analytical approach for TCP throughput evaluation under the modified scheme. We compare the throughput results obtained by analysis and simulation, and find very close agreement between the two sets. We also compare the performance of the modified scheme with the standard NewReno TCP, and find considerable improvement in data throughput over wireless links.     

An Active Queue Management Algorithm： CRED

By applying the method of average and variance, a new queue management algorithm named the Classified-Random Early Detection （CRED） algorithm is presented which can identify the media streaming, TCP traffic and other UDP traffic at the edge routers. The algorithm discriminates the slow start and the congestion control phase of the TCP traffic and combines the TCP congestion control with the IP congestion control to alleviate the congestion effectively. Simulation shows that CRED can not only make the media streaming obtain the resources needed but also protect the TCP traffic transmitted effectively and reliably.