On applying fair queuing discipline to schedule requests at access gateway for downlink differential QoS

Authors:
Shih-Chiang Tsao;Yuan-Cheng Lai;Le-Chi Tsao;Ying-Dar Lin
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan;Department of Information Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan;Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan;Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2008

Citing 8
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Supporting quality of service in HTTP servers

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Generating representative Web workloads for network and server performance evaluation

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Integrating user-perceived quality into Web server design

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
A client-aware dispatching algorithm for web clusters providing multiple services

Proceedings of the 10th international conference on World Wide Web
Assessing and Improving TCP Rate Shaping over Edge Gateways

IEEE Transactions on Computers
Enhancing a web-server cluster with quality of service mechanisms

PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling packets is a usual solution to allocate the bandwidth on a bottleneck link. However, this solution cannot be used to manage the downlink bandwidth at the user-side access gateway, since the traffic is queued at the ISP-side gateway but not the user-side gateway. An idea is scheduling the requests at the user-side gateway to control the amount of the responses queued in the ISP-side gateway. This work first investigates the possibility of applying the class-based fair queuing discipline, which was widely and maturely used in scheduling packets, to schedule requests. However, we found that simply applying this discipline to schedule requests would encounter the timing and ordering problems at releasing requests and may not satisfy high-class users. Thus, we propose a minimum-service first request scheduling (MSF-RS) scheme. MSF-RS always selects the next request from the class receiving the minimum service to provide user-based weighted fairness, which ensures more bandwidth for high-class users. Next, MSF-RS uses a window-based rate control on releasing requests to maintain full link utilization and reduce the user-perceived latency. The results of analysis, simulation and field trial demonstrate that MSF-RS provides fairness while reducing 23-30% of user-perceived latency on average. Besides, a MSF-RS gateway can save 25% of CPU loading.