Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
TCP in presence of bursty losses
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Approximate fairness through differential dropping
ACM SIGCOMM Computer Communication Review
Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Part II: control theory for buffer sizing
ACM SIGCOMM Computer Communication Review
Minimizing the overhead in implementing flow-aware networking
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Using partial differential equations to model TCP mice and elephants in large IP networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Time-based fairness improves performance in multi-rate WLANs
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
On the behavior of optimal scheduling algorithms under TCP sources
IZS '06 Proceedings of the 2006 International Zurich Seminar on Communications
Stability and fairness of explicit congestion control with small buffers
ACM SIGCOMM Computer Communication Review
On the impact of TCP and per-flow scheduling on internet performance
INFOCOM'10 Proceedings of the 29th conference on Information communications
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
| Hi-index | 0.00 |
Internet performance is tightly related to the properties of TCP and UDP protocols, jointly responsible for the delivery of the great majority of Internet traffic. It is well understood how these protocols behave under first-in-first-out (FIFO) queuing and what are the network congestion effects. However, no comprehensive analysis is available when flow-aware mechanisms such as per-flow scheduling and dropping policies are deployed. Previous simulation and experimental results leave a number of unanswered questions. In this paper, we tackle this issue by modeling via a set of fluid nonlinear ordinary differential equations (ODEs) the instantaneous throughput and the buffer occupancy of N long-lived TCP sources under three per-flow scheduling disciplines (Fair Queuing, Longest Queue First, Shortest Queue First) and with longest queue drop buffer management. We study the system evolution and analytically characterize the stationary regime: Closed-form expressions are derived for the stationary throughput/sending rate and buffer occupancy, which give a thorough understanding of short/ long-term fairness for TCP traffic. Similarly, we provide the characterization of the loss rate experienced by UDP flows in the presence of TCP traffic. As a result, the analysis allows to quantify benefits and drawbacks related to the deployment of flow-aware scheduling mechanisms in different networking contexts. The model accuracy is confirmed by a set of ns2 simulations and by the evaluation of the three scheduling disciplines in a real implementation in the Linux kernel.