A Fair Scheduling Algorithm for Wireless Internet Differentiated Service Networks

Sang-Jo YOO  Kang-Sik SHIN  

IEICE TRANSACTIONS on Communications   Vol.E88-B   No.9   pp.3682-3692
Publication Date: 2005/09/01
Online ISSN: 
DOI: 10.1093/ietcom/e88-b.9.3682
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
wireless scheduling,  Internet QoS,  DiffServ,  location-dependent error,  fair queueing,  

Full Text: PDF>>
Buy this Article

The recent Internet needs a network structure and traffic engineering that can support various applications requiring differentiated traffic processing and a high quality of service. The extension of the Internet from wired to wireless systems that generate location-dependent and burst errors has made the support of good services more difficult with existing packet scheduling algorithms. Accordingly, this paper proposes a wireless differentiated service packet scheduling (WDSPS) algorithm that can provide reliable and fair services in differentiated wireless internet service networks. As such, the proposed scheduling algorithm solves the HOL blocking problem within a class packet queue that occurs in a wireless network, supports differentiated services for each class defined in a differentiated service network, and facilitates gradual and efficient service compensation not only among classes but also among flows within a class, thereby preventing a monopoly by one class or one flow. Simulations confirmed that the proposed WDSPS scheduling algorithm could provide the required QoS differentiation between classes and enhanced the service throughput under various wireless network conditions.