Data networks
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Congestion avoidance and control
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Internet stream size distributions
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The effects of active queue management on web performance
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Controlling High-Bandwidth Flows at the Congested Router
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
The War between Mice and Elephants
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
On Class-Based Isolation of UDP, Short-Lived and Long-Lived TCP Flows
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Longitudinal study of Internet traffic in 1998-2003
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Approximate fair bandwidth sharing in high-speed multimedia networks
BT Technology Journal
Effective fair allocation using smart market label auction with CSLF and CR-CSFQ
Journal of Systems and Software - Special issue: Quality software
Dynamic QoS queuing control mechanism for multimedia differentiated services
Information Sciences: an International Journal
Advances in internet congestion control
IEEE Communications Surveys & Tutorials
Lifetime-based TCP service differentiation
Computer Communications
On TCP performance in a heterogeneous network: a survey
IEEE Communications Magazine
Cross-layer design for wireless networks
IEEE Communications Magazine
SCTP: state of the art in research, products, and technical challenges
IEEE Communications Magazine
Congestion control mechanisms and the best effort service model
IEEE Network: The Magazine of Global Internetworking
Packet-level traffic measurements from the Sprint IP backbone
IEEE Network: The Magazine of Global Internetworking
Optimization for signal setting problems using non-smooth techniques
Information Sciences: an International Journal
Per-stream loss behavior of ΣMAP/M/1/K queuing system with a random early detection mechanism
Information Sciences: an International Journal
A novel self-tuning feedback controller for active queue management supporting TCP flows
Information Sciences: an International Journal
| Hi-index | 0.07 |
Transmission control protocol (TCP) has been recognized as the most important transport-layer protocol for the Internet. It is distinguished by its reliable transmission, flow control, and congestion control. However, the issue of fair bandwidth-sharing among competing flows was not properly addressed in TCP. As web-based applications and interactive applications grow more popular, the number of short-lived flows conveyed on the Internet continues to rise. With conventional TCP, short-lived flows will be unable to obtain a fair share of available bandwidth. As a result, short-lived flows will suffer from longer delays and a lower service rate. It is essential for the Internet to come up with an effective solution to this problem in order to accommodate the new traffic patterns. With a more equitable sharing of bottleneck bandwidth as its goal, a stateless queue management scheme featuring early drop maximum (EDM) is developed and presented in this article. The fundamental idea is to drop packets from those flows having more than an equal share of bandwidth. The congestion window size of a TCP sender is carried in the options field on each packet. The proposed scheme will be exercised on routers and make its decision on packet dropping according to the congestion windows. In case of link congestion, the queued packet with the largest congestion window will be dropped from the queue. This will lower the sending rate of its sender and release part of the occupied bandwidth for the use of other competing flows. By so doing, the entire system will approach an equilibrium point with a rapid and fair distribution of bandwidth. As a stateless approach, the proposed scheme inherits numerous advantages in implementation and scalability. Extensive simulations were conducted to verify the feasibility and the effectiveness of the proposed approach. As revealed in the simulation results, the proposed scheme outperforms existing stateless techniques, including Drop-Tail and Random Early Drop, in many respects, such as a fairer sharing of available bandwidth and a shorter response time for short-lived flows.