CQF
E44307
CQF (Cyclic Queuing and Forwarding) is a time-sensitive networking mechanism defined in IEEE 802.1Qch that provides deterministic, low-latency packet forwarding using cyclic transmission queues.
All labels observed (1)
| Label | Occurrences |
|---|---|
| CQF canonical | 3 |
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf | time-sensitive networking mechanism ⓘ |
| abbreviation | CQF self-linksurface differs ⓘ |
| appliesTo |
Time-Sensitive Networking bridges
ⓘ
bridged Ethernet networks ⓘ |
| belongsToDomain |
Time-Sensitive Networking
ⓘ
computer networking ⓘ |
| benefit |
improved determinism compared to best-effort Ethernet
ⓘ
reduced queuing delay variability ⓘ |
| category |
queuing and forwarding mechanism
ⓘ
traffic shaping mechanism ⓘ |
| compatibleWith |
IEEE 802.1AS timing and synchronization standard
ⓘ
surface form:
IEEE 802.1AS time synchronization
|
| definedInStandard | IEEE 802.1Qch ⓘ |
| deploymentScenario |
automotive Ethernet networks
ⓘ
industrial automation networks ⓘ professional audio-video networks ⓘ |
| ensures |
bounded end-to-end delay
ⓘ
predictable forwarding behavior ⓘ zero congestion loss under configured conditions ⓘ |
| fullName |
IEEE 802.1Qch cyclic queuing and forwarding standard
ⓘ
surface form:
Cyclic Queuing and Forwarding
|
| introducedBy | IEEE 802.1 Working Group ⓘ |
| layer | Data Link Layer ⓘ |
| operatesOn |
Ethernet frames
ⓘ
egress queues ⓘ |
| OSIModelLayer | Layer 2 ⓘ |
| partOfStandardFamily |
IEEE 802.1Q series
ⓘ
surface form:
IEEE 802.1Q
|
| primaryGoal |
bounded latency
ⓘ
deterministic packet forwarding ⓘ low-latency packet forwarding ⓘ |
| queueOperation | cyclic open-and-close of transmission queues ⓘ |
| relatedTo |
IEEE 802.1Qav
ⓘ
IEEE 802.1Qbv ⓘ IEEE 802.1Qcr ⓘ |
| requires | time synchronization between network nodes ⓘ |
| requiresConfiguration |
cycle time
ⓘ
queue gate control parameters ⓘ |
| schedulingModel | time-slot based scheduling ⓘ |
| standardStatus |
IEEE 802.1Qed
ⓘ
surface form:
IEEE standard amendment to 802.1Q
|
| supports |
bounded jitter for time-sensitive flows
ⓘ
deterministic latency for periodic traffic ⓘ |
| trafficType |
audio-video streams
ⓘ
industrial control traffic ⓘ real-time traffic ⓘ time-sensitive traffic ⓘ |
| usesMechanism |
cyclic transmission queues
ⓘ
time-based scheduling ⓘ time-synchronized operation ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: CQF Description of subject: CQF (Cyclic Queuing and Forwarding) is a time-sensitive networking mechanism defined in IEEE 802.1Qch that provides deterministic, low-latency packet forwarding using cyclic transmission queues.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
IEEE 802.1Qch
subject surface form:
Cyclic Queuing and Forwarding