
Dynamics of tcp/aqm and a scalable control. Analysis and design of an adaptive virtual queue. Rate control for communication networks: shadow prices, proportional fairness and stability. Precise feedback for congestion control in the internet. A note on the stability requirements of adaptive virtual queue. The osu scheme for congestion avoidance in atm networks: Lessons learnt and extensions. In The Ohio State University, Department of CIS, Jan. The erica switch algorithm for abr traffic management in atm networks: Part ii: Requirements and performance evaluation. ACM Computer Communication Review Proceedings of the Sigcomm '88 Symposium, 18, 4:314-329, Aug. On designing improved controllers for aqm routers supporting tcp flows. Distributed connection acceptance control for a connectionless network. In IEEE/ACM Transactions on Networking, 1(4):397-413, Aug. Random early detection gateways for congestion avoidance. Equation-based congestion control for unicast applications. In IEEE/ACM Transactions on Networking, 5(6):835-846, Dec. Self-similarity in world wide web traffic: Evidence and possible causes.

In Computer Networks and ISDN Systems 17, page 1-14, 1989. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. An algorithm for rate allocation in a packet-switching network with feedback, 1994. Dynamic behavior of slowly-responsive congestion control algorithms. Enhancing tcp over satellite channels using standard mechanisms, Jan. Phantom: A simple and effective flow control scheme. Additionally, the new protocol does not maintain any per-flow state in routers and requires few CPU cycles per packet, which makes it implementable in high-speed routers. Further, XCP achieves fair bandwidth allocation, high utilization, small standing queue size, and near-zero packet drops, with both steady and highly varying traffic.


Extensive packet-level simulations show that XCP outperforms TCP in both conventional and high bandwidth-delay environments. This allows a more flexible and analytically tractable protocol design and opens new avenues for service differentiation.Using a control theory framework, we model XCP and demonstrate it is stable and efficient regardless of the link capacity, the round trip delay, and the number of sources. In addition, XCP introduces the new concept of decoupling utilization control from fairness control. This new eXplicit Control Protocol, XCP, generalizes the Explicit Congestion Notification proposal (ECN). This failing becomes increasingly important as the Internet evolves to incorporate very high-bandwidth optical links and more large-delay satellite links.To address this problem, we develop a novel approach to Internet congestion control that outperforms TCP in conventional environments, and remains efficient, fair, scalable, and stable as the bandwidth-delay product increases. Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme.
