|標題:||On applying fair queuing discipline to schedule requests at access gateway for downlink differential QoS|
Department of Computer Science
|關鍵字:||Request scheduling;Access gateway;Fair queuing|
|摘要:||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. (C) 2008 Elsevier B.V. All rights reserved.|
|Appears in Collections:||Articles|
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.