Nowadays, the bulk of Internet traffic uses TCP protocol for reliable transmission. But the standard TCP's performance is very poor in High Speed Networks (HSN) and hence the core gigabytes links are usually underutilization. This problem has roots in conservative nature of TCP, especially in its Additive Increase Multiplicative Decrease (AIMD) phase. In other words, since TCP can't figure out precisely the congestion status of the network, it follows a conservative strategy to keep the network from overwhelming. We believe that precisely congestion estimation in the network can solve this problem by avoiding unnecessary conservation. To this end, this paper proposes an algorithm which considers packet loss and delay information jointly and employs a probabilistic approach to accurately estimation of congestion status in the network. To examine the proposed scheme performance, extensive simulations have been performed in the NS-2 environment. Simulation results reveal that the proposed algorithm has better performance than existing algorithms in terms of bottleneck utilization, stability, throughput and fairness.
翻译:目前,大部分互联网流量都使用TCP协议进行可靠的传输。但在高速网络中,标准TCP的性能非常差,因此核心千兆字节连接通常没有得到充分利用。这个问题的根源在于TCP的保守性,特别是其添加倍增效应(AIMD)阶段。换句话说,由于TCP无法精确地查明网络的拥挤状况,它遵循保守的战略,使网络不被压倒。我们认为,准确估计网络的拥堵可以避免不必要的保护来解决这个问题。为此,本文件提出一种算法,即考虑包装损失和延迟信息,并采用概率性方法准确估计网络的拥堵状况。为了审查拟议的计划性业绩,已经在NS-2环境中进行了广泛的模拟。模拟结果表明,拟议的算法在瓶盖的使用、稳定性、吞吐量和公平性方面比现有的算法表现要好。