Core-Based Trees¶
A historic shared-tree IP-multicast routing architecture in which group receivers join toward a configured core router and traffic follows the resulting bidirectional distribution tree.
Core Idea¶
Core-Based Trees (CBT) is a historic IP-multicast routing architecture that builds one shared bidirectional distribution tree per multicast group around a configured core router. A receiver-side router sends a join toward the core; routers along the path create group state and the branch attaches when it reaches the existing tree. Senders can inject traffic at an on-tree router, and packets follow the shared tree to receivers.
The recognition invariant is multicast group + selected core/rendezvous router + receiver-initiated joins + shared bidirectional tree + per-group on-tree state + protocol maintenance. RFC 2189 was Experimental and is now Historic; retention describes an important design identity, not a recommendation for contemporary deployment.
Scope of Application¶
CBT addressed scalable inter-domain or wide-area many-to-many multicast where source-specific state would grow poorly. Its shared tree made router state depend more on groups than on source–group pairs, at the cost of core dependence and paths that could be longer than source-rooted alternatives.
The architecture remains useful in protocol history, comparison of multicast tree designs, rendezvous placement research, routing-state analysis, and failure/security reasoning.
Clarity¶
The “core” is logically central to tree construction but need not be topologically central or aware that it was configured as a core. Version 2 specifies a single active core per group tree, even though broader descriptions sometimes speak loosely of multiple cores or candidate cores.
Manages Complexity¶
The shared tree compresses many senders’ delivery state into one group structure. Routers need not maintain a separate shortest-path tree for every source, and receivers can attach by following existing unicast reachability toward a common rendezvous.
The compression transfers complexity to core selection, path stretch, single-tree failure consequences, bootstrap, and group-wide control consistency.
Abstract Reasoning¶
- Define group, candidate core, active core, and administrative scope.
- Trace a receiver’s join toward the core using unicast routing.
- Mark where the join first intersects the existing tree.
- Construct parent/child interface state along the new branch.
- Trace sender traffic entering and traversing the tree.
- Test duplicate suppression, loop prevention, and reverse-path conditions.
- Analyze core, link, and router failure and state repair.
- Compare state scaling and path stretch against source-rooted alternatives.
- Preserve protocol-version and Historic-status boundaries.
Knowledge Transfer¶
The portable structure is rendezvous-centered shared traversal: many participants attach toward a common meeting point, and the union of attachment paths becomes the reusable delivery structure. The proposed immediate parent is Network Traversal.
Relationships to Other Abstractions¶
Current abstraction Core-Based Trees Domain-specific
Parents (1) — more general patterns this builds on
-
Core-Based Trees is a kind of Network Traversal Prime
Network Traversal is the proposed immediate parent.
Hierarchy path (1) — routes to 1 parentless root
- Core-Based Trees → Network Traversal → Network → Reservoir-Flux Network → Conservation Laws → Invariance
Neighborhood in Abstraction Space¶
Core-Based Trees sits in a sparse region of the domain-specific corpus (98th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Graph-Structured Stack — 0.75
- Fallacy of Stable Topology — 0.74
- Tree (Graph Theory) — 0.74
- Connectionless Communication — 0.74
- Clique graph — 0.74
Computed from structural-signature embeddings · 2026-09-08