Earliest-Deadline Scheduling Using Discrete Service Bit Rates for CDMA Data Networks

Ashraf S. H. Mahmoud, Mohammad Abdur Razzaque

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Radio resource management is one of the critical functions for mobile wireless networks. The optimal utilization of network resources and the capacity to fulfill quality of service requirements are key requirements for 3G networks operations. Several burst admission and scheduling algorithms were proposed in the literature but most focus on the use of continuous service bit rates. In this study, we modify two widely cited algorithms to utilize discrete service bit rates. The proposed algorithms, DEDF and DPEDF are compared against the original continuous bit rate counterparts in terms of network throughput, power utilization, and packet discard rate for typical 3G network deployment parameters. Results indicate the use of discrete service rate reduces maximum network throughput and lowers the power utilization. Finally, the study also evaluates the effect of various packet delay thresholds on the overall performance of the network.
Original languageEnglish
Title of host publicationInternational Symposium on Wireless Communications (ISWSN'05) 2005
Number of pages5
Publication statusPublished - 2005

Fingerprint Dive into the research topics of 'Earliest-Deadline Scheduling Using Discrete Service Bit Rates for CDMA Data Networks'. Together they form a unique fingerprint.

Cite this