Weighted Fair Queuing

• “Packet-by-packet generalized processor-sharing algorithm”

– A rate allocating service discipline; provides each flow with at least its
proportional fair share of link capacity; isolates timing between flows

• Definitions:
– A packet switch has several inputs, feeding to an output link shared by n
established flows

• Each flow, i, is allocated a fraction ũi of the link
• Total bandwidth allocated to all n connections is U = Σui where U≤ 1

• Assume an acceptance test rejects connections that would cause requested
bandwidth to exceed available bandwidth

– Define the “finish number”, fni, to represent job completion times
• Used in definition of scheduling algorithm


Feel free to contact the admin for any suggestions and help.