Package jline.api.sn
package jline.api.sn
Stochastic network analysis utilities.
This package provides utilities and algorithms for analyzing general stochastic networks, including network transformations and manipulations.
- Since:
- LINE 2.0
-
ClassDescriptionModification mode for SN setter methods.The arrival rate of a station-class pair AS A FUNCTION OF TIME.lambda(t), with whether it actually varies and the cycle length.Builds a fork-join synchronization map from LINE's sn structure.Result of the fork-join synchronization scan.Total service rate of a station served by heterogeneous server pools with a class-compatibility graph, and the peak that normalizes its utilization.Whittle balance check for a globally state-dependent rate scaling.Physical buffer size of a station, in jobs, the one in service included.Finite-buffer blocking or loss anywhere in the network.Detects whether a network has a bursty (non-renewal) external arrival process.Detects routing that is not identical across job classes.Legacy name of
SnHasProductFormNotHetFCFS, kept as a delegating alias exactly as the python twin does: the pre-rework body here still admitted LCFSPR and lacked the FCFS equal-service-means check, so it could disagree with the predicate the AMVA dispatch actually uses.Checks if the network has a quorum (k-of-n) join.True when some station schedules by non-preemptive shortest job next.Aggregation of a class-indexed interlock matrix to the chain basis the MVA solvers work in.Decides whether a model lives on a discrete (slotted) time scale.Outcome of the test: the verdict, the slot length and why it failed.The single-station M/M/1/K loss system.Stochastic network model type classifier for open models.Tests whether a process representation admits a phase-type reading.Rate at which sibling tasks are discarded at each Join.Number of sibling tasks a Join node waits for in a given class.Number of sibling tasks forked per parent job on a fork-join pair.Collects the (D0,D1) modulation records of every non-renewal arrival or service process declared in the network.One modulating process of the network.NetworkStruct modification options (placeholder utility class).Open-class contribution to an aggregate state probability at one station.Patience (time-to-abandon) handles derived from aNetworkStruct.The patience law of one station-class pair, in the forms the solvers consume.Place throughput, arrival rate and response time in tokens.Recovers per-mode transition firing rates from the Place throughputs.Outcome of the recovery.Stochastic network Print algorithms.Stochastic Network Visit Ratio Calculator.Convert LINE network structure to Agent (RCAT) format for SolverAG.Stochastic network ToAG algorithms.Per-station load-dependent rate scaling alpha(i,n) for the QRF bounds.The scaling, the utilization normalizer, and why they may not exist.Derives the QRF BAS blocking tables (f, MR, BB, MM, ZZ, MM1) from an sn.The derived tables, or the reason they cannot be built.Per-station occupancy bound F(i) for the QRF bounds.Occupancy bounds, which of them bind, and why not when they cannot be built.NetworkStruct Validation Utilities.Exception thrown when validation fails during NetworkStruct modification.Validation level for SN setter methods.