Previous
TCP Congestion Control With A Misbehaving Receiver
White Papers This paper explores the operation of TCP congestion control when the receiver can misbehave, as might occur with a greedy Web client. The paper first demonstrates that there are simple attacks that allow a misbehaving receiver to drive a standard...
[October 30, 2007, 23:00]
TCP Congestion Control In Fast Long-Distance Networks
White Papers TCP congestion control is currently based on Jacobson's algorithms (slow-start and congestion avoidance), devised back in 1988, with improvements such as SACK and NewReno. Although TCP has proved remarkably flexible thus far and managed to adapt to...
[October 29, 2007, 23:00]
Congestion Control And An Analysis Of TCP-Friendly Rate Control
White Papers This paper presents a history of congestion control research and an analysis of a specific rate-based congestion control protocol, TCP-friendly rate control (TFRC). The classic TCP congestion control mechanisms are introduced as an instance of...
[January 14, 2008, 23:00]
SCTP And TCP Variants: Congestion Control Under Multiple Losses
White Papers First, a Fast Recovery mechanism, similar to that of New-Reno TCP, is included to avoid multiple congestion window (cwnd) reductions in a single round-trip time. Inefficiency in the current specification of SCTP's congestion control is...
[December 5, 2007, 23:00]
Congestion Control In Linux TCP
White Papers TCP performance is strongly influenced by its congestion control algorithms that limit the amount of transmitted traffic based on the estimated network capacity and utilization. The authors describe the fundamentals of the Linux TCP design...
[April 3, 2007, 0:00]
TCP Westwood: Congestion Control With Faster Recovery
White Papers This paper proposes a new version of the TCP protocol, called TCP Westwood, which enhances the performance of TCP window congestion control by using as feedback the end-to-end measurement of the bandwidth available along a TCP connection.
[December 4, 2007, 23:00]
TCP Symbiosis: Congestion Control Mechanisms Of TCP Based On Lotka-Volterra Competition Model
White Papers This paper proposes TCP Symbiosis, which has a robust, self-adaptive and scalable congestion control mechanism for TCP. The paper changes the window size of a TCP connection in response to information of the physical and available bandwidths of the...
[December 20, 2007, 23:00]
Congestion Control Mechanism Of TCP For Achieving Predictable Throughput
White Papers This paper proposes a congestion control mechanism of TCP for achieving predictable throughput. It does not mean one can guarantee the throughput, while one can provide the throughput required by an upper-layer application at high probability when...
[December 20, 2007, 23:00]
Media-And TCP-Friendly Congestion Control Algorithm For Scalable Video Streams (Extended Version)
White Papers This paper presents a Media- and TCP-Friendly Rate-based Congestion Control algorithm (MTFRCC) for scalable video streaming in the Internet. The paper uses simulations to evaluate the algorithm and compare the results against the state-of-the-art...
[December 26, 2007, 23:00]
Analysis On Adjustment-Based TCP-Friendly Congestion Control: Fairness And Stability
White Papers This paper focuses on understanding the binomial congestion control algorithms, and can generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k=0) and generalize TCP-style...
[January 14, 2008, 23:00]
A Case For Exploiting Self-Similarity Of Network Traffic In TCP Congestion Control
White Papers This paper explores the issue of exploiting the self-similar characteristics of network traffic in TCP congestion control. On the flip side, the ubiquity of scale-invariant burstiness observed across diverse networking contents can be exploited to...
[April 7, 2005, 0:00]
Using TCP Congestion Control To Improve The Performances Of Optical Burst Switched Networks
White Papers This paper proposes using a modified TCP decoupling approach as a congestion control mechanism for optical burst switched networks. The TCP decoupling approach is a novel way that can apply TCP congestion control to any traffic flow (which can be...
[January 14, 2008, 23:00]
The Effect Of Reverse Traffic On The Performance Of New TCP Congestion Control Algorithms
White Papers Several new TCP congestion control algorithms have been proposed to speed up the TCP over very fast networks. On the other hand, all of them preserve the self-clocking mechanism, which is a fundamental part of the classic Van Jacobson TCP...
[December 26, 2007, 23:00]
Generalized Window Advertising For TCP Congestion Control
White Papers The Generalized Window Advertising (GWA) scheme proposed in this paper is a new approach for enhancing the congestion control properties of TCP. Congestion in the Internet is a major cause of network performance degradation.
[December 5, 2007, 23:00]
Enhancing TCP Congestion Control Via Connection Bandwidth Estimation, A Performance Study
White Papers This paper presents performance studies of TCP Westwood (TCPW), a sender-side modification of the congestion window control scheme in TCP. The estimate is then used to compute congestion window and slow start threshold after a congestion episode...
[December 4, 2007, 23:00]
Optimal TCP Congestion Control
White Papers An optimal decentralized congestion avoidance algorithm for TCP is developed by applying optimal control theory to an abstracted model of a bottlenecked TCP connection. A stochastic model of the cross-traffic, both TCP and non-TCP, on the...
[December 6, 2007, 23:00]
Performance Evaluation Of TCP Congestion Control Algorithms Over UMTS
White Papers TCP congestion control was designed and optimized for wired networks. As a consequence, many improved TCP congestion control algorithms, able to effectively operate over hybrid wired/wireless networks, as well as, layer 2 optimizations, hiding to...
[December 20, 2007, 23:00]
Comparative Study Of TCP Compatible Binomial Congestion Control Schemes
White Papers Current TCP implementations employ Additive Increase Multiplicative Decrease (AIMD) as the congestion control mechanism. Recently, a new set of schemes called Binomial Congestion Control Schemes (BCCS) were proposed and a section of these schemes...
[October 30, 2007, 23:00]
TCP-Adaptive Reno For Improving Efficiency-Friendliness Tradeoffs Of TCP Congestion Control Algorithm
White Papers A key feature of TCP-AReno is that it dynamically adjusts the TCP response function based on congestion estimation via RTT measurement. It increases congestion window faster and decreases the window less significantly than TCP-Reno when it...
[December 26, 2007, 23:00]
Modeling The Effect Of Short-Term Rate Variations On TCP-Friendly Congestion Control Behavior
White Papers Usually a flow is claimed to be TCP-friendly when its throughput is theoretically the same as the throughput of a TCP flow when they experience the same congestion signals. However, when flows compete for bandwidth, they may not have the same...
[December 6, 2007, 23:00]
