Parallel scheduling problems in next generation wireless networks

Next-generation 3Gs4G wireless data networks allow multiple codes lor channelsr to be allocated to a single user, where each code can support multiple data rates. Providing fine-grained QoS to users in such networks poses the two-dimensional challenge of assigning both power lrater and codes to every user. This gives rise to a new class of parallel scheduling problems. We abstract general downlink scheduling problems suitable for proposed next-generation wireless data systems. Our contribution includes a communication-theoretic model for multirate wireless channels. In addition, while conventional focus has been on throughput maximization, we attempt to optimize the maximum response time of jobs, which is more suitable for streams of user requests. We present provable results on the algorithmic complexity of these scheduling problems. In particular, we are able to provide very simple, on-line algorithms for approximating the optimal maximum response time. We also perform an experimental study with realistic data of channel conditions and user requests that strengthens our theoretical results. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45l1r, 9–22 2005

[1]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[2]  Sarvar Patel,et al.  Downlink scheduling in CDMA data networks , 2000, MobiCom '00.

[3]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[4]  John M. Cioffi,et al.  MMSE decision-feedback equalizers and coding. I. Equalization results , 1995, IEEE Trans. Commun..

[5]  Hadas Shachnai,et al.  Multiresource Malleable Task Scheduling to Minimize Response Time , 1999, Inf. Process. Lett..

[6]  N. Bambos,et al.  Toward power-sensitive network architectures in wireless communications: concepts, issues, and design aspects , 1998, IEEE Wirel. Commun..

[7]  Sanjiv Nanda,et al.  Adaptation techniques in wireless packet data services , 2000 .

[8]  Philip S. Yu,et al.  Scheduling parallelizable tasks to minimize average response time , 1994, SPAA '94.

[9]  Jack M. Holtzman,et al.  A scheme for throughput maximization in a dual-class CDMA system , 1998, IEEE J. Sel. Areas Commun..

[10]  Gerhard J. Woeginger,et al.  Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints , 2001, ESA.

[11]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[12]  Prasoon Tiwari,et al.  Scheduling malleable and nonmalleable parallel tasks , 1994, SODA '94.

[13]  Klaus Jansen,et al.  Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks , 1999, SODA '99.

[14]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

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

[18]  S. Muthukrishnan,et al.  Resource scheduling for parallel database and scientific applications , 1996, SPAA '96.

[19]  Robert W. Brodersen,et al.  Integrating power control, error correction coding, and scheduling for a CDMA downlink system , 1999, IEEE J. Sel. Areas Commun..

[20]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

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