BCMP network

A class of queueing networks whose permitted node disciplines and routing assumptions yield a product-form equilibrium distribution.

Version

v2 · 2026-09-06 · History

Domain-specific #

1361

Origin domain

queueing theory

Subdomain

multiclass product-form networks

Aliases

BCMP queueing network

Core Idea

BCMP network is a class of queueing networks whose permitted node disciplines and routing assumptions yield a product-form equilibrium distribution.

A BCMP network is an open, closed, or mixed multiclass queueing network whose nodes use specified service disciplines and class-dependent service-time restrictions, with Markovian routing, so that the stationary joint state distribution has product form. The theorem extends Jackson and Gordon–Newell networks but only under its precise node-type assumptions.

Its operative boundary is not supplied by the name alone. Preserve this identity: A class of queueing networks whose permitted node disciplines and routing assumptions yield a product-form equilibrium distribution. Validity boundary: Membership requires the BCMP service-discipline assumptions and existence of the stated product-form equilibrium, not merely a network of queues.

Scope of Application

The abstraction recurs literally within performance models of computer, communication, manufacturing, and service systems whose routing and nodes satisfy BCMP conditions. The following habitats preserve the same recognition machinery; they are not invitations to extend the name metaphorically.

• Computer systems. jobs of several classes circulate among processors and devices.
• Communication systems. traffic classes visit modeled resources.
• Manufacturing. product classes move through service stations.
• Capacity planning. throughput and queue lengths are computed from stationary form.
• Mean-value analysis. closed product-form networks are solved without enumerating every state.

Clarity

List every center's discipline, service distribution, class dependence, routing, and population regime, then match each to the theorem. Calling a network BCMP because a solver accepts similar inputs risks applying product form outside its assumptions.

A practical identification audit begins with the typed roles rather than the title: establish the service centers, verify the customer classes, then test the remaining conditions and exclusions.

Manages Complexity

The theorem turns a high-dimensional coupled Markov process into per-center factors and a normalization problem. Algorithms can derive means and throughputs without solving the full global balance equations.

The compression remains accountable because each simplification has a named failure condition. Disagreement can be localized to a missing role, an invalid assumption, an ambiguous measurement, or a neighboring abstraction instead of being hidden inside an unanalyzed label.

Abstract Reasoning

R1. Define classes, centers, visits, and open or closed populations. R2. Assign each center to an admissible BCMP type. R3. Verify the service-time restriction for every class at that type. R4. Solve traffic equations and construct the per-center factors. R5. Normalize or apply a product-form algorithm, then validate stability and outputs.

Knowledge Transfer

The name transfers only to networks satisfying the BCMP theorem. Queueing and factorization are parents; generic workflow networks or approximate decompositions should not inherit the label.

The transfer boundary is explicit: DOMAIN-SPECIFIC PASS / PRIME FAIL: The defining result applies across networks assembled from the allowed service-center classes, routing patterns, and service-time distributions. Literal recognition retains the specialist vocabulary and validity conditions of queueing theory and stochastic networks; outside that setting only broader parent operations transfer.

Relationships to Other Abstractions

Current abstraction BCMP network Domain-specific

Parents (2) — more general patterns this builds on

• BCMP network is a kind of Factorization Prime

  Factorization (prime:factorization).

• BCMP network is a kind of Queueing Prime

  Queueing (prime:queueing).

Hierarchy paths (3) — routes to 3 parentless roots

• BCMP network → Factorization → Decomposition

Show alternative paths (2)

Neighborhood in Abstraction Space

BCMP network sits in a sparse region of the domain-specific corpus (82^nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Network scheduler — 0.84
• Complete Streets — 0.81
• Learnable Function Class — 0.81
• Data Class — 0.81
• Data Access Service — 0.80

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