Fairness Consideration of Scheduling for Real-Time Services in 4G Systems

Woei-Hwa Tarn, Jenhui Chen and Chun-Liang Lee

Mathematical Problems in Engineering, 2015, vol. 2015, 1-9

Abstract:

In order to achieve higher resource utilization, the call admission control (CAC) will allow the number of connections into the system more than the system capacity can offer. However, the fairness problem will occur when these connections are real-time services. To solve this problem, in this paper, we propose a fair scheduling algorithm named contribution-based scheduling algorithm (CSA) for real-time polling service (rtPS) or guarantee bit rate (GBR) in the uplink direction in the forth-generation (4G) systems. In CSA, a mobile subscriber (MS) gains its contribution credit value at the end of each transmission time interval (TTI), which is based on the contribution of MS to the radio resource scheduling. The base station (BS) schedules the bandwidth according to the credit value. Simulation results show that CSA achieves higher fairness in bandwidth allocation while connection drop rate and queuing delay are also guaranteed as compared to the roundrobin (RR) and early deadline first (EDF) mechanisms.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/597173.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/597173.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:597173

DOI: 10.1155/2015/597173

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().