![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Files | |
| npfqn_bnd_bgt.h | |
| Piecewise-linear Lyapunov UPPER bound on the steady-state queue lengths of a multitype (deterministic-routing) multiclass Markovian queueing network, valid for EVERY work-conserving Markovian policy. | |
| npfqn_bnd_bpt.h | |
| First-order linear-programming relaxation of the achievable region of a multiclass open Markovian queueing network. | |
| npfqn_dps_morrison.h | |
| Two-term heavy-usage asymptotic approximation for a closed queueing network with one infinite-server (think) station and one discriminatory processor-sharing (DPS) station. | |
| npfqn_feedback_elim.h | |
| Near-immediate feedback elimination for the robust queueing network analyzer. | |
| npfqn_nonexp_approx.h | |
| Handler for non-exponential service and arrival processes in AMVA and NC. | |
| npfqn_rqna_weight.h | |
| Canonical reflected-Brownian-motion correlation weight w*(t) used by the Robust Queueing Network Analyzer (RQNA). | |
| npfqn_sqd.h | |
| Smith Queue Decomposition (SQD): approximate MVA for closed networks under Blocking-After-Service (manufacturing / transfer blocking). | |
| npfqn_traffic_idc.h | |
| Traffic variability equations of the Robust Queueing Network Analyzer (W. | |
| npfqn_traffic_merge.h | |
| Superposition of several marked arrival flows into one. | |
| npfqn_traffic_merge_cs.h | |
| Merge of marked arrival flows with class switching. | |
| npfqn_traffic_rqt.h | |
| Effective arrival processes of a network under the Robust Queueing calculus. | |
| npfqn_traffic_split_cs.h | |
| Splitting of a marked MAP departure flow with class switching. | |
| npfqn_traffic_split_rr.h | |
| Deterministic (round-robin) split degrees of every station-class departure stream. | |
| npfqn_types.h | |
| Shared arithmetic helpers for the templated npfqn port. | |