Wormhole switching¶
A network flow-control method that divides a packet into flits and pipelines them through successive routers while the header reserves the path.
Core Idea¶
It controls buffer movement rather than route selection, blocked headers can hold channels across many routers and virtual channels are often needed to prevent protocol deadlock. The header flit advances and establishes routing state, following flits stream through small buffers along the same route and backpressure stalls the entire distributed packet when its next channel is unavailable. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Wormhole switching belongs to computer networking and is useful where the analyst can specify the typed computer networking carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the network topology and routing function, packet and ordered flits, header routing state, router input and output channels, buffer depth, channel reservation, backpressure and stall propagation, tail release, latency and throughput and deadlock and virtual-channel conditions are explicit. The scope is broad within that domain but bounded by the need for the network topology and routing function, packet and ordered flits, header routing state, router input and output channels, buffer depth, channel reservation, backpressure and stall propagation, tail release, latency and throughput and deadlock and virtual-channel conditions are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the network topology and routing function, packet and ordered flits, header routing state, router input and output channels, buffer depth, channel reservation, backpressure and stall propagation, tail release, latency and throughput and deadlock and virtual-channel conditions are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Wormhole switching. Wormhole switching compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed computer networking carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the network topology and routing function, packet and ordered flits, header routing state, router input and output channels, buffer depth, channel reservation, backpressure and stall propagation, tail release, latency and throughput and deadlock and virtual-channel conditions are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of computer networking because they reuse the typed computer networking carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, The header flit advances and establishes routing state, following flits stream through small buffers along the same route and backpressure stalls the entire distributed packet when its next channel is unavailable., and type the carrier, state every parameter and convention in the definition, test that the network topology and routing function, packet and ordered flits, header routing state, router input and output channels, buffer depth, channel reservation, backpressure and stall propagation, tail release, latency and throughput and deadlock and virtual-channel conditions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Wormhole switching Domain-specific
Parents (1) — more general patterns this builds on
-
Wormhole switching is a kind of Flow Prime
The proposed strict upward parent is
prime:flow.
Hierarchy path (1) — routes to 1 parentless root
- Wormhole switching → Flow
Neighborhood in Abstraction Space¶
Wormhole switching sits in a crowded region of the domain-specific corpus (26th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Network Protocols & Traffic Control (29 abstractions)
Nearest neighbors
- Virtual circuit — 0.91
- Network throughput — 0.91
- Reliability (computer networking) — 0.91
- Xcast — 0.91
- Overlay network — 0.90
Computed from structural-signature embeddings · 2026-09-08