共查询到20条相似文献,搜索用时 93 毫秒
1.
TCP拥塞控制机制浅析 总被引:2,自引:0,他引:2
TCP是当今网络中主要的传输协议,它采用了慢启动、拥塞避免、快速重传、快速恢复四种算法,能满足IP网络中数据的可靠传输。但是当出现多个数据包丢失时,由于TCP采用了累计确认机制,造成系统吞吐量下降。文章介绍了一种SACK拥塞控制机制,与传统的Tahoe、Reno对比,并通过仿真实验说明了SACK是一种最好的TCP恢复机制。 相似文献
2.
即时恢复--一种新的TCP拥塞控制快速恢复算法 总被引:2,自引:0,他引:2
针对TCP连接的网络传输中经常会出现同一窗口多个分组丢失的情况,本文提出了一种新的TCP拥塞控制快速恢复算法:即时恢复算法。即时恢复算法能在恢复阶段探测网络的可用带宽,并将之用于窗口拥塞控制。另外,通过动态设定退出恢复阶段的参数域值,除了能恢复首次丢失的多个分组外,该算法还能很好的解决恢复阶段分组进一步丢失的情况。与SACK、FACK TCP等算法需要对TCP协议的发送、接收部分同时修改不同,该算法只需修改协议的发送部分,而接收部分不需作任何改变。在ns仿真环境的仿真结果表明:在同一窗口有多个分组丢失时,即时恢复算法的性能比TCP New-Reno有较大提高,与 SACK TCP性能相当。 相似文献
3.
针对自动重复重传(ARQ)机制在无线广播系统中吞吐量性能不佳的缺陷,提出一种基于随机网络编码的广播重传方案RNC-ARQ.对于广播节点,采用随机线性码对所有丢失包进行编码组合重传.对于接收节点,当接收的编码包累积到一定数量后可通过解码操作恢复出原始数据.该方案可有效减少重传次数,改善无线广播的吞吐量性能.基于Gilbert-Elliott模型描述的突发错误信道,建立了信道状态和节点接收处理流程合并的多状态马尔可夫模型,并以此为基础推导了RNC-ARQ方案的吞吐量闭合解.最后,使用NS-2模拟器评估RNC-ARQ方案的性能,结果表明在突发差错信道下,基于随机网络编码重传方案的吞吐量优于传统的选择承传ARQ方案和基于异或编码的重传方案. 相似文献
4.
针对高链路分组丢失率下HLAR (hash lookup assisted retransmission)等重传方法存在的编码率低、算法性能下降等缺陷,提出了一种改进的基于机会网络编码的广播重传方法.该方法根据接收节点反馈的丢失分组情况,不仅能够通过散列查找快速选择丢失分组组合进行编码重传,并优先重传能让最多接收节点恢复其丢失分组的单个重传分组,而且基于邻域关联充分挖掘编码机会,允许节点从多个重传分组中恢复丢失分组,从而在保持较低算法复杂度的情况下,有效地提高重传性能.仿真结果表明,相对于已有算法,该方法能有效减少重传次数,提高传输效率. 相似文献
5.
6.
基于mSCTP,通过分析影响垂直切换性能的两个问题,即切换到新路径上的慢启动现象导致的吞吐量骤降,以及由于原无线信号的迅速衰减使得SACK丢失导致的多余重传,引入一种垂直切换性能优化的改良方案mSCTP-IPVHO。通过仿真表明,mSCTP-IPVHO能在一定程度上优化异构网络垂直切换性能。 相似文献
7.
8.
基于mSCTP,通过分析影响垂直切换性能的两个问题,即切换到新路径上的慢启动现象导致的吞吐量骤降,以及由于原无线信号的迅速衰减使得SACK丢失导致的多余重传,引入一种垂直切换性能优化的改良方案mSCTP-IPVHO.通过仿真表明,mSCTP-IPVHO能在一定程度上优化异构网络垂直切换性能. 相似文献
9.
10.
文章介绍了一种新的传输层协议SCTP(流控制传输协议),该协议的拥塞控制算法主要建立在TCP协议基于窗口的和式增加、积式减少机制之上,由慢启动、拥塞避免、快速重传和快速恢复四个核心算法构成,并且把TCP协议对SACK的可选支持变成必须支持的功能.使其在部分网络失效或者存在突发流量的情况下仍然能够正常工作。 相似文献
11.
Qiong Zhang Neal Charbonneau Vinod M. Vokkarane Jason P. Jue 《Photonic Network Communications》2011,22(3):299-312
For optical burst-switched (OBS) networks in which TCP is implemented at a higher layer, the loss of bursts can lead to serious
degradation of TCP performance. Due to the bufferless nature of OBS, random burst losses may occur, even at low traffic loads.
Consequently, these random burst losses may be mistakenly interpreted by the TCP layer as congestion in the network. The TCP
sender will then trigger congestion control mechanisms, thereby reducing TCP throughput unnecessarily. In this paper, we introduce
a controlled retransmission scheme in which the bursts lost due to contention in the OBS network are retransmitted at the
OBS layer. The OBS retransmission scheme can reduce the burst loss probability in the OBS core network. Also, the OBS retransmission
scheme can reduce the probability that the TCP layer falsely detects congestion, thereby improving the TCP throughput. We
develop an analytical model for evaluating the burst loss probability in an OBS network that uses a retransmission scheme,
and we also analyze TCP throughput when the OBS layer implements burst retransmission. We develop a simulation model to validate
the analytical results. Simulation and analytical results show that an OBS layer with controlled burst retransmission provides
up to two to three orders of magnitude improvement in TCP throughput over an OBS layer without burst retransmission. This
significant improvement is primarily because the TCP layer triggers fewer time-outs when the OBS retransmission scheme is
used. 相似文献
12.
Most existing reliable multicast congestion control (RMCC) mechanisms try to emulate TCP congestion control behaviors for achieving TCP-compatibility. However, different loss recovery mechanisms employed in reliable multicast protocols, especially NAK-based retransmission and local loss recovery mechanisms, may lead to different behaviors and performance of congestion control. As a result, reliable multicast flows might be identified and treated as non-TCP-friendly by routers in the network. It is essential to understand those influences and take them into account in the development and deployment of reliable multicast services. In this paper, we study the influences comprehensively through analysis, modelling and simulations. We demonstrate that NAK-based retransmission and/or local loss recovery mechanisms are much more robust and efficient in recovering from single or multiple packet losses within a single round-trip time (RTT). For a better understanding on the impact of loss recovery on RMCC, we derive expressions for steady-state throughput of NAK-based RMCC schemes, which clearly brings out the throughput advantages of NAK-based RMCC over TCP Reno. We also show that timeout effects have little impact on shaping the performance of NAK-based RMCC schemes except for extremely high loss rates (>0.2). Finally, we use simulations to validate our findings and show that local loss recovery may further increase the throughput and deteriorate the fairness properties of NAK-based RMCC schemes. These findings and insights could provide useful recommendations for the design, testing and deployment of reliable multicast protocols and services 相似文献
13.
14.
In this paper, we propose an aware-based adaptive opportunistic retransmission control scheme for wireless multimedia Mesh
networks. The proposed scheme provides maximum retransmission count optimization based on environment-aware to improve packet
relay probability. The scheme discriminates the types of packet loss in wireless link by means of environment information
and selects the retransmission count by taking the IEEE 802.11 wireless channel characteristics into consideration. Furthermore,
the maximum retransmission count of MAC is adjusted adaptively. Extensive simulations demonstrate that the proposed scheme
significantly reduces packet collision probability and packet loss rate, and thus improves network throughput. 相似文献
15.
16.
17.
在Ad hoc网络中保证组播通信的可靠性要面对Ad hoc网络高误码率、带宽受限、节点能量有限和拓扑结构频繁变化等技术挑战。该文将协同的思想引入到组播丢失恢复设计中,设计了新的基于协同的可靠组播丢失恢复算法(CoreRM)。根据各个节点经历的不同丢失情况,通过自适应选择本地恢复、全局恢复或发送端恢复,分布式地处理整个网络的丢失恢复。CoreRM还设计了恢复路径缓存、NAK抑制机制,以及源路由数据包(SPM)发送机制来应对Ad hoc网络中的拓扑变化。性能分析和NS2的仿真实验表明相对于UDP和PGM可靠组播通信,CoreRM算法可以在网络吞吐量和丢失恢复延时方面有显著性能改善。 相似文献
18.
19.
A major concern in optical burst-switched (OBS) networks is contention, which occurs when more than one bursts contend for the same data channel at the same time. Due to the bufferless nature of OBS networks, these contentions randomly occur at any degree of congestion in the network. When contention occurs at any core node, the core node drops bursts according to its dropping policy. Burst loss in OBS networks significantly degrades the throughput of TCP sources in the local access networks because current TCP congestion control mechanisms perform a slow start phase mainly due to contention rather than heavy congestion. However, there has not been much study about the impact of burst loss on the performance of TCP over OBS networks. To improve TCP throughput over OBS networks, we first introduce a dropping policy with burst retransmission that retransmits the bursts dropped due to contention, at the ingress node. Then, we extend the dropping policy with burst retransmission to drop a burst that has experienced fewer retransmissions in the event of contention at a core node in order to reduce the number of events that a TCP source enters the slow start phase due to contention. In addition, we propose to limit the number of retransmissions of each burst to prevent severe congestion. For the performance evaluation of the proposed schemes, we provide an analytic throughput model of TCP over OBS networks. Through simulations as well as analytic modeling, it is shown that the proposed dropping policy with burst retransmission can improve TCP throughput over OBS networks compared with an existing dropping policy without burst retransmission. 相似文献
20.
Yu-Sun Liu 《Communications, IEEE Transactions on》2004,52(2):191-194
A fully connected frequency-hop packet radio network is considered. Four packet-combining techniques are presented, which significantly reduce the packet-error rate. An analytical model is used to offer insight into how system dynamics are affected by the error-control method and retransmission backoff policy. It is shown that enhancing the error-control method increases the maximum throughput of the network and alleviates the stability problem, but does not solve the problem. On the other hand, a good choice of retransmission backoff policy solves the stability problem, but does not alter the maximum throughput. These results suggest that in order to construct a stable network with large throughput, a good error-control method and retransmission backoff policy are both necessary. 相似文献