Traffic models impact on OFDMA scheduling design

This article studies the impact on the design of scheduling algorithms for Orthogonal Frequency Division Multiple Access (OFDMA) systems of two traffic models described in the evaluation methodology proposals from standardization bodies: the full buffer and the finite buffer traffic models. The analysis concentrates on utility-based scheduling with an α-fair utility function for Non-Real Time (NRT) services. The results show that a gradient scheduling algorithm is able to maximize the aggregate utility over all the users when the less realistic full buffer model is adopted; but not when the finite buffer model is applied. The results also show that with the full buffer model a gradient scheduler exhibits a trade-off between average user throughput and the user throughput at 5% outage, but it does not when the more realistic finite buffer is used. Therefore, it is concluded that designs of scheduling algorithms for NRT services for OFDMA systems carried out under the full buffer model assumption may fail to provide the desired performance benefits in realistic scenarios. Based on the results presented, a recommendation on scheduling design is provided.

In the design of the mentioned wireless access systems, the evaluation methods and models play a key role. There exist publications in the literature that have already indicated that the performance results of algorithms [6] or enhancing features [7] in OFDMA systems significantly depends on the considered traffic model. In this respect, the Next Generation Mobile Networks (NGMN) Alliance and the Institute of Electrical and Electronic Engineers (IEEE) have proposed evaluation methodologies for next generation wireless access networks in [8,9], respectively. In addition, evaluation models from the 3rd Generation Partnership Project (3GPP) can be found, for example, in [10]. In these documents, two types of simplified traffic models can be identified for Non-Real Time (NRT) services: (i) Full buffer model [8][9][10]: it is a simplified version of the traffic received/transmitted by a user in a data session. It is characterized by two facts: the number of users in the cell is constant and the buffers of the users' data flows always have unlimited amount of data to transmit. The full buffer model has widely been adopted in OFDMA in simulation-based [11][12][13][14] and theoretical [15][16][17] investigations due to its simplicity.
(ii) Finite buffer model [8,10] (in [10] the so-called FTP traffic model 1): it is a simplified version of the interactive or background traffic type. It includes both a user arrival (birth) and a user departure (death) process. With this traffic model, a user is assigned a finite payload to transmit or receive when it arrives, and it leaves the system after the payload transmission or reception is completed. The user arrival process of this model captures the fact that the users in the network are not simultaneously active at the same time, but they rather become active when they start a data session that requires the download/upload of data [18][19][20][21]. This model has been less extensively adopted [22,23].
The evaluation methodology documents [8,9] have also proposed more complex models based on statistical distributions where users are assumed to execute applications (e.g. FTP, Web browsing, etc.). However, these models do not include a user arrival or departure process and have been much less extensively adopted due to their increased complexity.
Many investigations about scheduling in OFDMA systems have been carried out only under the full buffer model [14,16,17,24,25] and therefore their results and conclusions are influenced by the full queue effect. This article studies the influence of the traffic model on the performance of packet scheduling algorithms in OFDMA systems. In particular, we concentrate on utility-based scheduling [17,26] for two reasons: first, it has been reported that it provides an effective trade-off among spectral efficiency and fairness in wireless networks [14,27]; and second, proportional fairness scheduling [28], which is a particular case of utility-based scheduling [26], has widely been adopted in OFDMA systems [24,29], and it is the basis for some QoS scheduling algorithms [16,30].
The evaluation of the traffic model impact will be carried out by means of quasi-dynamic system-level simulations. For the evaluation, two OFDMA network models are considered: (i) initially, a simple OFDMA network model. This simple network model assumes an ideal achievable transmission rate per hertz through the Shannon's law, and that the base station has ideal knowledge of the user's Signal-to-Interference Ratio (SIR). (ii) Later, a realistic 3G LTE network model will be considered. It will include relevant features in an LTE system such as the Modulation and Coding Schemes (MCS), Hybrid-ARQ and the Channel Quality Information (CQI) feedback. The evaluation with these two network models will allow us to determine if the effect of the traffic models on the performance of a realistic OFDMA network model, such as 3G LTE, significantly differs from the case of a basic OFDMA network model.
The obtained results will show that under the OFDMA network model: A gradient scheduling algorithm is able to maximize the aggregate utility over all the users (for a given utility function) when the less realistic full buffer model is adopted; but not when the finite buffer model is applied.
With the full buffer model, a gradient scheduling algorithm exhibits a trade-off between average user throughput and the user throughput at 5% outage. However, when the more realistic finite buffer is used, this tradeoff does not exist.
The relative comparison of key performance indicators (KPIs), such as the average user throughput or the user throughput at 5% outage, between versions of a gradient scheduler with different fairness degrees is insensitive to the network load under the full buffer traffic model, but sensitive under the finite buffer traffic model. Moreover, with the realistic 3G LTE network model, the same trends are found as with the simple OFDMA network model.
Based on these results, it is concluded that designing scheduling algorithms for NRT services for OFDMA systems under the full buffer model assumption may not yield the desired performance benefits in realistic scenarios where the finite buffer model is more appropriate due to its birth and death process.
As a consequence of these findings, we propose a scheduling algorithm based on the gradient scheduler combined with a simple utility function. This proposal is able to achieve a similar user throughput at 5% outage compared to the Proportional Fair scheduler but an average user throughput gain that reaches up to 60-70% for heavy offered load conditions. The rest of this article is organized as follows. Section 2 describes the simple OFDMA system model and Section 3 presents the adopted scheduling algorithm based on Utility Theory. Section 4 presents the full buffer and the finite buffer traffic models as well as KPIs. Section 5 evaluates the influence of the full and finite buffer traffic models on an OFDMA network. Additionally, Section 6 includes a similar analysis in a realistic 3G LTE network. Finally, Section 7 draws the main conclusions. The base station carries out the transmission towards the M users through an N-point IFFT in which time is slotted in Transmission Time Intervals (TTI) of fixed duration T at a carrier frequency f c . A total bandwidth B is available for transmission composed of N u useful subcarriers with a subcarrier spacing S s . The transmission considers a Single Input Multiple Output configuration with two receiving antennas. Assuming perfect sample and synchronization and sufficient cyclic prefix length, the discrete-time baseband signal received by user k on subcarrier s, TTI n, and antenna i can be expressed as:

