Downlink Wireless Packet Scheduling with Deadlines

Next-generation cellular wireless communication networks aim to provide a variety of quality-of-service (QoS)-sensitive packet-based services to downlink users. Included among these are real-time multimedia services, which have stringent delay requirements. Downlink packet scheduling at the base station plays a key role in efficiently allocating system resources to meet the desired level of QoS for various users. In this paper, we employ dynamic programming (DP) to study the design of a downlink packet scheduler capable of supporting real-time multimedia applications. Under well-justified modeling reductions, we extensively characterize structural properties of the optimal control associated with the DP problem. We leverage intuition gained from these properties to propose a heuristic scheduling policy, namely, Channel-Aware Earliest Due Date (CA-EDD), which is based on a "quasi- static" approach to scheduling. The per-time-slot implementation complexity of CA-EDD is only O(K) for a system with K downlink users. Experimental results show that CA-EDD delivers up to 50 percent of performance gains over benchmark schedulers. CA-EDD achieves these performance gains by using channel and deadline information in conjunction with application layer information (relative importance of packets) in a systematic and unified way for scheduling.

[1]  Gordon L. Stuber,et al.  Principles of mobile communication (2nd ed.) , 2001 .

[2]  Khaled M. F. Elsayed,et al.  Channel-Aware Earliest Deadline Due Fair Scheduling for Wireless Multimedia Networks , 2006, Wirel. Pers. Commun..

[3]  Leandros Tassiulas,et al.  QoS provisioning for real-time traffic in wireless packet networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[4]  Theodore S. Rappaport,et al.  Cross-layer design for wireless networks , 2003, IEEE Commun. Mag..

[5]  R. Srikant,et al.  Scheduling Real-Time Traffic With Deadlines over a Wireless Channel , 1999, WOWMOM '99.

[6]  N. Bambos,et al.  Deadline constrained packet scheduling for wireless networks , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..

[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]  Gordon L. Stüber Principles of mobile communication , 1996 .

[9]  Donald C. Cox,et al.  An adaptive cross-layer scheduler for improved QoS support of multiclass data services on wireless systems , 2005, IEEE Journal on Selected Areas in Communications.

[10]  Jean Walrand An introduction to queuing networks , 1988 .

[11]  Lang long,et al.  On cross-layer design of wireless networks , 2004, Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710).

[12]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[13]  Ibrahim Matta,et al.  Markov-based channel characterization for tractable performance analysis in wireless packet networks , 2004, IEEE Transactions on Wireless Communications.

[14]  Mohit Agarwal,et al.  Base station scheduling of requests with fixed deadlines , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[16]  Matthew S. Grob,et al.  CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users , 2000, IEEE Commun. Mag..

[17]  R. Srikant,et al.  Scheduling Real-Time Traffic With Deadlines over a Wireless Channel , 2002, Wirel. Networks.

[18]  Man Young Rhee High Speed Downlink Packet Access (HSDPA) , 2009 .

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

[20]  Cyril Leung,et al.  An overview of scheduling algorithms in wireless multimedia networks , 2002, IEEE Wirel. Commun..

[21]  Peng-Yong Kong,et al.  Performance of proactive earliest due date packet scheduling in wireless networks , 2004, IEEE Transactions on Vehicular Technology.

[22]  J. Sztrik An introduction to queuing networks , 1990 .

[23]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.