Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System
Journal of the ACM (JACM)
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On the characteristics and origins of internet flow rates
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
New directions in traffic measurement and accounting
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Preferential treatment for short flows to reduce web latency
Computer Networks: The International Journal of Computer and Telecommunications Networking
Drop Strategies and Loss-Rate Differentiation
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
Simulation analysis of RED with short lived TCP connections
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint international conference on Measurement and modeling of computer systems
The Foreground-Background queue: A survey
Performance Evaluation
Perspectives on router buffer sizing: recent results and open problems
ACM SIGCOMM Computer Communication Review
Optimal scheduling of jobs with a DHR tail in the M/G/1 queue
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Improvement of LRU cache for the detection and control of long-lived high bandwidth flows
Computer Communications
Trends and differences in connection-behavior within classes of internet backbone traffic
PAM'08 Proceedings of the 9th international conference on Passive and active network measurement
EFD: an efficient low-overhead scheduler
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Size-based flow-scheduling using spike-detection
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Size-based scheduling to improve the performance of short TCP flows
IEEE Network: The Magazine of Global Internetworking
Using spikes to deal with elephants
PCCC '11 Proceedings of the 30th IEEE International Performance Computing and Communications Conference
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The current TCP/IP architecture is known to be biased against flows of small sizes-small flows (or mice)-in the network, thereby affecting the completion times of small flows. A common approach taken to solve this problem is to prioritize small flows over large flows (elephants) during the packet-scheduling phase in the router. Past studies have shown that such 'size-based' priority schedulers improve the completion times of small flows with negligible affects on the completion times of large flows. On the flip side, most approaches are not scalable with increasing traffic, as they need to trace flows and estimate ongoing sizes of active flows in the router. In this context, this work attempts to improve the performance of small flows using an active queue management (AQM) system, without needing to track sizes of flows. The core idea is to exploit a TCP property in detecting large 'spikes' and hence large flows, from which packets are dropped, and importantly, only at times of congestion. In this way, we use only a single queue, diverting from the multi-queueing systems used in size-based schedulers. We propose two spike-detecting AQM policies: (i) SDS-AQM that drops packets deterministically, and (ii) SDI-AQM that drops packets randomly. Using a simple Markov Chain model, we compare these new policies with the well-known RED AQM, highlighting the loss behavior. We also perform simulations, and using a number of metrics, compare the performance of (mostly) small flows obtained under the new AQMs against that obtained under the traditional drop-tail buffer, RED as well as a size-based flow-scheduler PS+PS. Surprisingly, RED is seen to give better performance than the size-based flow-scheduler developed specifically for improving the response times of small flows. Further, we find that the spike-detecting AQM policies give better performance to small flows than any other policy (including RED). Of the three scenarios we consider, two experiment with different buffer sizes-one with large buffer size (BDP) and another with small size (fraction of BDP). The third scenario considers the case where slow and fast flows compete. The results show that the spike-detecting AQM policies, unlike other policies, consistently give improved performance to small flows in all three scenarios. Of the two, the SDI-AQM performs better with respect to some metrics.