Parallel scheduling problems in next generation wireless networks

Next generation 3G/4G wireless data networks allow multiple codes (or channels) 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 (rate) and codes for 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. This 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 stream of user requests. We present provable results on the algorithmic complexity of these scheduling problems. In particular, we are able to provide very simple, online algorithms for approximating the optimal maximum response time. This relies on resource augmented competitive analysis. We also perform an experimental study with realistic data of channel conditions and user requests to show that our algorithms are more accurate than our worst case analysis shows, and they provide fine-grained QoS to users effectively.

[1]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance [scheduling problems] , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

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

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

[5]  NandagopalThyagarajan,et al.  A unified architecture for the design and evaluation of wireless fair queueing algorithms , 2002 .

[6]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

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

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

[9]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

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

[11]  John M. Cioffi,et al.  Understanding Digital Subscriber Line Technology , 1999 .

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

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

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

[15]  RENAUD LEPÈRE,et al.  Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints , 2001, Int. J. Found. Comput. Sci..

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

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

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

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

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

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

[22]  Philip S. Yu,et al.  Approximate algorithms scheduling parallelizable tasks , 1992, SPAA '92.

[23]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

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

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

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

[27]  S. Muthukrishnan,et al.  Scheduling on-demand broadcasts: new metrics and algorithms , 1998, MobiCom '98.

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