Week 9 · Lesson 13

QoS and Per-Hop Behavior

All packets are equal on the wire — but not all traffic is equal to the business. A dropped VoIP voice stream is a broken conversation; a momentarily delayed email is nothing. Quality of Service (QoS) is the toolkit that sorts traffic into classes and treats each class appropriately at every router in the path. This lesson covers the CCNA’s conceptual framework: classification, marking, queuing, shaping and policing, and congestion avoidance — the per-hop behaviors that make real-time application traffic work.

CCNA 200-301 Domain 4.0 IP Services Verified 2026-10-11
Learning objectives
Part 1

Why QoS exists

Switches and routers treat output as a queue: when more data waits for a link than the link can carry, the excess queues, and when the queue fills, packets are dropped. The defaults are egalitarian — first come, first served, everyone equally dropped under pressure — but the traffic sharing the pipe is anything but equal. Without QoS, a backup pushing gigabytes can stall every phone call in the building, because voice frames wait behind the backup’s packets just like everything else.

Definition — QoS Quality of Service (QoS) is the set of techniques a network uses to treat different traffic classes differently so that time-critical applications get predictable service. QoS does not add bandwidth; it manages what happens under congestion — delay, jitter, and loss are distributed according to policy instead of by chance.

Three QoS problems must be solved. Delay (latency) is the time a packet takes to cross the network, and it has fixed components (serialization, propagation, switching) plus a variable one: queuing. Jitter is the variation in delay from packet to packet — worse for real-time than raw delay, because voice decoders need steady spacing. Loss is packets dropped in queues. QoS manages all three by deciding, at each hop, whose packets get the low-delay treatment and whose absorb the waiting.

A key exam phrase: QoS is a per-hop behavior. There is no "guarantee across the whole path" mechanism in classic IP — every router makes local decisions on the packets it holds, and only if every hop applies the same policy does the end-to-end result hold up. That is why markings must survive the journey (the topic of classification and marking) and why mistrusting a marking at one hop quietly destroys a voice class.

In this lesson · select a part to jump

Key ideas & exam traps · select one

Part 2

Real-time vs elastic traffic

Applications sort into two broad personalities, and QoS policy is designed around the difference:

PropertyReal-timeElastic (data)
ExamplesVoice calls (RTP), video conferencing, streamingWeb browsing, email, file transfer, backups
Delay sensitivityVery high; latency over ~150 ms one-way degrades callsLow; TCP applications wait and retry
Jitter sensitivityExtremely high; voice decoders refill jitter buffers only brieflyNegligible
Loss handlingCannot retransmit; a dropped voice packet is heard as distortionTCP retransmits lost packets
Rate shapeConstant bit rate (a G.711 call), low to medium bandwidthBursty; expands to fill the pipe
QoS goalProtect it: low delay, low jitter, near-zero lossShare what remains; absorb the drops
The fundamental trade Real-time traffic refuses to wait or retransmit, so its only protection is being served first. Elastic traffic can wait — TCP even reacts to loss by slowing down, which is why data applications are the natural candidates for the drops and delays QoS must assign to someone. The policy goal is simple to state and hard to do well: guarantee the real-time class while giving every other class a fair share of the rest.
Reference table · select a row

Part 3

Classification

Before a router can treat traffic differently it must tell classes apart. Classification is inspecting packets and assigning each to a category. It can match nearly anything visible in the header: the source or destination IP, the transport protocol (UDP/TCP), the port numbers (e.g. RTP audio), or an existing marking — the Layer 2 CoS or IP DSCP field (Section 4). In IOS, classification is commonly done with access lists or with class maps (class-map + match statements) that feed a policy.

Definition — classification vs marking Classification is the act of putting a packet into a class (matching). Marking is the act of writing a label into the packet (e.g. setting the DSCP value) so that every downstream device can classify by the label without re-inspecting application details. Marking is what makes per-hop behavior feasible and consistent: classify once, mark well, and every hop recognises the class cheaply.

Which fields a classifier uses depends on where in the network it is. Deep classification (ports, application signatures) is expensive and belongs at the edge, close to the source. Interior routers should classify on the markings already written — cheap, fast, and uniform. Getting that placement backwards is a classic design error: deep-inspection at the core wastes switching capacity that should be forwarding packets.

Part 4

Marking: CoS, DSCP, EF

The marks the CCNA expects you to recognise live on two layers:

MarkLayerWhere it sitsRange
CoSLayer 2The 3-bit class of service field inside an 802.1Q VLAN tag0–7
IPprecLayer 3The original 3-bit precedence in the IPv4 ToS byte0–7
DSCPLayer 3The 6-bit Differentiated Services Code Point in the IPv4 ToS / IPv6 traffic-class byte0–63
Exam tip — the numbers to memorise Voice is EF, DSCP 46. That one fact settles most marking questions: EF (“ Expedited Forwarding”, DSCP 46) is the standard marking for the voice bearer (RTP) traffic. Other fixtures: AF (Assured Forwarding) classes such as AF41/AF42/AF43 (DSCP 34/36/38) are common business-critical data; the default BE (best effort) is DSCP 0; and CS (class selector) values like CS5 (40) and CS3 are the “legacy precedence” family. CoS 5 is the 802.1Q tag mark that accompanies EF voice on trunk links; CoS values 0–7 map to the four queue priorities through a configurable table.

