aimd

ZDNet Resources

• sort by:
• Relevance
• Date
• Popularity

Fixing the unfairness of TCP congestion control

Bob Briscoe Chief researcher at the BT Network Research Centre is on a mission to tackle one of the biggest problems facing the Internet.  He wants the world to know that TCP Transmission Control Protocol congestion control is fundamentally broken and he has a proposal for the IETF to fix...

Tags: Algorithm, Application, Bandwidth, Network, P2P, TCP, Bob Briscoe, Van Jacobson, Jacobson, AIMD, ECN, Tcp/Ip, Networking, Peer To Peer (P2P), Internet, George Ou

Blog posts 2008-03-24

Additional Resources

Another unannounced piece of Microsoft's Windows Mobile puzzle: eLive

Microsoft seems to be continuing to keep most of its Windows Mobile cards close to the vest, even though it is CTIA Wireless week. At the show on April 1, company officials are talking up some of the new features slated for the updates of Windows Live...

Tags: Microsoft Windows Mobile, Mobile, Microsoft Corp., eLive, Microsoft Windows, Operating Systems, Handhelds, Advertising & Promotion, Software, Hardware, Marketing, Mary Jo Foley

Blog posts 2008-04-01

Scalable IP-VPN Flow Control Mechanism Supporting Arbitrary Fairness Criteria

In recent years, IP-based Virtual Private Networks (IP-VPNs), which provide a virtual privately owned network over an IP network, have attracted attention. With existing IP-VPNs, however, there is a serious problem that fairness among IPVPN customers is not satisfied. This paper first discuss design objectives of a control mechanism for...

Tags: IP VPN, Fairness, Osaka University, VPNs, Network Security, Networking, Telecommunications

White papers 2007-11-16

An Extension of the Square Root Law of TCP

Using probabilistic scaling methods, the square root law of TCP to schemes is extended which may not be of the AIMD type. The results offer insight in the relationship between throughput and loss rate, and the time scale on which losses take place. Similar results are shown to hold in...

Tags: Georgia Institute Of Technology, Loss, TCP, Tcp/Ip, Networking

White papers 2007-09-05

On the Behavior of Optimal Scheduling Algorithms Under TCP Sources

This paper focuses on the dynamical interaction between regulated Additive Increase Multiplicative Decrease AIMD traffic sources and the max-scalar scheduling policy, which has been proved to be optimal in terms of throughput in case of stationary unregulated traffic sources. It describes the average dynamics of both sources and queues dynamics...

Tags: Algorithm, TCP, Dynamics, Source, Tcp/Ip, Engineering, Networking

White papers 2007-03-19

Enhancing Video Streaming Delivery Over Wired/Wireless Networks

Transmission Control Protocol TCP is basically designed to provide a reliable service for wired Internet. The Additive Increase Multiplicative Decrease AIMD algorithm, incorporated into standard TCP versions, achieves stability and converges to fairness when the demand of competing flows exceeds the channel bandwidth. However, most existing TCP mechanisms do not...

Tags: Streaming Video, TCP, Tcp/Ip, Networking

White papers 2007-02-16

Network Calculus Based Simulation for TCP Congestion Control: Theorems, Implementation, and Evaluation

This paper examines the feasibility of incorporating network calculus based models in simulating TCP/IP networks. By exploiting network calculus properties, the authors characterize how TCP congestion control - additive increase and multiplicative decrease AIMD, together with the queue management strategy used in routers, regulates TCP flows. The paper first divides...

Tags: Network, TCP, Tcp/Ip, Networking

White papers 2007-01-01

SCTP and TCP Variants: Congestion Control Under Multiple Losses

Inefficiency in the current specification of SCTP's congestion control is characterized, which degrades performance when there are multiple packet losses in a single window. An SCTP variant, called New-Reno SCTP is presented, which introduces three modifications. First, a Fast Recovery mechanism, similar to that of New-Reno TCP, is included to...

Tags: Congestion Control, Window, TCP, University Of Delaware, Construction, Tcp/Ip, Networking

White papers 2007-01-01

Analysis of Scalable TCP in the Presence of Markovian Losses

In high speed networks, the standard TCP's AIMD algorithm was observed to be inefficient in utilizing the link capacity. As a result of which several proposals such as High-Speed TCP, FAST and Scalable TCP, were put forward. In contrast to the additive increase multiplicative decrease algorithm used in the standard...

Tags: Algorithm, Window, Computer Science, TCP, Analysis, Tcp/Ip, Engineering, Construction, Networking

White papers 2007-01-01

Mathematical Analysis of Westwood+ TCP Congestion Control

TCP congestion control is based on an Additive-Increase/Multiplicative-Decrease AIMD probing paradigm aimed at adapting the sending rate of TCP data sources to match the Internet time-varying available bandwidth. Westwood+ TCP has been recently proposed to improve the tracking of available bandwidth of classic TCP. It is based on an end-to-end...

Tags: Bandwidth, TCP, Analysis, TCP Congestion Control, Tcp/Ip, Networking

White papers 2006-04-05