Scheduling

Mechanism
(Round Robin &
Weighted Fair
Queuing)
BY

S WA P N A D E E P K , 2 B U 2 0 C S 0 9 8

2BU20CS90

2BU20CS92

2BU20CS94

SUNIL B, 2BU20CS96
 Scheduling Mechanism in
Networking
A network scheduler  also called packet
scheduler, queueing discipline (qdisc)
or queueing algorithm, is an arbitrator in packet
switching communication network. It manages the
sequence of network packets in the transmit and
receive queues of the protocol stack and network
interface controller.

The network scheduler logic decides which

network packet to forward next. The network
scheduler is associated with a queuing system,
storing the network packets temporarily until they
are transmitted.
 Why Network Scheduling is
important?
A network scheduler may have responsibility in implementation of specific
network traffic control initiatives. Network traffic control is an umbrella
term for all measures aimed at reducing network congestion, latency and
packet loss. Specifically, Active Queue Management (AQM) is the
selective dropping of queued network packets to achieve the larger goal
of preventing excessive network congestion. The scheduler must choose
which packets to drop. The scheduler decides the timing for the
transmitted packets. Quality of Service (QoS) is the prioritization of traffic
based on service class (Differentiated Classes) or reserved connection
(Integrated Services).
List Of Scheduling Algorithms
 Round Robin Queuing
Under the round robin queuing discipline, packets are
sorted into classes as with priority queuing. However,
rather than there being a strict priority of service among
classes, a round robin scheduler alternates service
among the classes. In the simplest form of round robin
scheduling, a class 1 packet is transmitted, followed by
a class 2 packet, followed by a class 1 packet, followed
by a class 2 packet, and so on. A work-conserving round
robin discipline that looks for a packet of a given class
but finds none will immediately check the next class in
the round robin sequence.
 Real Mechanism
Involved in Round
Robin Network
Scheduling
Average Waiting Time in Round Robin
 Weighted Fair Queueing
Weighted fair queueing (WFQ) is a network scheduling algorithm.
WFQ is both a packet-based implementation of the generalized
processor sharing (GPS) policy, and a natural extension of fair
queuing (FQ). Whereas FQ shares the link's capacity in equal
subparts, WFQ allows schedulers to specify, for each flow, which
fraction of the capacity will be given.
Weighted fair queuing is also known as packet-by-packet GPS
(PGPS or P-GPS) since it approximates generalized processor
sharing "to within one packet transmission time, regardless of the
arrival patterns."
Continued….
•Weighted Fair Queueing (WFQ) makes data/packet selection based
on priority on a scheduling queue.
•It prioritizes packet size rather than number of packets for network
scheduling.
•It’s allocation is also on amount of packet’s data size rather than
number of packets available in the network.
 Here arriving packets are
classified and queued in the
appropriate per-class waiting area.
As in round robin scheduling, a
WFQ scheduler will serve classes
in a circular manner—first serving
class 1, then serving class 2, then
serving class 3, and then
(assuming there are three classes)
repeating the service pattern.
 WFQ is also a work-conserving
queuing discipline and thus will
immediately move on to the next
class in the service sequence when
it finds an empty class queue.
Pseudocode for WFQ
Thank You
Everyone
LINKS:
• NETWORK SCHEDULER – WIKIPEDIA
• WEIGHTED FAIR QUEUEING – WIKIPEDIA
• CLASS-BASED WEIGHTED FAIR QUEUE [9]   | DOWNLOAD
SCIENTIFIC DIAGRAM (RESEARCHGATE.NET)
• ROUND-ROBIN SCHEDULING - WIKIPEDIA