Delay-bound preservation through packet scheduling at wireless access point nodes

Wireless packet schedulers have concentrated for the most part on preserving fairness in a network environment where channels are subject to location-dependent errors. By recording the lost service and compensating flows after an error period, long-term throughput and long-term fairness can be maintained. This paper stresses that what is most pertinent to current wireless QoS however, is the preservation of delay guarantees for sessions in the face of channel errors. A traffic profile and priority based wireless fair queuing (TPP-WFQ) scheduling approach is proposed, which utilizes all available residue bandwidth in the system to allow sessions to catch up to their error-free service as quickly as possible. In addition, a bandwidth management platform that adjusts session weights for use by the scheduler is presented. Priority is given to real-time traffic with strict delay bounds for both bandwidth utilization and compensation. Simulated results illustrate how maintaining short-term delay guarantees in this way does not affect long term fairness and throughput guarantees for other sessions more tolerant to delay.

[1]  Kee Chaing Chua,et al.  CS-WFQ: a wireless fair scheduling algorithm for error-prone wireless channels , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[2]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[3]  Toni Janevski Traffic Analysis and Design of Wireless IP Networks , 2003 .

[4]  Songwu Lu,et al.  A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms , 2002, Wirel. Networks.

[5]  Hiroyuki Morikawa,et al.  Fair scheduling algorithm for wireless packet networks , 1999, Proceedings of the 1999 ICPP Workshops on Collaboration and Mobile Computing (CMC'99). Group Communications (IWGC). Internet '99 (IWI'99). Industrial Applications on Network Computing (INDAP). Multime.

[6]  Kimberly Claffy,et al.  Internet traffic characterization , 1994 .

[7]  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.

[8]  Satish K. Tripathi,et al.  Enhancing throughput over wireless LANs using channel state dependent packet scheduling , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[9]  Anthony Ephremides,et al.  Optimal scheduling with strict deadlines , 1989 .

[10]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1997, SIGCOMM '97.

[11]  Parameswaran Ramanathan,et al.  Adapting packet fair queueing algorithms to wireless networks , 1998, MobiCom '98.

[12]  Sara Oueslati,et al.  Quality of service and flow level admission control in the Internet , 2002, Comput. Networks.

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

[14]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[15]  Vincent K. N. Lau,et al.  Efficient Packet Scheduling Using Channel Adaptive Fair Queueing in Distributed Mobile Computing Systems , 2004, Mob. Networks Appl..

[16]  Analysis and Simulation of a Fair Queuing Algorithm , 2008 .

[17]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.