A phone call crosses the LAN carrying CoS into the switch and DSCP into the router, and QoS only works when both survive. The phone marks its own calls (typically EF/CoS 5 for audio, CS3/CoS 3 for signalling), and the trust boundary (Section 8) decides whether the access switch accepts those marks or overrides them.

IP phone speaks + marks its own RTP Access switch trusts CoS 5 / trusts DSCP EF Core router queues EF into the LLQ Remote gateway voice terminates 802.1Q CoS 5 on the tag IP DSCP EF (46) at Layer 3 audio: EF · signalling: CS3 one mark per layer, both must survive
Voice audio is marked CoS 5 at Layer 2 (inside the 802.1Q tag) and DSCP EF at Layer 3. The access switch trusts the phone’s marks, and routers put EF into a low-delay queue while best-effort data queues normally — the per-hop behavior that protects the call.
Part 5

Queuing and scheduling

When a link is congested, every router faces the same choreography: packets wait in queues (queuing) and the interface picks which queue to drain next (scheduling). The default FIFO (first in, first out) is fair in the crudest sense and terrible for real-time traffic, because a burst of bulk data ahead of a voice packet delays the voice packet.

The Cisco answers, in increasing sophistication:

Queuing does not create bandwidth “Prioritising voice” does not accelerate a saturated link — it reorders whose packets wait and, in the worst case, whose are dropped. PQ/LLQ lowers the delay and jitter for the priority class by making every other class wait a little more. The design rule the exam wants: size the priority queue to carry the real-time traffic and police it, then let fairness distribute the rest.
Part 6

Shaping and policing

Both shaping and policing impose a maximum rate on a traffic class using a token bucket, but they behave very differently when the traffic exceeds the allowed rate:

FeatureShapingPolicing
What it doesDelays excess traffic in a queue to smooth it to the configured rate.Drops (or re-marks) excess traffic immediately.
Traffic resultBursts are buffered and sent later; rate never exceeds the limit.Bursts are clipped; excess never travels.
Effect on TCPSmooth; TCP sees delay rather than loss, so it adapts gently.Loss-based; TCP back-off typically triggered by the drops.
Buffering/memoryNeeds a queue and memory.Stateless; no buffering.
Typical useSending to a slower provider or shaping outbound bursts to stay under a WAN contract.Enforcing a hard committed rate at the edge; anti-spoofing DDoS rate limits.
Exam tip — shape vs police in one line Shaping buffers and delays the excess; policing drops the excess. If a question says “the excess traffic is queued and sent later”, it is shaping; if it says “exceeding traffic is dropped”, it is policing. Police near the customer/ingress, shape toward egress where delay is acceptable — the exam phrases this as “shape on output near the far end, police on input at the edge”.
Part 7

Congestion avoidance

Congestion avoidance tries to prevent the tail-end panic by discarding a few packets deliberately before a queue overflows. The classic tool is WRED (Weighted Random Early Detection): the router monitors average queue depth and, as it grows, drops an increasing percentage of packets randomly but weighted — low-priority classes get dropped first. The virtue of random early drops is that they are noticed instead of the alternative: when a full queue tail-drops a whole wind of TCP segments, every TCP flow backs off at once and the link “hits a wall” and then under-utilises (classic TCP global synchronisation). WRED spreads the drops so some flows slow while others continue, holding the queue below the dangerous point.

Definition — WRED Weighted Random Early Detection is a congestion-avoidance mechanism that drops a small, weighted fraction of packets as the queue approaches congestion — more aggressively for lower-priority traffic — to keep the average queue short and avoid the burst of tail drops that crush an entire TCP population at once.

Notice the deliberate contrast with LLQ: LLQ is a scheduling mechanism that decides the order of service, WRED is an avoidance mechanism that decides who gets dropped before a queue ever fills. The exam wants you to attach each tool to its job and not to confuse “random early drop before congestion” (WRED) with “hard drop when the bucket is empty” (policing) or “hold-it-in-a-buffer” (shaping).

Part 8

The trust boundary

Markings are only useful if they are truthful. Any host that can write a DSCP or CoS value could mark its traffic EF and jump every queue — an instant way to starve everyone else. QoS therefore defines a trust boundary: the point beyond which markings are believed.

The boundary belongs at the access layer The trust boundary should sit at the access switch port, as close to the source as possible — an attacker or a misconfigured laptop must not get a voice-class marking just by setting a DSCP bit. Push trust inward to the few trusted devices and reset everything else. Making the core “trust the marks too generously” is a security failure dressed up as a QoS convenience.

Two extensions exams mention: the classification/remark relationship is where a switch, seeing untrusted DSCP, classifies by ACL and re-marks into the correct class as traffic enters; and shaping/policing chain — the same frame that is classified at the edge may be policed there, re-marked, then queued at the next hop. Per-hop behavior means each router only does its slice — classify, mark, queue, shape/police, avoid — and the CCNA expects you to name that slice on sight.

Key terms

The vocabulary you need

Every term below appears in the lesson text above. Select one to read its definition, then use the quiz at the end to check what stuck.

Key terms · select a term

Part 9 · Your turn

Review

Check what you have learned with these review questions.

Review · 5 questions

Sources

Sources & references

  1. Cisco. CCNA (200-301) Exam Topics. cisco.com.
  2. IETF. Request for Comments (RFCs). rfc-editor.org.
  3. IANA. Internet Assigned Numbers Authority registries. iana.org.

Target exams: CCNA 200-301 v1.1 · CyberOps Associate 200-201. Last content verification: 2026-10-11.