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

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.

[1]  Tzi-cker Chiueh,et al.  Performance guarantee for cluster-based Internet services , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..

[2]  Michele Colajanni,et al.  Enhancing a web-server cluster with quality of service mechanisms , 2002, Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326).

[3]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[4]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[5]  L. Cherkasova,et al.  Session-based admission control: a mechanism for improving performance of commercial Web sites , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[6]  Michele Colajanni,et al.  A client-aware dispatching algorithm for web clusters providing multiple services , 2001, WWW '01.

[7]  Allan Kuchinsky,et al.  Integrating user-perceived quality into Web server design , 2000, Comput. Networks.

[8]  Ying-Dar Lin,et al.  Assessing and improving TCP rate shaping over edge gateways , 2004, IEEE Transactions on Computers.

[9]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[10]  Raju Pandey,et al.  Supporting quality of service in HTTP servers , 1998, PODC '98.

[11]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[12]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.