Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
ACM SIGCOMM Computer Communication Review
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
High performance TCP in ANSNET
ACM SIGCOMM Computer Communication Review
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Understanding the performance of many TCP flows
Computer Networks: The International Journal of Computer and Telecommunications Networking
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Link Buffer Sizing: A New Look at the Old Problem
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A Smart TCP Acknowledgment Approach for Multihop Wireless Networks
IEEE Transactions on Mobile Computing
Rd network services: differentiation through performance incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Trading link utilization for queueing delays: An adaptive approach
Computer Communications
ABS: Adaptive buffer sizing for heterogeneous networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards scalable and realistic node models for network simulators
Proceedings of the ACM SIGCOMM 2011 conference
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
On the fair coexistence of loss- and delay-based TCP
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In explicit or delay-driven congestion control, a common objective is to sustain high throughput without long queues and large losses at the bottleneck link of the network path. Congestion control protocols strive to achieve this goal by transmitting smoothly in the steady state. The discovery of the appropriate steady-state transmission rates is a challenging task in itself and typically introduces additional queuing and losses. Seeking insights into the steady-state profiles of queuing and loss achievable by real protocols, this paper presents an AIST (Asynchronous arrivals with Ideally Smooth Transmission) model that abstracts away transient queuing and losses related to discovering the path capacity and redistributing it fairly among the packet flows on the bottleneck link. In AIST, the flows arrive asynchronously but transmit their packets at the same constant rate in the steady state. For the link with an overprovisioned buffer, our queuing-theoretic analysis and simulations for different smooth distributions of packet interarrival times agree that queuing under AIST with the target utilization of 1 is on the order of the square root of N, where N is the number of flows. With small buffers, our simulations of AIST show an ability to provide bounded loss rates regardless of the number of flows.