A Spectrum Of TCP-Friendly Window-Based Congestion Control Algorithms
White Papers In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. This paper presents a comprehensive study of a new...
[November 7, 2007, 0:00]
Influence Of False Congestion Alarms On Performance For Congestion Control Based On Dynamic Window Flow Mechanism In Wireless Networks
White Papers The congestion detection mechanism of congestion control based on dynamic window flow control, which is widely used for reliable window protocols such as TCP, is well-known to be simple, but it may raise false alarms: a sender usually interprets...
[January 15, 2008, 1:01]
Sender Side Intelligence For TCP Throughput Enhancement In Wired-Cum-Wireless Network
White Papers The key idea to determine the Optimal Congestion Window for a TCP Sender, in a particular network scenario (that corresponds to the fair share of that connection) and keep this congestion window a constant to a point where the fair share in the...
[October 31, 2007, 0:00]
TCP With Sender-Based Delay Control
White Papers This paper describes a congestion control method for TCP that adjusts the transmission rate of a TCP connection by changing not only the congestion window size as in normal TCP, but also by delaying the transmission of packets at the sender.
[October 31, 2007, 0:00]
A Burstiness Control For High Speed Long Distance TCP
White Papers This has stimulated intensive research on improving TCP congestion control algorithm in order to sustain large congestion window and high throughput. Most of these works however focus almost exclusively on window control algorithm that controls the...
[October 31, 2007, 0:00]
TCP-Friendly SIMD Congestion Control And Its Convergence Behavior
White Papers Window-based congestion control schemes use increase rules to probe available bandwidth, and decrease rules to back off when congestion is detected. This paper proposes a novel window-based congestion control algorithm called SIMD (Square-Increase...
[November 7, 2007, 0:00]
TCP With Adaptive Pacing For Multihop Wireless Networks
White Papers This paper introduces a novel congestion control algorithm for TCP over multihop IEEE 802.11 wireless networks implementing rate-based scheduling of transmissions within the TCP congestion window. It shows how a TCP sender can adapt its...
[December 20, 2007, 0:01]
Congestion Control: SCTP Vs TCP
White Papers This paper characterizes an inefficiency in the current speciation of SCTP's congestion control, which degrades performance (more than necessary to be 'TCP-friendly') when there are multiple packet losses in a single window.
[December 20, 2007, 0:01]
Is Tampered-TCP Really Effective For Getting Higher Throughput In The Internet?
White Papers This paper focuses on a tampered-TCP in which the increase and decrease ratio of the congestion window size were changed during the congestion avoidance phase. This paper examines the effectiveness of tampered-TCP whose congestion control mechanism...
[December 6, 2007, 0:01]
End-to-End Bandwidth Estimation In TCP To Improve Wireless Link Utilization
White Papers TCP Westwood (TCPW) is a sender-side only modification of TCP Reno congestion control that exploits an end-to-end bandwidth estimation mechanism to set the values of Slow-Start-Threshold and Congestion-Window after a congestion episode that is...
[December 6, 2007, 0:01]
Improving TCP Performance In High Bandwidth High RTT Links Using Layered Congestion Control
White Papers This paper proposes Layered TCP (LTCP for short), a simple layering technique for the congestion window response of TCP to make it more scalable in highspeed, high RTT networks. LTCP is a two dimensional congestion control framework - the...
[December 20, 2007, 0:01]
UDT: An Application Level Transport Protocol For Grid Computing
White Papers These problems are due to slow loss-recovery, a RTT bias inherent in its AIMD congestion-control algorithm, and the bursting data flow caused by its window control. UDT has a congestion control mechanism that maintains efficiency, fairness and...
[November 17, 2004, 2:00]
Mathematical Analysis Of Westwood+ TCP Congestion Control
White Papers The estimate is used to adaptively decrease the congestion window and slow start threshold after congestion so that it can be said that Westwood+ TCP substitutes the classic multiplicative decrease with an adaptive decrease paradigm.
[December 21, 2007, 0:01]
COCOON: An Alternative Approach To End-Point Congestion Management
White Papers COCOON also allows a new connection to commerce with a congestion window that is large enough to catch up with other connections while not inducing congestion. This paper proposes an alternate endpoint congestion management scheme, called...
[December 13, 2006, 0:00]
A Burstiness Control For TCP
White Papers The paper shows that the backlog in bottleneck queue is bounded by the sum of two components: the long term effect of congestion window control algorithm and the short term effect of burstiness. A simple algorithm is proposed to measure and control...
[October 31, 2007, 0:00]
Linux 2.4 Implementation Of Westwood+ TCP With Rate-Halving: A Performance Evaluation Over The Internet
White Papers To improve classic Reno/New Reno congestion control algorithms, the recent Westwood+ TCP proposes to substitute the multiplicative decrease phase with an adaptive decrease phase: in particular, Westwood+ TCP passes through a filter the stream of...
[April 18, 2007, 1: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 21, 2007, 0:01]
TCP-Illinois: A Loss And Delay-Based Congestion Control Algorithm For High-Speed Networks
White Papers This paper introduces a new congestion control algorithm for high speed networks, called TCP-Illinois. TCP-Illinois uses packet loss information to determine whether the window size should be increased or decreased, and uses queueing delay...
[November 7, 2007, 0:00]
TCP-Planet: A Reliable Transport Protocol For InterPlaNetary Internet
White Papers The window-based congestion control, which injects a new packet into the network upon an ACK reception, is responsible for such performance degradation due to high propagation delay. The space exploration missions are crucial for acquisition of...
[October 31, 2007, 0:00]
Improving TCP Congestion Control Over Internets With Heterogeneous Transmission Media
White Papers The new congestion-control and error-recovery mechanisms in TCP Santa Cruz are based on: using estimates of delay along the forward path, rather than the round-trip delay; reaching a target operating point for the number of packets in the...
[December 27, 2007, 0:01]