Simple OFDMA system model
where a i k [n, l] being the lth time domain channel tap experienced by the user k at antenna i. The channel taps include the small scale fading, shadow fading and path loss, and are assumed to be stationary narrowband, complex Gaussian processes, which are independent for different paths, users and antennas at the receiver. The time-domain channel taps are assumed to be constant for the duration of the TTI, but are updated every TTI with a maximum Doppler frequency f d . p[n, s] is the base station transmission power on subcarrier s, and it is assumed to be constant across subcarriers, i.e. p[n, s] = p [n] ∀s. The transmitted data symbols x k [n, s] are independent random variables with zero mean and power E{|x k [n, s]| 2 } = 1. The signal is corrupted with zero-mean AWGN noise samples n i k [n, s] with variance: where N 0 represents the one-sided power spectral density of the noise. A hexagonal grid with J surrounding cells is considered for the generation of time continuous interference. For simplicity purposes, the interference samples z i k [n, s] are modeled as zero-mean AWGN samples whose variance: is computed as the sum of the interference power I j, k [n, s] received by user k from every jth interfering cell based on the deterministic path loss, shadow fading and interfering base station transmission power.
The resulting Signal-to-Noise plus Interference Ratio SINR i k [n, s] of every user k in every subcarrier s and antenna i can be computed as: Assuming ideal Maximal Ratio Combining (MRC) at the receiver, the SIR at the detector of every user k in every subcarrier s can be computed as: The achievable transmission rate R k [n,s] of user k in subcarrier s and TTI n is computed with the Shannon law, but including an efficiency factor due to the Cyclic Prefix (CP) of the OFDM signal: where R k [n,s] denotes the achievable transmission rate, W represents the subcarrier bandwidth and r is the CP efficiency factor. The base station is assumed to have instantaneous and perfect knowledge of the achievable transmission rate R k [n,s] of all the users on every subcarrier and at every TTI. The scheduling algorithm uses this information to assign bandwidth resources to the users. The granularity of the bandwidth assignment equals 1 subcarrier: There is no user multiplexing per subcarrier, and hence at maximum one user is assigned on each subcarrier. In equation Whenever a user k is assigned subcarrier s, he is assumed to correctly receive the following amount of data: where T is the TTI duration. At the Medium Access Control layer of the base station, the queue q k [n] corresponding to the flow of the user k is decremented according to the transmitted bits:

