Beruflich Dokumente
Kultur Dokumente
=
=
|
|
.
|
\
|
=
n
i
i
n
i
i
n
x n
x
x x x f
Suppose a congestion-control
scheme results a collection of
competing flows that achieve the
following throughput rates: 120
KBps, 480000 bps, 130 KBps,
90000 Bps, and 150000 Bps.
Calculate the fairness index for
this scheme!
1. FIFO or FCFS
First packet that arrives at a router is the first
packet to be transmitted
Combined with tail drop policy
Free buffers
Queued packets
Arriving packet
Next free
buffer
Next to
transmit
FIFO Queuing
Arriving packet
Next to
transmit
Drop
Tail drop at a FIFO Queue
Priority queuing :
a variation of basic FIFO queuing
Idea :
mark each packet with a priority, usually in
ToS (Type of Service)
Routers implement multiple FIFO queues,
one for each priority class
The network charge more to deliver high-
priority packets than low-priority packets
economic reason
Solve main problem in FIFO queuing :
discriminate different traffic sources
Idea :
maintain separate queue for each flow currently being
handled by the router and services these queues in a
round-robin manner
Flow 2
Flow 3
Flow 1
Flow 4
Round Robin
service
If F
i
denotes time when router finishes
transmitting packets i (called timestamps)
then the next packet to transmit is always
one with the lowest timestamp
2 important things about FQ:
Link is never left idle as long as there is at least
one packet in queue, known as work-conserving
If link is fully loaded & there are n flows sending
data, we cant use more than 1/n
th
of the link
bandwidth
Example of fair queuing in action :
Output
(a)
F = 8
F = 5
Flow 1
F = 10
Flow 2
Output
(b)
F = 10
F = 2
Flow 1
(arriving)
Flow 2
(transmitting)
A variation of FQ, is Weighted Fair Queuing
(WFQ)
Idea:
allows a weight to be assigned to each flow
The weight logically specifies how many
bits to transmit, effectively controls the
percentage of links bandwidth of the flow
1. Peterson, Larry. Computer Network: A
System Approach. 3
rd
edition. Morgan
Kauffman.