ACM SIGMETRICS Performance Evaluation Review
Adaptive and scalable comparison scheduling
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Service differentiation based on packet size and flow length in best-effort networks
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Adaptive bandwidth control to handle long-duration large flows
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Size-based scheduling: a recipe for DDOS?
Proceedings of the 17th ACM conference on Computer and communications security
Size-based and direction-based TCP fairness issues in IEEE 802.11 WLANs
EURASIP Journal on Wireless Communications and Networking
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
Sojourn time tails in the single server queue with heavy-tailed service times
Queueing Systems: Theory and Applications
Preemptive packet-mode scheduling to improve TCP performance
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Passive online RTT estimation for flow-aware routers using one-way traffic
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
A spike-detecting AQM to deal with elephants
Computer Networks: The International Journal of Computer and Telecommunications Networking
FavorQueue: A parameterless active queue management to improve TCP traffic performance
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The Internet today carries different types of traffic that have different service requirements. A large fraction of the traffic is either Web traffic requiring low response time or peer-to-peer traffic requiring high throughput. Meeting both performance requirements in a network where routers use droptail or RED for buffer management and FIFO as the service policy is an elusive goal. It is therefore worthwhile to investigate alternative scheduling and buffer management policies for bottleneck links. We propose to use the least attained service (LAS) policy to improve the response time of Web traffic. Under LAS, the next packet to be served is the one belonging to the flow that has received the least amount of service. When the buffer is full, the packet dropped belongs to the flow that has received the most service. We show that under LAS, as compared to FIFO with droptail, the transmission time and loss rate for short TCP flows are significantly reduced, with only a negligible increase in transmission time for the largest flows. The improvement seen by short TCP flows under LAS is mainly due to the way LAS interacts with the TCP protocol in the slow start phase, which results in shorter round-trip times and zero loss rates for short flows.