Packet scheduling based on utility theory
Scheduling algorithms based on Utility Theory have widely been applied in OFDMA networks due to their promising performance and implementation simplicity. These algorithms incorporate the level of customer satisfaction in the resource allocation through the use of utility functions that may be obtained from surveys of the users' subjective experienced quality (like the one in [31]), or may be designed based on the traffic habits or desired fairness in the network [32]. The Utility Theory proposes the optimization objective of maximizing the aggregate utility over all users in a cell for a given utility function U(·) [26]. For NRT traffic, the considered optimization objective is the maximization of the aggregate utility with respect to the user throughput r k : where U(·) is a utility function that quantifies the degree to which a network satisfies the user demands of NRT applications [32] based on the user throughput r k .
Song and Li [17] developed a cross-layer radio resource assignment framework for NRT traffic in OFDMA networks that aims at solving objective (11). In their framework, they studied dynamic subcarrier assignment and adaptive power allocation schemes. Concentrating on the dynamic subcarrier assignment, Song and Li [17] demonstrated that, assuming a constant power allocation per subcarrier, the maximization of the aggregate utility, i.e. objective (11), can be achieved by a gradient scheduler algorithm that assigns subcarrier s in TTI n to the user m that fulfills: where In (12), the user throughput has been approximated by the average data rate during a certain period r k [n], which is calculated using an exponentially weighted low-pass time window: where r w = T/T w , T w is the length of the averaging window, and r k [n] is the actual transmitted data rate for user k at time n across its assigned subcarriers.
Let us consider the a-fair function as the utility function to be used in (11). The a-fair function is a family of functions defined in [33] as: where U a (·) is the α-fair function.
As described in [14,27,34,35], the application of the αfair function as a utility function in the objective (11) leads to a resource allocation where the parameter a controls the degree of fairness of the allocation. When a = 0, the network throughput is maximized at the expenses of the throughput starvation of some users, when a = 1, the throughput allocation is proportionally fair, and when a ∞ the allocation corresponds to max-min fairness.
Then, assuming that the a-fair function is selected as utility function, the gradient scheduling algorithm that maximizes the aggregate utility over all users should compute the priority of user k in subcarrier s and TTI n as: for a ≥ 0. This scheduling discipline will be hereafter referred to as a-fair gradient scheduler.
It is relevant to mention that the optimal solution of objective (11) changes over time because both the channel capacity and the set of active users M vary with time [36]. In fact, the scheduling decisions determine the user departure process, which ultimately influences the set of active users M. Therefore, it is questionable if the optimal solution to the objective (11) over a long observation period is to continuously target at the "present" optimal solution by moving in the direction of the gradient as in (12).

Full buffer traffic model
The so-called full buffer traffic model is widely used in the performance evaluation of wireless networks [11][12][13]. It is characterized by the fact that the buffers of the users' data flows always have unlimited amount of data to transmit [9] and, therefore, transmission of their data payloads never finishes. This implies that q k [n] = ∞ ∀k and ∀n in Equation (10). In addition, there is no user arrival process in the full buffer model and, therefore, the number of users does not vary.
In simulation-based evaluations, typically, during a simulation run the locations of the users are kept invariable and therefore multiple independent runs (snapshots) are required with the objective of sampling the geographical distribution of the users in the footprint area. At the end of the process, the statistics are collected from all the simulated snapshots. In this study, it will be assumed that the number of users in the cell for each snapshot follows a Poisson distribution.
In theoretical investigations, this model allows a simplified analysis.

Finite buffer traffic model
The so-called finite buffer traffic model is characterized by the fact that the users have a finite amount of data to transmit or receive. Once the data transmission is finished, the session is also finished and the user is removed from the system. For simplicity purposes, the session is typically composed of a single data payload of a given size [36], and for the same reason, the effects of higher layer protocols such as TCP, HTTP, are not considered. The model includes a process of user arrivals of a given rate λ that provides the instants when the users arrive in the system and start their data transmission or reception. This process models the fact that all users in the OFDMA network are not simultaneously active, but they rather become active when they demand the download/upload of data [18][19][20][21]. This study models the user arrivals with a Poisson process (i.e. exponentially distributed inter-arrival times). Note that the sum of a large number of independent stationary renewal processes tends to a Poisson process [37].
With the finite buffer traffic model, a user stays in the system from the instant of the arrival until the data transmission is finished. This period depends on the throughput achieved by the user, and therefore the instantaneous number of users in the system depends on how the data rates are assigned by the base station. With this model, as the number of users in the cell instantaneously varies with the time, there exist temporary periods when the number of users reach crests caused by peaks of user arrivals or accumulation of very poor channel quality users.
In simulation-based evaluations, with the finite buffer traffic model typically a single simulation run is executed [38], but it should be long enough to collect sufficient statistics for accurate sampling of relevant performance metrics. Sampling the load peaks requires a large amount of statistics and therefore increases the complexity compared to the full buffer model.
We consider that the results obtained under the finite buffer model are more generalizable than those obtained with the full buffer because the latter disregards the fact that in a realistic OFDMA network all users do not simultaneously request the download/upload of an infinite amount of data.

