Dynamic bandwidth allocation algorithms for high-speed data wireless networks

D.M. Andrews, S.C. Borst, F. Dominique, P.R. Jelenkovic, K. Kumaran, K.G. Ramakrishnan, P.A. Whiting

Research output: Contribution to journalArticleAcademicpeer-review

14 Citations (Scopus)


Next-generation wireless networks are expected to support a wide range of high-speed data services, with Web browsing as one of the major applications. Although high data rates have been shown feasible in a single-user setting, the resource allocation issues that arise in a multiple-user context remain extremely challenging. Compared with voice, data traffic is typically more bursty, while the users are less sensitive to delay. These characteristics require resource allocation strategies to operate in a fundamentally different manner if the spectrum is to be used efficiently. In this paper we propose several algorithms for scheduling the efficient transmission of data to multiple users. As a new feature, the various schemes exploit knowledge of the buffer contents to achieve high throughput, while maintaining fairness by providing quality of service (QoS) to individual users. The proposed algorithms are backward compatible with existing cellular and personal communications services (PCS) standards such as IS-136. They provide a powerful approach to improving spectrum efficiency in forthcoming high-speed data cellular services. The extensive simulation experiments we present in this paper demonstrate that the algorithms significantly outperform conventional schemes.
Original languageEnglish
Pages (from-to)30-49
Number of pages20
JournalBell Labs Technical Journal
Issue number3
Publication statusPublished - 1998


Dive into the research topics of 'Dynamic bandwidth allocation algorithms for high-speed data wireless networks'. Together they form a unique fingerprint.

Cite this