Class SnHasBlocking
Port of matlab/src/api/sn/sn_has_blocking.m. True when some
station can refuse a job, either because its own buffer BINDS (Kendall's K
below the population that can reach it, whatever the drop rule: WAITQ, DROP,
BAS, BBS, RSRD) or because a finite capacity region caps a set of stations
jointly. Such a network is not product form: the truncation couples the
station occupancies, so no BCMP factorization of the equilibrium
distribution exists.
Only a buffer that can actually BIND counts, which is what
SnGetBufferSize decides: refreshCapacity derives a finite classcap
(the chain population) at every station of every closed model, so a plain
finiteness test would call every closed model blocking.
Two shapes are exempt. A Cache builds its own capped retrieval queues (classCap = 1), which the cache analyzers solve rather than treat as a buffer constraint. And the single-station M/M/1/K loss system keeps the truncated geometric distribution, a product form over its one station, evaluated in closed form by the loss branches of SolverMVA and SolverNC.
-
Method Summary
-
Method Details
-
snHasBlocking
- Parameters:
sn- network structure- Returns:
- true if the network has binding finite buffers or capacity regions
-