Overview of KPIs
The selection of the KPIs is a decisive issue because the final scheduling design will depend on them. This study makes use of KPIs proposed in [8][9][10] that are widely applied in performance evaluations of OFDMA systems because they provide information about the average spectral efficiency and throughput outage levels. For convenience, the KPIs will be defined as relative gains over the Proportional Fair case: User throughput r k . Let denote n k, a and n k, d the arrival and departure TTIs of user k in the OFDMA system. The user throughput r k is computed as the ratio of the number of data bits successfully received by user k divided by the elapsed time between arrival and departure: Average user throughput gain over Proportional Fair G Ω . Let K = {1,..., K} represent both the cardinality and the set of all users that arrive in the system over the observation period. Let compute the average user throughput provided by the scheduling algorithm in (16) with parameter a over the set of users K as α = 1 K K k=1 r k . Then, we define the average user throughput gain of over Proportional Fair as: User throughput at 5% outage gain over Proportional Fair G O . Let denote O a the fifth percentile of the Cumulative Distribution Function (CDF) of the user throughput provided by the scheduling algorithm in (16) with parameter a. O a corresponds to the 5% worst user throughput. Then, we define the user throughput at 5% outage gain over Proportional Fair as In addition, a utility metric, that assesses the degree of user satisfaction, will be considered for the evaluation: Average utility gain over Proportional Fair G U : Let u k denote the utility of user k with a throughput r k , u k = U (r k ) for a given utility function U(·). Let compute the average utility provided by the scheduling algorithm in (16) with parameter a over the set of users K as U α = 1 K K k=1 u k . Then, we define the average utility gain over Proportional Fair as:

Experimental set-up
The OFDMA system model presented in Section 2 has precisely been reproduced in a quasi-dynamic network simulator. Users are uniformly distributed in area, they do not to vary their geographical location with time, and therefore, their deterministic path loss and shadow fading remains invariable during the lifetime of the user. The small scale fading of the channel taps is modeled according to the ITU Typical Urban (TU) power delay profile [39] assuming a sampling frequency f s = 15.36 MHz.
For the full buffer model, a total of 1,000 snapshots are executed to have an accurate sampling of the geographical distribution of the users in the cell as well as the distribution of the number of users (i.e., Poisson distribution). Different average cell loads are achieved by varying the average of the Poisson distribution. Every snapshot is set to last 10 s, which is found to be sufficient for the relevant statistics to converge.
For the finite buffer model, in order to be able to analyze the levels of average offered load close to the maximum cell capacity, 30 independent runs (with different seeds) are executed, with 1500 s of duration for each run. As in [29], here it is also assumed that the size of the user's payload is equal to 2 Mbits. The remaining parameters are included in Table 1.

