A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

QoS: Quality of Service

Graduate Depth 88 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
432prerequisites beneath it
See this on the map →
Bandwidth, Latency, and ThroughputTCP Flow Control and Congestion Control→→Traffic Shaping and Policing
qos traffic-shaping prioritization sla latency jitter

Core Idea

QoS techniques prioritize and shape network traffic to meet application requirements (e.g., low latency for voice, high throughput for video). QoS mechanisms include traffic classification, queue scheduling (e.g., weighted fair queuing), and rate limiting, enabling service providers to offer differentiated services and meet service-level agreements.

Explainer

Networks carry many kinds of traffic simultaneously — video calls, file downloads, web browsing, database replication — and not all of it is equally sensitive to delay or loss. A video call becomes unusable with 200 ms of added latency, but a file download barely notices. Without intervention, routers treat every packet identically: first in, first out. Quality of Service (QoS) is the set of techniques that break this default equality, giving some traffic preferential treatment so that applications with strict requirements actually get what they need.

The first step in any QoS system is traffic classification: identifying which packets belong to which category. This can happen by inspecting port numbers (voice traffic often uses specific RTP ports), by reading DSCP markings in the IP header (a 6-bit field specifically designed for QoS labeling), or by deep packet inspection. Once classified, packets enter different queues inside the router. The simplest approach gives high-priority traffic its own queue that is always served first (strict priority queuing), but this risks starving lower-priority traffic entirely. More sophisticated schedulers like weighted fair queuing (WFQ) allocate bandwidth proportionally — voice might get 40% of link capacity guaranteed, video 35%, and best-effort traffic the remainder — ensuring every class gets some service while protecting sensitive traffic from congestion.

Beyond scheduling, QoS includes traffic shaping and policing. Shaping smooths bursty traffic by buffering excess packets and releasing them at a controlled rate, which prevents sudden bursts from overwhelming downstream links. Policing is harsher: packets exceeding the agreed rate are dropped or re-marked to a lower priority. Together, these mechanisms let service providers define service-level agreements (SLAs) — contractual guarantees about bandwidth, latency, jitter, and packet loss — and actually enforce them in the network. From your understanding of TCP congestion control, you know that endpoints already try to adapt to network conditions; QoS operates at the network layer to ensure that the conditions themselves are managed, not just reacted to.

The two dominant QoS architectures are Integrated Services (IntServ), which reserves resources per-flow using RSVP signaling, and Differentiated Services (DiffServ), which marks packets into broad classes and lets each router apply per-hop behavior without per-flow state. IntServ provides strong guarantees but scales poorly because every router must track every flow. DiffServ scales well because routers only need to recognize a handful of traffic classes, but its guarantees are statistical rather than absolute. In practice, most modern networks use DiffServ at scale, with IntServ-like reservation applied selectively for the most critical flows.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Literal Equations → Slope-Intercept Form → Point-Slope Form → Writing Linear Equations → Parallel and Perpendicular Line Slopes → Graphing Linear Equations → Piecewise Functions → One-Sided Limits → Continuity Definition → Limits and Continuity in Multiple Variables → Functions of Several Variables → Continuity in Multiple Variables → Partial Derivatives: Definition and Computation → Differentiability in Multiple Variables → Differentiability in Multivariable Functions → Total Differential and Linear Approximation → Chain Rule for Multivariable Functions → Implicit Differentiation → Related Rates → Optimization Problems → Critical Points of Multivariable Functions → Critical Points and Classification of Extrema → Second Partial Test for Local Extrema (Hessian) → The Hessian Matrix and Second Derivative Test → Unconstrained Optimization: Finding Extrema → Optimization in Multiple Variables → TCP Flow Control and Congestion Control → QoS: Quality of Service

Longest path: 89 steps · 432 total prerequisite topics

Prerequisites (2)

Leads To (1)