Parallel scheduling problems in next generation wireless networks

✍ Scribed by L. Becchetti; S. Leonardi; A. Marchetti-Spaccamela; A. Vitaletti; S. Diggavi; S. Muthukrishnan; T. Nandagopal

• Publisher: John Wiley and Sons
• Year: 2005
• Tongue: English
• Weight: 182 KB
• Volume: 45
• Category: Article
• ISSN: 0028-3045
• DOI: 10.1002/net.20045

✦ Synopsis

Abstract

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 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. 45(1), 9–22 2005