Weighted Fair Queue project report



This uCode package applies to the FCC’s Ethernet Protocol. It manages transmit
queues by implementing the well-known Weighted Fair Queue (WFQ), supporting up
to eight transmit queues. When the FCC is ready to transmit a new frame, the uCode
uses the WFQ algorithm to choose a queue from which to pull a frame.
WFQ is a flow-based queuing algorithm that schedules low-volume traffic first. Highvolume traffic shares the remaining bandwidth. Each flow is assigned a weight, where
lower weights have higher priority and are serviced first.
WFQ ensures that queues are not starved for bandwidth and that traffic gets
predictable service. Low-volume traffic streams comprise the majority of traffic and
receive preferential service. High-volume traffic streams share the remaining capacity
proportionally.
WFQ never wastes bandwidth. If there’s no higher priority traffic, lower priority
traffic is forwarded.
WFQ Package Main Features:
• Supports up to eight queues.
• Weight (cost) of queue can be modified dynamically.
• “Clear all queues’ deficits” or “Clear specific queue’s deficit” commands.
• Statistics: 32-bit counter per queue counts the number of frames transmitted

Free download research paper


CSE PROJECTS

FREE IEEE PAPER AND PROJECTS

FREE IEEE PAPER