Scribd
Upload
26 views2 pages

Round Robin.11369

Uploaded by

Apeksha Warude
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views2 pages

Round Robin.11369

Uploaded by

Apeksha Warude
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

International Journal of Wireless & Mobile Networks (IJWMN), Vol.14, No.

2, April 2022

Figure 6. Channel-dependent scheduling [5]

2.2. Round Robin (RR) & Proportional Fair (PF)

The RR packet scheduling algorithm lets users take turns in using the shared resources, but it
doesn’t take into account the instantaneous channel conditions, which might lead to poor
utilization of the system's capacity [5].

The PF packet scheduling algorithm schedule users’ traffic in a fair way, it does this by taking
into account both the experienced channel state and the past data rate when assigning radio
resources to users. It aims to obtain satisfying throughput and at the same time, guarantee fairness
among traffic flows. The selection is based on the following formula [18]:

k = arg max ( ri (t) / Ri (t) )

where ri (t) is the achievable data rate according to the instantaneous channel quality of user i at t-
th TTI, and Ri (t) is the average data rate of user i over a time window, and it is calculated
according to the following formula [18]:

Ri (t) = (1 – β) * Ri (t-1) + β * ri (t-1)

where β is a variable ranging from 0 to 1.

A drawback of the PF scheduling algorithm is that it is only suitable to be used with non-real time
traffic, and this is because it does not take into account the Quality of Service (QoS) requirements
of each traffic type [18].

6
International Journal of Wireless & Mobile Networks (IJWMN), Vol.14, No.2, April 2022

Figure 7. A comparison between the Max C/I, RR, and the PF scheduling algorithms, in a scenario of
scheduling two users, the selected user is marked with black [5]

2.3. Earliest Deadline First (EDF)

The EDF packet scheduling algorithm is a delay restrictive algorithm. It schedules the users’
traffic packets with the closest deadline expiration. A user with the closest Head of the Line
(HOL) packet to the headline is chosen according to the following formula [4]:

k = arg max ( 1 / ( τi - DHOL,i ) )

where k denotes the selected user with the largest metric, τi is the packet delay threshold of user i,
and DHOL,i is the HOL packet delay of user i at t-th TTI.

A drawback of the EDF scheduling algorithm is that it doesn’t take into account the channel
quality variation of wireless environments “channel-unaware”, therefor it is unsuitable for use in
cellular networks [4].

2.4. Modified EDF-PF (M-EDF-PF)

The M-EDF-PF packet scheduling algorithm combines the delay restrictive characteristics of
EDF scheduling algorithm and the channel aware characteristics of the PF scheduling algorithm
to ensure a good balance between throughput, fairness, and QoS provisioning. It selects a user
based on the following formula [4]:

k = arg max gi ( DHOL,i ) * ( 1 / ( τi - DHOL,i ) ) * ( ri (t) / Ri (t) )

where gi (t) is an increasing concave function and its curve slope varies with the change of
the tunable parameters ai, bi, and ci and it is calculated based on the following formula:
gi (t) = ( ai * t ) / ( log(1+ (bi / t )) + ci )

2.5. Modified-Largest Weighted Delay First (M-LWDF)

The M-LWDF packet scheduling algorithm is designed to support multiple real time data users in
Code Division Multiple Access – High Data Rate (CDMA-HDR) systems, it also takes into
account their different QoS requirements. For example, in the case of video services, the
instantaneous channel variations and delays are taken into account. It tries to balance the
7

You might also like