Skip to content

Bandwidth shaping

Traffic shaping smooths the bandwidth requirements of traffic flows by delaying transmission packets when they are queued in bursts.

Version
v1 · 2026-09-28 · History
Domain-specific #
8112
Domain group
Applied Sciences & Engineering
Origin domain
Computer Science & Software Engineering
Subdomains
Computer Networking, Traffic Management → Computer Science & Software Engineering

Core Idea

Bandwidth shaping is treated here as the recurring computerscienceandinformation identity summarized by this source-grounded definition: Traffic shaping smooths the bandwidth requirements of traffic flows by delaying transmission packets when they are queued in bursts. A network scheduler, also called packet scheduler, queueing discipline (qdisc) or queueing algorithm, is an arbiter on a node in a packet switching communication network. It manages the sequence of network packets in the transmit and receive queues of the protocol stack and network interface controller.

How would you explain it like I'm…

The Steady Slide Line

When a crowd of kids rushes to the slide all at once, a helper lines them up and lets them go down one at a time at a steady pace. Nobody is sent away; they just wait a little. Bandwidth shaping does the same thing with pieces of internet data, turning a sudden rush into a smooth flow.

Smoothing Data Bursts

Data on a network travels in small pieces called packets, and sometimes a computer sends a big burst of them at once. Bandwidth shaping smooths out those bursts by holding some packets in a waiting line and letting them out at a steadier pace. A part of the network called a scheduler decides which packet goes next. The packets are delayed, not deleted, so the traffic flows more evenly.

Traffic Shaping by Delay

Bandwidth shaping, or traffic shaping, smooths out how much bandwidth a flow of traffic needs by delaying packets that arrive in bursts. The packets wait in a queue on a network device, and a part called the network scheduler (also called a queueing discipline) decides which packet to send next and when. Some systems keep one queue; others keep several, each holding one flow, class of traffic, or priority level. The key feature is delay rather than discarding: excess packets are held and released later. That separates shaping from simply dropping extra traffic, and it means a burst is spread out over time rather than lost.

 

Bandwidth shaping (traffic shaping) smooths the bandwidth demand of traffic flows by delaying packets that are queued in bursts, so that transmission conforms to a steadier rate. It is implemented by a network scheduler, also called a packet scheduler, queueing discipline (qdisc) or queueing algorithm, which acts as an arbiter on a node in a packet-switched network: it manages the order of packets in the transmit and receive queues of the protocol stack and network interface controller, and decides which packet to forward next. Packets are stored temporarily in one queue or in several, where each queue may hold a single flow, traffic class or priority. Many scheduling algorithms exist and different operating systems provide different schedulers. What makes a case genuinely shaping is the preserved mechanism of smoothing bursts by delay; merely having a scheduler, or observing a downstream effect such as reduced peaks, is not sufficient.

Scope of Application

  • Algorithms. Queuing disciplines are commonly used as attempts to compensate for various networking conditions, like reducing the latency for certain classes of network packets, and are generally used as part of QoS.

  • ImplementationsLinux kernel. The eBPF functionality brought by version 4.1 of the Linux kernel in 2015 extends the classic BPF programmable classifiers to eBPF.

  • Terminology and responsibilities. A network scheduler may have responsibility in implementation of specific network traffic control initiatives.

  • Terminology and responsibilities. Network traffic control is an umbrella term for all measures aimed at reducing network congestion, latency and packet loss.

  • Terminology and responsibilities. Specifically, active queue management (AQM) is the selective dropping of queued network packets to achieve the larger goal of preventing excessive network congestion.

Clarity

A clear use of Bandwidth shaping names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is Traffic shaping smooths the bandwidth requirements of traffic flows by delaying transmission packets when they are queued in bursts.

Manages Complexity

Bandwidth shaping compresses multiple computerscienceandinformation details into a stable diagnostic relation. The source shows both the central mechanism—bufferbloat is a phenomenon in packet-switched networks in which excess buffering of packets causes high latency and packet delay variation.—and the practical consequence—as of OpenBSD version 5.5 ALTQ was replaced by the HFSC scheduler. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit.

Abstract Reasoning

  1. Type the carrier. Identify the computerscienceandinformation entities to which the claim applies.
  2. State the relation. Use the source-grounded identity: Traffic shaping smooths the bandwidth requirements of traffic flows by delaying transmission packets when they are queued in bursts.
  3. Check operation and conditions. Bufferbloat can be addressed by a network scheduler that strategically discards packets to avoid an unnecessarily high buffering backlog.
  4. Demand recognition evidence. The Linux kernel's network stack contains several other buffers, which are not managed by the network scheduler.
  5. Test variation.

Knowledge Transfer

Within the home domain. Knowledge about Bandwidth shaping transfers literally when a new case preserves the same carrier type, relation, and recognition test. Queuing disciplines are commonly used as attempts to compensate for various networking conditions, like reducing the latency for certain classes of network packets, and are generally used as part of QoS measures. The eBPF functionality brought by version 4.1 of the Linux kernel in 2015 extends the classic BPF programmable classifiers to eBPF. Beyond the home domain. No canonical parent is asserted for Bandwidth shaping.

Neighborhood in Abstraction Space

Bandwidth shaping sits in a sparse region of the domain-specific corpus (89th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08