Parallel scheduling problems in next generation wireless networks

L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, A. Vitaletti, S. Diggavi, S. Muthukrishnan, T. Nandagopal

    Research output: Contribution to journalArticle

    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.

    Original languageEnglish (US)
    Pages (from-to)9-22
    Number of pages14
    JournalNetworks
    Volume45
    Issue number1
    DOIs
    StatePublished - Jan 1 2005

      Fingerprint

    Keywords

    • CDMA
    • Convex programming
    • On-line algorithms
    • Resource augmentation
    • Scheduling
    • Wireless networks

    ASJC Scopus subject areas

    • Software
    • Information Systems
    • Hardware and Architecture
    • Computer Networks and Communications

    Cite this

    Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Vitaletti, A., Diggavi, S., Muthukrishnan, S., & Nandagopal, T. (2005). Parallel scheduling problems in next generation wireless networks. Networks, 45(1), 9-22. https://doi.org/10.1002/net.20045