Performance results assuming a fixed network load
This section presents the performance of the a-fair gradient scheduling algorithm under the finite and full buffer traffic models for different a values (see (16)) assuming a fixed offered load. For the comparison, the Poisson distribution of the full buffer traffic model is set to have an average number of users in the cell equal to 15. For the finite buffer, the input of the model is the average user arrival rate which decides the offered cell load of the Poisson arrival process. Here, the offered cell load is selected to be equal to 23 Mbps because it yields a load level in the system (in terms of average number of users) in the same order of magnitude as the one used in the case of the full buffer model. This criterion will also be used in the following sections to decide the offered cell load for the finite buffer model. Figure 1 depicts the CDF of the user throughput for two selected a values, a = 1 and a = 0.6, under the full and finite buffer traffic models. Under the full buffer model, the CDFs of the user throughput for both a values cross at approximately the 60th percentile of the CDF. This trend is expected because by decreasing the value of a from 1 to 0.6, the scheduling algorithm becomes more unfair, favoring users under good channel conditions at the expenses of the remaining users. However, under the finite buffer model, the CDFs of the user throughput for both a values cross at approximately 10th percentile and the tails of both CDFs approximate to each other. The main reason behind this difference in the trend is that, under the finite buffer traffic model, increasing the priority of users under good channel conditions does not always degrade the throughput of users with poor channel conditions because the former ones finish their data transmissions and departure from the system thereby releasing the bandwidth resources. Figure 2a depicts the average user throughput gain over Proportional Fair G Ω . The results show that for a < 1, the finite buffer traffic model presents a much higher average user throughput gain than the full buffer model. Figure 2b depicts the user throughput at 5% outage gain over Proportional Fair G O . For the full buffer traffic model, the user throughput at 5% outage increases for higher values of a, thereby, as expected, improving the degree of fairness provided by the a-fair gradient scheduling algorithm (as already shown in [14]). On the other hand, when the finite buffer model is used, the user throughput at 5% outage exhibits a maximum at a ≈ [0.75-1], and a values outside this range cause a performance loss. The reason is that, with the finite buffer model, giving more resources to users under favorable channel quality conditions (α < 1) reduces their alive time, and therefore users with poor channel quality can get sufficient resources after the departure of the favorable ones, whereas, in the case of full buffer model, users are always competing for resources.
Then, the results show that under the full buffer traffic model there exists a trade-off between the average user throughput and the user throughput at 5% outage, but under the finite buffer model this trade-off does not exist because the user throughput at 5% outage presents an optimum performance in the range a ≈ [0.75-1]. Figure 3a depicts the average utility gain over Proportional Fair G U for different a values assuming that the utility function is the natural logarithm: where r k denotes the throughput of user k. As expected, under the full buffer model the gradient scheduling algorithm with a = 1 maximizes the average utility when the utility function is (21). As the average utility is maximized, the aggregate utility k∈M U(r k ) is also maximized. However, when the finite buffer traffic model is used, the maximization of the average utility does not hold for a = 1, but it is rather increased as a 0. Figure 3b depicts the average utility when the utility function is the α-fair function with a = 0.5 (see (22)) reaching a similar conclusion.
Consequently, the results show that the a-fair gradient scheduling algorithm maximizes the average utility as long as the full buffer traffic model is used. But, when the finite buffer traffic model is used, the gradient scheduling algorithm does not keep this property.

Performance results under different network load conditions
This section analyzes the sensitivity of the performance of the a-fair gradient scheduler to the network load under the finite and full buffer traffic models. For this purpose, two versions of the a-fair gradient scheduling algorithm will be evaluated under various cell loads: the first is α = 1, which corresponds to the well-known Proportional Fair scheduling; the second is α = 0.6, which provides interesting results from the viewpoint of the combined performance of the average and 5% outage user throughput. Both scheduling algorithms are evaluated under the full buffer traffic model with the following average number of users in the cell N = [8,11,14,17,20]. For the finite buffer model, the following loads are considered L = [20,21,22,23,24,25], where L represents the offered cell load measured in Mbps. Figure 4 represents the evolution of the average user throughput gain over Proportional Fair G Ω and user throughput at 5% outage gain over Proportional Fair G O for both traffic models as a function of the cell load. It is interesting to observe that G Ω and G O achieved with the a-fair gradient scheduling algorithm with α = 0.6 remains approximately insensitive to the load under the full buffer traffic model. But, this behavior does not hold for the finite buffer traffic model. For example, with offered cell loads of 20 and 25 Mbps, the relative gains of the average user throughput equal 1.49 and 1.81, respectively. With the same offered loads, the relative gains of the 5% outage throughput equal 0.94 and 1.0, respectively. Hence, the results show that the relative comparison of KPIs, such as the average user throughput or the user throughput at 5% outage, between two different a values of the a-fair gradient scheduling algorithm, is insensitive to the network load under the full buffer traffic model. However, the same relative comparison is indeed load sensitive under the finite buffer traffic model.

Performance evaluation under a realistic OFDMA network model: 3G LTE
The previous section has shown that the a-fair gradient scheduling algorithm behaves significantly different with full or finite buffer model under a simple OFDMA system model. This section aims at providing the evaluation with realistic system-level assumptions. For this purpose, the downlink of an LTE system is taken as a study case. The performance is also investigated here with various load conditions. The OFDMA simulator described in Section 5.1 has been modified to follow the 3G LTE specifications defined in [1]. The propagation, user location and mobility, and traffic models are kept as in the OFDMA network model. The transmission bandwidth and the base station power are also maintained. However, the link to system mapping is based on the exponential effective SIR mapping model [40], and a finite set of MCS is used instead of Shannon's law. A HARQ protocol with 6-Stop and Wait (SAW) channels is included to retransmit the erroneously decoded radio blocks. The scheduler assigns resource units of 180 kHz and 1 ms. An Outer Loop Link Adaptation algorithm is also included to adjust the Block Erasure Rate (BLER) to a target value. The modeling of the channel quality indicator and its feedback (CQI) is extracted from [41]. The number of runs and the duration of each run are also maintained as in Section 5. Other 3G LTE specific parameters and assumptions are summarized in Table 2.

