IEEE 802.1Qfq
E81390
Ethernet traffic scheduling specification
IEEE standard amendment
time-sensitive networking amendment
IEEE 802.1Qfq is a time-sensitive networking amendment that specifies a fair queuing-based transmission selection algorithm to provide low-latency, deterministic traffic scheduling in Ethernet networks.
Statements (35)
| Predicate | Object |
|---|---|
| instanceOf |
Ethernet traffic scheduling specification
→
IEEE standard amendment → time-sensitive networking amendment → |
| aimsToProvide |
deterministic traffic scheduling
→
low-latency traffic scheduling → |
| appliesTo |
Ethernet networks
→
bridged local area networks → |
| concerns |
egress port scheduling
→
traffic shaping and scheduling → |
| defines |
fair queuing-based transmission selection algorithm
→
|
| domain |
computer networking
→
industrial Ethernet → real-time communications → |
| focusesOn |
time-sensitive networking
→
|
| improves |
determinism of frame transmission
→
latency bounds for scheduled traffic → |
| layer |
data link layer
→
|
| objective |
ensure fairness among traffic flows
→
provide predictable frame transmission times → |
| partOf |
IEEE 802.1 Time-Sensitive Networking standards family
→
IEEE 802.1Q → |
| publishedBy |
IEEE
→
|
| relatedTo |
IEEE 802.1Qav
→
IEEE 802.1Qbv → IEEE 802.1Qch NERFINISHED → IEEE 802.1Qcr NERFINISHED → |
| specifies |
transmission selection algorithm
→
|
| standardizedBy |
IEEE 802.1 Working Group
→
|
| supports |
quality of service
→
time-sensitive traffic → |
| technology |
Ethernet
→
|
| typeOf |
link-layer scheduling mechanism
→
|
| usedIn |
deterministic Ethernet applications
→
time-sensitive networking deployments → |
| uses |
fair queuing
→
|
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
IEEE 802.1 standards family
→
|
includes |