Performance results assuming a fixed network load
As in previous section, we choose again a = 0.6 for the study with realistic assumptions and Proportional Fair (α = 1) as reference. For the full buffer model, the average number of users is set N = 20, which is selected to be higher than in Section 5.1 (N = 15) due to the better performance of α = 0.6 and α = 1. For finite buffer, the offered load L = 11 Mbps is used. Figure 5 shows the CDF curves of the user throughput for full and finite buffer models with the two schedulers. From the figure, it is seen that, with full buffer model, α = 0.6 prioritizes the users with good channel quality. As a consequence, 5% outage user throughput is significantly penalized. Meanwhile, in the case with the finite buffer model, α = 0.6 maintains approximately the same outage throughput and provides a gain in average user throughput. This behavior is similar to the one obtained in Section 5 with the simple OFDMA network model.

Performance results under different network load conditions
The performance with different cell loads is also evaluated under the 3G LTE network model. For the full buffer model, we vary the average number of users in the cell N = [8,11,14,17,20]; for the finite buffer model, the following offered cell loads are evaluated L = [8, 9, 10, 10.5, 11, 11.5] where L represents the offered cell load measured in Mbps.
The average user throughput gain over Proportional Fair G Ω and user throughput at 5% outage gain over Proportional Fair G O are presented for both traffic models in Figure 6. From the figure, it can be seen that the performance with full buffer is again approximately insensitive to the load level. When the finite buffer model is used, the relative performance of α = 0.6 improves with the cell load: for offered load below 10.5 Mbps there is small reduction of the outage but for loads above 10.5 Mbps α = 0.6 gains in outage user throughput; and regarding the average user throughput α = 0.6 provides a gain that reaches up to 60-70% for heavy offered load conditions . This trend is again in agreement with the results presented in Section 5 for the simple OFDMA network model.

Conclusion
This article has studied the impact of the traffic model on the design of the OFDMA scheduling algorithms. Two simple traffic models proposed by the NGMN Alliance, the IEEE, and the 3GPP have been considered: the full buffer and the finite buffer models. With the first model, the number of users in the cell is constant and the buffers of the users' data flows always have unlimited amount of data to transmit. The second model includes a user birth process and every user is assigned a finite payload to transmit or receive. In particular, this article has evaluated if the properties and trends of utility-based scheduling under the full buffer model also hold when the finite buffer is applied. Initially, a simple OFDMA network model has been used for the evaluation. The results have shown that the optimization objective of maximizing the aggregate utility through a gradient scheduling algorithm can only be achieved when the less realistic full buffer model is used. When the finite buffer model is applied, the gradient scheduling algorithm does not keep this property. In addition, under the full buffer model, the gradient scheduler exhibits a trade-off between average user throughput and the user throughput at 5% outage. However, under the more realistic finite buffer traffic model, the user throughput at 5% outage presents an optimum performance at around a = [0.6-1.0], and hence the gradient scheduler does not exhibit the mentioned trade-off. Moreover, the relative comparison of KPIs, such as the average user throughput or the user throughput at 5% outage, between versions of the a-fair gradient scheduling algorithm (with different fairness levels) is insensitive to the network load under the full buffer traffic model, but sensitive under the finite buffer traffic model. Furthermore, a realistic 3G LTE network model has also been used for the evaluation, where same trends are found as with the simple OFDMA network model.
Based on the presented findings, we propose as scheduling algorithm the gradient scheduler combined with    the a-fair utility function and a = 0.6 because it produces a similar user throughput at 5% outage, an average user throughput gain that reaches up to 60-70% for heavy offered load conditions, and an increased aggregate utility (assuming that the utility function is the Natural Logarithm) compared to the Proportional Fair algorithm. This performance gain could be considered in the implementation of QoS scheduling algorithms, which may benefit from incorporating this simple tuning. These findings may also be an interesting trigger to additional investigations that further analyze if the presented trends also hold in other channel-unaware schedulers (e.g., Round Robin-based schedulers) in OFDMA systems.