 |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
| doc | |
| config.doxygen-cpp | |
| include | |
| line | |
| api | |
| aoi | |
| aoi_dist2ph.h | MAP to PH conversion for the age-of-information solvers |
| aoi_fcfs_dm1.h | Mean, variance and peak Age of Information of a D/M/1 FCFS queue |
| aoi_fcfs_gim1.h | Mean Age of Information, its transform and the peak age of a GI/M/1 FCFS queue |
| aoi_fcfs_md1.h | Mean, variance and peak Age of Information of an M/D/1 FCFS queue |
| aoi_fcfs_mgi1.h | Mean Age of Information, its transform and the peak age of an M/GI/1 FCFS queue |
| aoi_fcfs_mm1.h | Mean, variance and peak Age of Information of an M/M/1 FCFS queue |
| aoi_lcfsd_gim1.h | Mean and peak Age of Information of a GI/M/1 non-preemptive LCFS queue with discarding (LCFS-D, equivalently GI/M/1/2*) |
| aoi_lcfsd_mgi1.h | Mean and peak Age of Information of an M/GI/1 non-preemptive LCFS queue with discarding (LCFS-D, equivalently M/GI/1/2*) |
| aoi_lcfspr_dm1.h | Mean, variance and peak Age of Information of a D/M/1 preemptive LCFS queue |
| aoi_lcfspr_gim1.h | Mean Age of Information, its transform and the peak age of a GI/M/1 preemptive LCFS queue |
| aoi_lcfspr_md1.h | Mean, variance and peak Age of Information of an M/D/1 preemptive LCFS queue |
| aoi_lcfspr_mgi1.h | Mean Age of Information, its transform and the peak age of an M/GI/1 preemptive LCFS queue |
| aoi_lcfspr_mm1.h | Mean, variance and peak Age of Information of an M/M/1 preemptive LCFS queue |
| aoi_lcfss_gim1.h | Mean and peak Age of Information of a GI/M/1 non-preemptive LCFS queue with set-aside (LCFS-S) |
| aoi_lcfss_mgi1.h | Mean and peak Age of Information of an M/GI/1 non-preemptive LCFS queue with set-aside (LCFS-S) |
| aoi_lst_det.h | Laplace-Stieltjes transform of a deterministic (constant) distribution |
| aoi_lst_erlang.h | Laplace-Stieltjes transform of an Erlang-k distribution |
| aoi_lst_exp.h | Laplace-Stieltjes transform of an exponential distribution |
| aoi_lst_ph.h | Laplace-Stieltjes transform of a phase-type distribution PH(alpha, T) |
| aoi_types.h | Shared return types and arithmetic helpers for the templated Age of Information port |
| cache | |
| cache_cost.h | Mean per-list storage cost of a cache with item sizes, and the screen for promotion paths that storage cost caps make unreachable |
| cache_erec.h | Exact recursive normalizing constant of a multi-list cache model |
| cache_gamma.h | Access factors of a multi-list cache whose lists form a general access GRAPH |
| cache_gamma_lp.h | Access factors of a tree-structured multi-list cache |
| cache_is.h | Importance-sampling estimate of the cache normalizing constant |
| cache_lrum_map_levelstats.h | Level statistics of one item's embedded (list, phase) chain in the LRU(m)-MAP TTL approximation |
| cache_miss.h | Exact cache miss rates from the recursive normalizing constant |
| cache_miss_asy.h | Asymptotic (large-cache) miss ratio by a rank-threshold fixed point |
| cache_miss_fpi.h | Cache miss rates from the fixed-point multipliers |
| cache_miss_is.h | Cache miss rates from the importance-sampling hit probabilities |
| cache_miss_pos_rmf.h | Position-resolved mean-field miss rates for FIFO(m) and strict FIFO(m) |
| cache_miss_rmf.h | Refined mean field (RMF) miss rates of a multi-list RANDOM(m) cache |
| cache_miss_spm.h | Saddle-point approximation of the cache miss rates |
| cache_mva.h | Exact mean value analysis of a multi-list cache |
| cache_mva_miss.h | Per-item and global cache miss probabilities by mean value analysis |
| cache_prob_erec.h | Exact per-item hit and miss probabilities of a multi-list cache |
| cache_prob_fpi.h | Cache hit and miss probabilities from the fixed-point multipliers |
| cache_prob_is.h | Importance-sampling estimate of the cache hit-probability distribution |
| cache_prob_spm.h | Saddle-point approximation of the per-item cache hit probabilities |
| cache_rmf_lna.h | Stationary covariance of a RANDOM(m) cache occupancy, under the LNA |
| cache_rrm_meanfield.h | Steady state of the RANDOM(m) multi-list mean field |
| cache_rrm_meanfield_ode.h | Mean-field drift of the RANDOM(m) multi-list cache |
| cache_spm.h | Saddle-point approximation of the cache normalizing constant |
| cache_spm_size.h | Ray (WKB) asymptotic expansion of the cost-capped cache normalizing constant |
| cache_t_hlru.h | Characteristic times of the h-LRU / LRU(m) TTL approximation |
| cache_t_lrum_map.h | Characteristic times of the LRU(m)-MAP TTL approximation |
| cache_ttl_hlru.h | TTL (characteristic-time) approximation of an h-LRU / LRU(m) cache |
| cache_ttl_lrua.h | TTL (characteristic-time) approximation of an LRU cache whose lists form an arbitrary access graph |
| cache_ttl_lrum_map.h | TTL approximation of an LRU(m) cache whose items are requested by Markovian arrival processes |
| cache_xi_fp.h | Lagrange multipliers of a multi-list cache by fixed-point iteration |
| cache_xi_iter.h | Lagrange multipliers of a multi-list cache by the Gast-Van Houdt iteration |
| da | |
| da_cache_isolate.h | Isolated-cache input construction for the decomposition methods |
| da_cacheqn.h | Decomposition-aggregation driver for integrated cache-queueing models, a port of matlab/src/api/da/da_cacheqn.m |
| da_cacheqn_retrieval.h | Decomposition-aggregation driver for a CLOSED integrated cache-queueing model whose Cache carries a delayed-hit retrieval system |
| da_fpi.h | Damped fixed-point iteration, the shared driver of the decomposition algorithms |
| da_traffic_superpos.h | Superposition of independent renewal flows (Whitt's QNA stationary-interval method) |
| dpfqn | |
| dpfqn_nc.h | Normalizing constants of a discrete-time closed cycle of Bernoulli servers |
| dqsys | |
| dqsys_bernoulli1.h | State dependent Bernoulli server on a discrete time scale |
| dqsys_geogeo1.h | Geo/Geo/1: the discrete-time single-server queue with geometric interarrival and service times |
| dqsys_geoxgeo1.h | Geo^X/Geo/1: the discrete-time single-server queue with batch arrivals |
| fes | |
| fes_aggregate.h | Flow-equivalent-server aggregation: replace a station subset by one station |
| fes_beta_handle.h | Wraps a flow-equivalent-server throughput table as a per-class class-dependence function beta_{i,r}(n) |
| fes_build_isolated.h | Service demands and visit ratios of an isolated subnetwork, from the stochastic complement of its routing matrix |
| fes_compute_metrics.h | Per-station metrics of the ISOLATED subnetwork at every population state, the companion of fes_compute_throughputs |
| fes_compute_throughputs.h | Per-class throughput table of an isolated subnetwork, tabulated over the population lattice, for use as the load-dependent rates of a flow-equivalent server (Chandy, Herzog and Woo 1975) |
| fes_map_aggregate.h | Recursive MAP flow-equivalent server for a station subset |
| fes_map_interdeparture.h | Inter-departure MAP of a closed subnetwork made of one MAP station and one MAP flow-equivalent server |
| fes_map_interp.h | Shape-preserving interpolation of the flow-equivalent descriptors, and the population grid they are evaluated on |
| fes_map_levels.h | Per-level processes of a load-dependent flow-equivalent server |
| fes_map_moments.h | Moments and index of dispersion of an inter-departure MAP |
| fes_map_solve.h | Closed model left by a MAP flow-equivalent server, and the per-station metrics behind it |
| fes_validate.h | Input validation for Flow-Equivalent Server (FES) aggregation |
| ljd_linearize.h | Linearized index of a per-class population vector, for Limited Joint Dependence (LJD) tables |
| fj | |
| fj_amva.h | Mean value analysis of a closed network of fork-join subnetworks |
| fj_bounds.h | Upper and lower bounds on the mean response time of a K-way fork-join system of M/M/1 branches |
| fj_branch_members.h | Activities belonging to each branch of an AND-join |
| fj_char_max.h | Gravey's characteristic maximum M_K, an upper bound on the expected maximum of K i.i.d |
| fj_char_max_blom.h | Blom-corrected plotting position for the characteristic maximum |
| fj_char_max_discrete.h | Characteristic maximum of a lattice random variable |
| fj_codes.h | FJ_codes, the fork-join response-time-tail approximation of Z |
| fj_codes_matrices.h | The state-space construction of FJ_codes, the fork-join response-time-tail approximation of Z |
| fj_cox_fit.h | Two-stage Coxian fit of a mean and a squared coefficient of variation |
| fj_dag_makespan.h | Makespan of a task system with precedence constraints |
| fj_delay_opt.h | Deterministic subtask delays that minimise mean dispersion |
| fj_dispersion.h | Mean subtask dispersion of a split-merge system with Erlang branches |
| fj_dist2fj.h | Conversion of a LINE MAP into the arrival or service descriptor of the fork-join response-time-tail algorithm of Qiu, Perez and Harrison (IFIP Performance 2015) |
| fj_gk_bound.h | G(K) factors for the standardized-maximum approximation X_K^max ~ mu + sigma G(K) |
| fj_harmonic.h | Harmonic number H_K = sum_{k=1..K} 1/k |
| fj_ism_green.h | Green's independent server model of simultaneous server requests |
| fj_lst_max_het.h | Laplace-Stieltjes transform of the maximum of heterogeneous exponentials |
| fj_mg1_respt_moments.h | Mean and variance of the M/G/1 response time, as ForkTail inputs |
| fj_order_stat.h | CDF and expected value of the k-th order statistic of K i.i.d |
| fj_ordstat_exp.h | Mean of the k-th smallest of n independent EXPONENTIAL branch completion times, i.e |
| fj_qgb.h | Geometric bound on the queue length of a fork-join subnetwork |
| fj_quantile.h | Quantile of the maximum of K i.i.d |
| fj_quorum_moments.h | Mean and variance of a k-of-n (quorum) join completion time, from the mean and variance of each branch |
| fj_respt_2way.h | Exact mean response time of a 2-way fork-join system of M/M/1 branches |
| fj_respt_bulk.h | Centralized splitting analysed as an M[K]/M/c bulk arrival system |
| fj_respt_closed.h | Varki bound on the residence time of a closed fork-join subnetwork |
| fj_respt_nosplit.h | Mean response time of the distributed no-splitting parallel system |
| fj_respt_nt.h | Nelson-Tantawi approximation to the mean response time of a K-way fork-join system of M/M/1 branches |
| fj_respt_varki.h | Varki approximation to the mean response time of a K-way fork-join system of M/M/1 branches |
| fj_respt_vm.h | Varma-Makowski light-traffic interpolation for the mean response time of a K-way fork-join system of M/M/1 branches |
| fj_rmax.h | Pessimistic (independence) fork-join response time: the expected maximum of K independent M/M/1 response times, each exponential with rate mu - lambda |
| fj_rmax_erlang.h | Expected maximum of K M/E_k/1 branch response times |
| fj_rmax_evd.h | Extreme-value approximation to the maximum of K branch response times, from their mean and standard deviation |
| fj_serialization.h | Blocking probability and pseudoserver delay of serialization phases |
| fj_sm_tput.h | Saturated (single-message) maximum throughput of a K-way fork-join system with exponential branch service |
| fj_synch_delay.h | Mean synchronization delay of a 2-way fork-join system of M/M/1 branches, i.e |
| fj_tail_forktail.h | ForkTail black-box tail-latency approximation for fork-join requests |
| fj_tail_ordstat.h | Tail latency of a k-of-n (QUORUM) fork-join request |
| fj_tsm_capacity.h | Saturation throughput of the team service model |
| fj_types.h | Shared return types and arithmetic helpers for the templated fork-join port |
| fj_xmax_2.h | Expected maximum of two independent, possibly unequal-rate exponentials |
| fj_xmax_approx.h | Two-moment approximation to the expected maximum of K i.i.d |
| fj_xmax_coxian.h | Expected maximum of K i.i.d |
| fj_xmax_emma.h | EMMA (Extreme-value Maximum Moment Approximation) to the expected maximum of K i.i.d |
| fj_xmax_erlang.h | Expected maximum of K i.i.d |
| fj_xmax_exp.h | Expected maximum of K i.i.d |
| fj_xmax_het.h | Exact moments of the maximum of heterogeneous exponentials |
| fj_xmax_hyperexp.h | Expected maximum of K i.i.d |
| fj_xmax_hz.h | Harrison-Zertal approximation of the maximum of i.i.d |
| fj_xmax_hz_het.h | Harrison-Zertal approximation of the maximum of general variables |
| fj_xmax_moments_het.h | Moments of the maximum of heterogeneous exponentials by recurrence |
| fj_xmax_normal.h | Expected maximum and variance of K i.i.d |
| fj_xmax_pareto.h | Expected maximum and characteristic maximum of K i.i.d |
| infer | |
| infer_compute_ql_at_arrival.h | Per-class queue lengths seen by each arriving job, reconstructed from arrival and response time samples |
| infer_fmlps.h | Fluid response-time likelihood, and the FMLPS demand estimator built on it |
| infer_get_qlen_arrival.h | Per-class queue lengths at arrival for the per-class sample format |
| infer_gibbs.h | Gibbs sampling demand estimator for a closed delay-plus-queue model |
| infer_lqn.h | Identify hidden LQN parameters from measured performance data |
| infer_lqn_ekf.h | Extended Kalman Filter for LQN parameter identification |
| infer_lqn_findbyname.h | First element of a named LQN container matching a name |
| infer_lqn_getobs.h | Observation vector of a solved LQN, z = h(a) |
| infer_lqn_jacobian.h | Forward finite-difference sensitivity matrix of an observation map |
| infer_lqn_setparams.h | Apply a parameter vector to a LayeredNetworkStruct, and read it back |
| infer_minps_setup.h | Turn a raw per-class trace into the sample set MINPS estimates from |
| infer_mlps.h | Maximum-likelihood service-demand estimation at a processor-sharing queue |
| infer_nhpp_ks.h | Kolmogorov-Smirnov tests for a non-homogeneous Poisson arrival process |
| infer_qmle.h | Queue-length-based maximum-likelihood estimator of the service demands of a closed queueing network |
| infer_rps.h | Regression for Processor Sharing (RPS) demand estimator |
| infer_variational.h | Variational inference for Markovian queueing networks |
| lossn | |
| lossn_erlangfp.h | Erlang fixed-point (reduced-load) approximation for a loss network |
| lossn_manjunath.h | Exact analysis of a loss network by the Manjunath-Sikdar transform |
| lossn_mci.h | Monte Carlo importance-sampling summation for product-form loss networks |
| lossn_rec.h | Exact analysis of a loss network by MDD-rec |
| lqn | |
| lqn_boxbounds.h | Majumdar-Woodside robust box bounds on the throughput of a layered network |
| lqn_mol.h | Method of Layers on the SRVN decomposition of a layered queueing network whose entries carry no activity graph |
| lqn_ph.h | Phase-type composition of an LQN activity graph, the machinery behind SolverLN method 'srvn.ph' |
| lsn_max_multiplicity.h | Maximum sustainable multiplicity (concurrency level) of every element of a layered software network |
| lti | |
| laplace_invert.h | Numerical inversion of a Laplace transform: Euler, Talbot, Gaver-Stehfest |
| mam | |
| amap2_adjust_gamma.h | Nearest AMAP(2)-feasible (M2, M3, GAMMA) (matlab/lib/m3a/m3a/amap2/amap2_adjust_gamma.m) |
| amap2_assemble.h | Assemble an AMAP(2) in one of the two canonical forms (matlab/lib/m3a/m3a/amap2/amap2_assemble.m) |
| amap2_fit_gamma.h | AMAP(2) fit of three moments and the autocorrelation decay rate (matlab/lib/m3a/m3a/amap2/amap2_fit_gamma.m) |
| amap2_fitall_gamma.h | All AMAP(2) representations matching three moments and the autocorrelation decay rate (matlab/lib/m3a/m3a/amap2/amap2_fitall_gamma.m) |
| aph2_adjust.h | Nearest APH(2)-feasible values of the second and third moments (matlab/lib/m3a/m3a/aph2/aph2_adjust.m, method 'simple') |
| aph2_adjust_opt.h | Optimization-based APH(2) moment adjustment: the 'opt_param' and 'opt_char' methods of matlab/lib/m3a/m3a/aph2/aph2_adjust.m |
| aph2_assemble.h | Assemble an APH(2) from its canonical parameters (matlab/lib/m3a/m3a/aph2/aph2_assemble.m) |
| aph2_fit.h | APH(2) fit of three moments, with a fallback to adjusted moments (matlab/lib/m3a/m3a/aph2/aph2_fit.m) |
| aph2_fitall.h | All APH(2) representations matching three moments (matlab/lib/m3a/m3a/aph2/aph2_fitall.m) |
| aph_convseq.h | Convolution of a sequence of matrix-exponential laws |
| aph_fit.h | Minimal-order acyclic phase-type fit of the first three moments (matlab/lib/kpctoolbox/aph/aph_fit.m) |
| aph_fit_moments.h | Acyclic phase-type fitters from the first two moments |
| aph_simplify.h | Composition of two matrix-exponential distributions given in (alpha, T) form |
| cme.h | Concentrated matrix exponentials, and the two-moment fit built on them |
| dmap.h | Discrete-time Markovian arrival processes (D-MAPs) |
| dmap_optim_dist.h | The DISCRETE twins of map_optim_dist / map_optim_dist_acf: fit a D-MAP's D1 by minimizing a distance to a reference, with D0 held fixed |
| dtime.h | Discrete-time (slotted) matrix-analytic primitives and queues |
| hyperexp_fit_longtail.h | Fitting a hyperexponential to a long-tail distribution |
| iltcme_table.h | The vendored concentrated-matrix-exponential (CME) coefficient table that matlab_ilt reads from iltcme.json |
| ldqbd.h | Level-dependent QBD processes with finitely many levels: the rate matrices R^(n) by the backward matrix continued fraction, and the stationary distribution |
| ldqbd_mphc.h | Port of ldqbd_mphc.m and ph_multisets.m: the exact level-dependent QBD blocks of an M/PH/c queue |
| libqbd_taylor.h | Transient distribution of a level-independent-in-the-tail QBD by an adaptive Taylor series (libQBD QBD + TaylorSeriesAdaptive) |
| m3a_fit_from.h | The m3a fitters driven from a process or from a trace rather than from moments |
| m3pp22_fitc_cov.h | M3PP(2, 2) fitted to the count COVARIANCE between its two classes (matlab/lib/m3a/m3a/m3pp/m3pp22_fitc_approx_cov_multiclass.m and matlab/lib/m3a/m3a/m3pp/m3pp22_fitc_approx_cov.m) |
| m3pp2m_fitc.h | Marked MMPP(2) with m classes, fitted to counting-process characteristics (matlab/lib/m3a/m3a/m3pp/m3pp2m_fitc.m) |
| m3pp2m_fitc_approx.h | M3PP(2, m) fitted to counting-process characteristics with an optimized per-class split (matlab/lib/m3a/m3a/m3pp/m3pp2m_fitc_approx.m, matlab/lib/m3a/m3a/m3pp/m3pp2m_fitc_approx_ag.m, matlab/lib/m3a/m3a/m3pp/m3pp2m_fitc_approx_ag_multiclass.m) |
| m3pp2m_fitc_trace.h | M3PP(2, m) fitted to the counting process of a multi-class TRACE (matlab/lib/m3a/m3a/m3pp/m3pp2m_fitc_trace.m), and the analogous MMPP(2) entry point for a given MAP (matlab/lib/kpctoolbox/mmpp/mmpp2_fitc_theoretical.m) |
| m3pp2m_interleave.h | LUMPED interleaving of several M3PP(2, m), and the two fitters built on it (matlab/lib/m3a/m3a/m3pp/m3pp2m_interleave.m, matlab/lib/m3a/m3a/m3pp/m3pp2m_fitc_theoretical.m, matlab/lib/m3a/m3a/m3pp/m3pp22_interleave_fitc.m) |
| m3pp_superpos_fitc.h | M3PP obtained by SUPERPOSING one second-order process per class (matlab/lib/m3a/m3a/m3pp/m3pp_superpos_fitc.m and its two entry points m3pp_superpos_fitc_theoretical.m and m3pp_superpos_fitc_trace.m) |
| mam_transient2.h | Laplace-domain transient level-to-level transform V(s,n,m) of a piecewise level-dependent QBD, the port of matlab/src/solvers/MAM/mam_transient2.m (finite, closed at a top level) and mam_transient2_open.m (the last regime repeating to infinity) |
| mamap22_fit_bs.h | Fit a MAMAP(2,2) matching the BACKWARD moment and the class TRANSITION probability sigma |
| mamap22_fit_fs.h | Fit a MAMAP(2,2) matching the FORWARD moment and the class TRANSITION probability sigma |
| mamap2m_coefficients.h | The marking coefficients of a canonical AMAP(2), for the sigma fitters |
| mamap2m_fit.h | Fit a MAMAP(2,m): a second-order acyclic MAP marked with m classes, matching the forward and backward per-class moments |
| mamap_marked_poisson.h | The marked Poisson process every MAMAP fitter falls back to |
| map2_fit.h | Explicit inverse characterization of a second-order acyclic MAP (matlab/lib/kpctoolbox/map/map2_fit.m) |
| map2_fit_idc.h | Fit a MAP(2) to three moments and an asymptotic index of dispersion |
| map2mmpp.h | Read a MAP as an MMPP (matlab/lib/kpctoolbox/map/map2mmpp.m) |
| map_acfc.h | Autocorrelation of the counting process of a MAP at a given timescale |
| map_algebra.h | MAP algebra missing from the moment and transform headers: time reversal, the Kronecker product composition, the subdominant eigenvalue of the embedded chain and the large-order threshold |
| map_anfit.h | Fit a superposition of interrupted Poisson processes to a Hurst parameter |
| map_bernstein.h | Acyclic phase-type approximation of an arbitrary density by Bernstein exponentials |
| map_block.h | Fit a MAP(2) to three moments and an autocorrelation decay rate |
| map_cdf.h | Cumulative distribution of the inter-arrival time of a MAP |
| map_count_idc.h | Index of dispersion for counts (IDC) of a MAP at resolution t |
| map_count_mean.h | Mean of the counting process of a MAP at resolution t |
| map_count_moment.h | Power moments of the counts of a MAP in a window of length t |
| map_count_var.h | Variance of the counting process of a MAP at resolution t |
| map_dist.h | Analytic distances between continuous-time MAPs |
| map_fit_detail.h | Scalar helpers shared by the MAP/PH moment-matching headers |
| map_gamma.h | Autocorrelation decay rate of a MAP: the gamma of the geometric model rho(k) = rho0 * gamma^k with rho0 = (1 - 1/scv)/2 |
| map_joint_derivative.h | Derivatives at the origin of a MAP's complementary CDF and of its joint inter-arrival density |
| map_m1ps.h | Sojourn time distribution in a MAP/M/1 processor-sharing queue |
| map_mark.h | Mark the arrivals of a MAP with class probabilities (matlab/lib/kpctoolbox/map/map_mark.m) |
| map_max.h | Maximum of two independent MAPs, and its marked k-stage generalization |
| map_mmpp2.h | Fit an MMPP(2) to a mean, an SCV, a skewness and a lag-1 autocorrelation |
| map_moment.h | Markovian arrival process descriptors: stationary vectors, rate, moments, autocorrelation and the index of dispersion |
| map_moment_extra.h | Three small MAP quantities the C++ tree had not carried: the factorial and joint moments, and the MMAP generator |
| map_optim_dist.h | Fit the D1 of a MAP by MINIMIZING a distance to a reference MAP |
| map_pdf.h | Probability density of the inter-arrival time of a MAP |
| map_pnt.h | Counting probabilities of a MAP: P_n(t), the matrix whose (i,j) entry is the probability of n arrivals in [0,t) ending in phase j, given phase i at 0 |
| map_rand.h | Random MAP, MMPP, MMAP, acyclic-PH and hyperexponential generators, plus the hyperexponential reader |
| map_sample.h | Sample the inter-arrival times of a MAP, a RAP or a matrix exponential |
| map_transform.h | MAP constructors and structural transformations |
| map_varcount.h | Variance of the counts of a MAP over windows of length t, in the spelling of matlab/lib/kpctoolbox/map/map_varcount.m |
| maph2m_fit.h | Fit a MAPH(2,m): a second-order acyclic phase-type marked with m classes |
| matlab_ilt.h | Numerical inverse Laplace transform in the Abate-Whitt framework, the port of matlab/lib/thirdparty/iltcme/matlab_ilt.m |
| me_sample.h | Sample a matrix exponential by numerical inversion of its exact CDF |
| mfq_fluflu_sojourn.h | Sojourn-time distribution of a fluid queue whose SERVICE is itself a Markov-modulated fluid flow, as an ME or PH representation (alpha, A) |
| mfq_ld_distr.h | Stationary density and distribution of a first- or second-order level-dependent (multi-regime) Markovian fluid queue, evaluated at requested fluid levels |
| mfq_ld_mean.h | Stationary mean fluid level E[X] of a first- or second-order level-dependent (multi-regime) Markovian fluid queue, in closed form from the matrix-exponential building blocks |
| mfq_ld_solve.h | First- and second-order level-dependent (multi-regime) Markovian fluid queues: the matrix-exponential building blocks of the stationary law |
| mfq_multiregime.h | Multi-regime FEEDBACK Markovian fluid queue: density, density derivative and distribution of the fluid level |
| mfq_prio_queue.h | Fluid priority queue: per-class fluid level and sojourn time of an MMAP[K]/PH[K]/1-type continuous fluid queue served in priority order |
| mfq_sojourn.h | Sojourn-time distribution of a Markov-modulated fluid queue, as a matrix-exponential or phase-type representation (alpha, A) |
| mfq_solve.h | Core of the Markovian fluid queue: the fundamental matrices Psi, K, U and the matrix-exponential stationary solution of a general fluid model |
| mmap_assemble.h | The MMAP assembly primitives solver_mam_basic.m builds its per-station arrival stream from: mmap_exponential, the probabilistic mmap_mark, the per-class mmap_scale, and mmap_super_safe |
| mmap_compress.h | Compression of a marked MAP into a smaller representation, and the two M3A primitives it is built from: the class-conditional backward moments and the probabilistic mixture of MAPs |
| mmap_count_var.h | Per-class variance of the counting process of a marked MAP |
| mmap_k_fit.h | EXACT inverses of the class-marking map: solve for the split directly instead of optimizing it |
| mmap_lambda.h | Marked MAP (MMAP) algebra: per-class rates, class probabilities, superposition, normalization and scaling |
| mmap_modulate.h | Modulate a family of marked MAPs by an environment chain |
| mmap_stats.h | Marked MAP statistics: embedded chains, class-transition probabilities, forward and cross moments, counting means and covariances |
| mmapph1fcfs.h | The MMAP[K]/PH[K]/1 FCFS queue: per-class mean number in system and per-class queue-length distribution |
| mmdp_isfeasible.h | Feasibility predicate for a Markov-modulated deterministic process |
| mmpp2_fit.h | MMPP(2) matching three moments and the lag-1 autocorrelation (matlab/lib/kpctoolbox/mmpp/mmpp2_fit.m) |
| mmpp2_fit1.h | MAP(2) matching mean, SCV, skewness and the index of dispersion for counts (matlab/lib/kpctoolbox/mmpp/mmpp2_fit1.m) |
| mmpp2_fit2.h | MMPP(2) matching mean, SCV, skewness and the autocorrelation decay rate (matlab/lib/kpctoolbox/mmpp/mmpp2_fit2.m) |
| mmpp2_fit3.h | MMPP(2) matching three moments and the autocorrelation decay rate (matlab/lib/kpctoolbox/mmpp/mmpp2_fit3.m) |
| mmpp2_fit4.h | MMPP(2) matching mean, SCV, skewness and the lag-1 autocorrelation (matlab/lib/kpctoolbox/mmpp/mmpp2_fit4.m) |
| mmpp2_fitc.h | MMPP(2) matching counting-process characteristics (matlab/lib/kpctoolbox/mmpp/mmpp2_fitc.m) |
| mmpp2_fitc_approx.h | MMPP(2) fitted to counting-process characteristics by optimization (matlab/lib/kpctoolbox/mmpp/mmpp2_fitc_approx.m) |
| qbd_bmapbmap1.h | Level blocks of a BMAP/MAP/1 queue: batch Markovian arrivals against a single-departure MAP service process |
| qbd_depproc.h | Departure process of a MAP/MAP/1 queue: the ETAQA-truncated MAP descriptor under FCFS and under PS, and the joint moments of consecutive inter-departure times |
| qbd_mapmap1.h | The MAP/MAP/1 queue solved as a quasi-birth-death process |
| qbd_r.h | Quasi-birth-death processes: the rate matrix R, the fundamental matrix G, the caudal characteristic, and the stationary distribution |
| qbd_rap.h | Quasi-birth-death processes with rational arrival process components, and the RAP/RAP/1 queue built on top of them |
| qbd_setupdelayoff.h | Mean queue length of an M/M/1 queue with a setup delay and a delayed-off period, solved as a QBD |
| mapqn | |
| mapqn_amva.h | Horizontal-cut mean value analysis for a MAP server (SolverMVA method 'amva.mapqn') |
| mapqn_bnd_lr.h | General linear-reduction (LR) bound on the utilization of one queue-phase of a closed MAP queueing network |
| mapqn_bnd_lr_mva.h | MVA-shaped linear-reduction bound for a closed network of M - 1 exponential queues and ONE MAP queue |
| mapqn_bnd_lr_pf.h | Linear-reduction (LR) bound on the utilization of one station of a closed product-form network |
| mapqn_bnd_qr.h | General quadratic-reduction (QR) bound on the utilization of one queue-phase of a closed MAP queueing network |
| mapqn_bnd_qr_delay.h | Quadratic-reduction bound for a MAP queueing network with a delay (think time) station |
| mapqn_bnd_qr_ld.h | Quadratic-reduction bound on a marginal of a load-dependent MAP queueing network |
| mapqn_p1_common.h | The variable layout and the constraint families shared by the two reductions that carry singly-indexed probabilities: the linear reduction (mapqn_bnd_lr.m) and the general quadratic reduction (mapqn_bnd_qr.m) |
| mapqn_params.h | Model parameters and variable indexing shared by the mapqn QR bounds |
| mapqn_qr_bounds_bas.h | Quadratic-reduction bound on the utilization of one queue of a closed MAP queueing network with a FINITE-CAPACITY station under blocking-after-service |
| mapqn_qr_bounds_rsrd.h | Quadratic-reduction bound on the utilization of one queue of a closed MAP queueing network under RS-RD blocking (repetitive service, random destination) |
| mapqn_qr_common.h | The constraint families of the quadratic-reduction (QR) polytope |
| mapqn_qrf_bas_nlp.h | qrf_bas_mmi, qrf_bas_mem and qrf_bas_bethe: the nonlinear bounds on the BAS-BLOCKING polytope |
| mapqn_qrf_common.h | Shared machinery of the QRF nonlinear bounds (qrf_noblo_*, qrf_bas_*) |
| mapqn_qrf_noblo.h | The QRF no-blocking nonlinear bounds: qrf_noblo_mmi, qrf_noblo_mem and the load-dependent qrf_noblo_mmi_ld |
| mapqn_solution.h | The result of a MAPQN linear or nonlinear bound program |
| mc | |
| ctmc_bicgstab.h | Preconditioned stabilized biconjugate gradients, for the linear systems a generator produces |
| ctmc_courtois.h | Courtois decomposition of a nearly completely decomposable (NCD) CTMC |
| ctmc_fau.h | Transient distribution of a CTMC by fast adaptive uniformization |
| ctmc_foxglynn.h | Transient distribution of a CTMC by uniformization with Fox-Glynn Poisson weights |
| ctmc_gmres.h | Restarted GMRES with an ILUT preconditioner, for the linear systems a generator produces |
| ctmc_gmres_multi.h | Restarted GMRES for a block of right-hand sides sharing one coefficient matrix |
| ctmc_isfeasible.h | Feasibility predicates for generators and stochastic matrices |
| ctmc_kms.h | Koury-McAllister-Stewart aggregation-disaggregation for a nearly completely decomposable CTMC |
| ctmc_memory_gate.h | Host-aware memory pre-gate for SolverCTMC |
| ctmc_multi.h | Two-level multigrid aggregation-disaggregation for a nearly completely decomposable CTMC |
| ctmc_passage.h | First passage times into a target STATE SET, for Markov and semi-Markov chains |
| ctmc_pseudostochcomp.h | Pseudo stochastic complement of a CTMC partition |
| ctmc_rand.h | Random infinitesimal generator of a CTMC |
| ctmc_randomization.h | Uniformization (randomization) of a CTMC: the embedded DTMC P = I + Q/q |
| ctmc_relsolve.h | Equilibrium distribution relative to a reference state |
| ctmc_saddlepoint.h | Saddlepoint approximation of Pr{N(t)=k} for the counting process of a MAP |
| ctmc_sens.h | Sensitivity of the steady-state distribution of a CTMC to a scalar parameter |
| ctmc_simulate.h | Sample path of a continuous-time Markov chain given its generator |
| ctmc_solve.h | Steady-state distribution of a continuous-time Markov chain |
| ctmc_solve_reducible.h | Limiting distribution of a CTMC whose generator may be reducible |
| ctmc_solve_reducible_blkdecomp.h | Limiting distribution of a reducible CTMC by direct block decomposition of the generator |
| ctmc_state_space_logsize.h | Worst-case log-size of the CTMC state space induced by a NetworkStruct |
| ctmc_stmonotone.h | Stochastically monotone upper bound of a Markov chain |
| ctmc_takahashi.h | Takahashi's aggregation-disaggregation for a nearly completely decomposable CTMC |
| ctmc_testpf_kolmogorov.h | Kolmogorov reversibility criterion, used as a product-form test |
| ctmc_timereverse.h | Time-reversed generator and transition matrix |
| ctmc_transient.h | Transient distribution of a CTMC over a time interval, by integrating the forward equations d pi/dt = pi Q |
| ctmc_transient_sens.h | Sensitivity of the transient distribution of a CTMC to a scalar parameter |
| ctmc_uniformization.h | Transient distribution of a CTMC by uniformization (Jensen's method), and the time-averaged distribution over [0, t] |
| dtmc_makestochastic.h | Normalize a non-negative matrix into a stochastic transition matrix |
| dtmc_rand.h | Random DTMC kernels, trajectory simulation and the weak-component split |
| dtmc_solve.h | Equilibrium distribution of a discrete-time Markov chain, and stochastic complementation |
| dtmc_solve_reducible.h | Limiting distribution of a discrete-time Markov chain whose transition matrix may be reducible |
| dtmc_stochcomp.h | Stochastic complement of a DTMC partition, a port of matlab/lib/kpctoolbox/mc/dtmc_stochcomp.m |
| dtmc_transient.h | Discrete-time transient distributions, hitting times and uniformization |
| stronglyconncomp.h | Strongly connected components of a directed graph, and which of them are recurrent (closed under the successor relation) |
| mdd | |
| mdd.h | Quasi-reduced ordered Multi-valued Decision Diagram |
| mdd_closedqn.h | Exact solve of a single-class closed exponential queueing network whose CTMC state space (reachable occupancy vectors) is stored in a Multi-valued Decision Diagram instead of an explicit state list |
| mdd_descriptor.h | Kronecker rate descriptor of a single-class closed queueing network |
| mdd_mcd.h | Miner-Ciardo-Donatelli approximate stationary analysis |
| mdd_ps.h | Kronecker rate descriptor for shared-server stations with phase-type service |
| mdd_reachset.h | Reachability set generation into a decision diagram |
| mdd_rec.h | MDD-rec: the normalising constant of a product-form model whose reachable set is held in a decision diagram |
| mdd_types.h | The rate side of the decision-diagram domain: local matrices, events, the Kronecker descriptor, and the options/result of the level aggregation |
| me | |
| me_cqn.h | Maximum-entropy algorithm for closed multiclass queueing networks |
| me_gegec_mql.h | Mean queue length of a stable infinite-capacity GE/GE/c/FCFS queue |
| me_gegecn.h | Censored GE/GE/c/K;N queue by entropy maximisation |
| me_gegecn_pb.h | Blocking probability seen by ONE arrival stream of a censored GE/GE/c/K;N queue |
| me_mqn.h | Maximum-entropy algorithm for mixed open/closed multiclass networks |
| me_oqn.h | Maximum-entropy algorithm for open multiclass queueing networks |
| me_oqn_blk.h | Maximum Entropy algorithm for single-class OPEN networks with FINITE BUFFERS, under loss or transfer blocking |
| me_types.h | Shared declarations for the maximum-entropy (Kouvatsos) queueing network algorithms |
| mmdp | |
| mmdp.h | Markov-modulated deterministic process (MMDP), for fluid queues |
| moment | |
| moment_apply.h | Shared helper applying a triangular moment-transform table |
| moment_binomial_from_factorial.h | Binomial moments from falling-factorial moments |
| moment_binomial_from_negbinomial.h | Binomial moments from negative-binomial moments |
| moment_binotrans.h | Binomial transform with alternating signs |
| moment_binotransinv.h | Inverse binomial transform |
| moment_central_from_raw.h | Central moments from raw moments |
| moment_cumulant.h | Cumulants from raw moments and the inverse, plus the factorial-cumulant pair |
| moment_factorial_from_binomial.h | Falling-factorial moments from binomial moments |
| moment_factorial_from_raw.h | Factorial moments from raw moments, via the signed Stirling table |
| moment_factorial_from_upfactorial.h | Falling-factorial moments from rising-factorial moments, via the Lah numbers |
| moment_housematrix.h | Conversion matrix of one edge of the house of moments |
| moment_joint.h | Joint moment conversions on the house of moments |
| moment_lah.h | Unsigned Lah numbers |
| moment_negbinomial_from_binomial.h | Negative-binomial moments from binomial moments |
| moment_negbinomial_from_upfactorial.h | Negative-binomial moments from rising-factorial moments |
| moment_raw_from_central.h | Raw moments from central moments and the mean |
| moment_raw_from_factorial.h | Raw moments from factorial moments, via the Stirling table of the second kind |
| moment_raw_from_upfactorial.h | Raw moments from rising-factorial moments |
| moment_stirling1.h | Signed Stirling numbers of the first kind |
| moment_stirling2.h | Stirling numbers of the second kind |
| moment_stirlingcycle.h | Unsigned Stirling numbers of the first kind (cycle numbers), orders 0..n |
| moment_tail.h | Binomial moments from tail moments and the inverse |
| moment_tensor.h | Joint moment arrays and the mode products used by every joint conversion |
| moment_upfactorial_from_factorial.h | Rising-factorial moments from falling-factorial moments, via the Lah numbers |
| moment_upfactorial_from_negbinomial.h | Rising-factorial moments from negative-binomial moments |
| moment_upfactorial_from_raw.h | Rising-factorial moments from raw moments, via the cycle numbers |
| npfqn | |
| 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 |
| perm | |
| perm_approx.h | APPROXIMATE permanents: the Sinkhorn heuristic, the Bethe estimate and the saddle-point expansion |
| perm_sampling.h | RANDOMIZED permanents: the AdaPart rejection sampler and the Huber-Law acceptance-rejection importance sampler |
| permanent.h | The PERMANENT of a matrix, exactly, by four algorithms |
| pfqn | |
| cd_peak_scaling.h | Peak of a class-dependence handle over the reachable population lattice |
| infradius_h.h | Integrands of the Norlund-Rice inversion of the normalizing constant, in their two changes of variable |
| laplaceapprox.h | Laplace approximation of a multidimensional integral around a given point |
| pas_placement.h | Placement order of a pass-and-swap (P&S) order-independent network |
| pas_swap2order.h | Global placement-order DAG of a closed two-station pass-and-swap tandem |
| pfqn_ab_amva.h | Akyildiz-Bolch approximate MVA for multi-server BCMP networks |
| pfqn_aghq.h | Adaptive Gauss-Hermite quadrature of the simplex factor of the McKenna-Mitra integral |
| pfqn_amva_common.h | Scaffolding shared by the approximate-MVA family |
| pfqn_aql.h | Aggregate Queue Length (AQL) approximate MVA |
| pfqn_asympt_common.h | Shared scalar machinery for the integration / asymptotic members of the pfqn family (pfqn_le, pfqn_lap, pfqn_ls, pfqn_cub, pfqn_kt, pfqn_panacea, the McKenna-Mitra quadratures, pfqn_nrl / pfqn_nrp) |
| pfqn_bk.h | Birman-Kogan asymptotic evaluation of closed networks with many stations |
| pfqn_bkt.h | Knessl-Tier expansion with the Stirling-remainder correction (BKT) |
| pfqn_ble.h | Logistic expansion with the eps->0 bias correction (BLE) |
| pfqn_bs.h | Bard-Schweitzer approximate MVA |
| pfqn_busyp.h | Mean busy period of order n for a subnetwork of a product-form network |
| pfqn_busyp_clw.h | Busy period of a subnetwork from point evaluations of the normalizing constant |
| pfqn_busyp_multiclass.h | Multichain generalization of pfqn_busyp |
| pfqn_ca.h | Convolution algorithm for the exact normalizing constant of a closed product-form network (Buzen 1973, Reiser-Kobayashi 1975) |
| pfqn_cbh.h | Convolutional Bound Hierarchy (Dowdy, Eager, Gordon and Saxton 1984) on the throughput of a single-class closed product-form network |
| pfqn_cdfun.h | AMVA-QD class-dependence function |
| pfqn_cftp.h | Perfect stationary state sampling for closed single-class multiserver product-form networks, by monotone Coupling From The Past |
| pfqn_chow.h | Chow Second Approximation (SA) approximate MVA |
| pfqn_clust.h | De Souza e Silva-Lavenberg-Muntz Clustering Approximation (CA) |
| pfqn_clw.h | Choudhury-Leung-Whitt normalization constant by numerical inversion of the generating function (JACM 42(5):935-970, 1995), and its limited load-dependent extension through the per-center transforms of Bertozzi and McKenna (SIAM Review 35(2):239-268, 1993) |
| pfqn_clwjd.h | Normalizing constant of a closed network of LIMITED JOINT-DEPENDENT (LJD) stations plus one aggregated delay, by numerical inversion of the multichain generating function (Choudhury-Leung-Whitt, J |
| pfqn_clwoi.h | Normalizing constant of a closed network of ORDER-INDEPENDENT (OI) stations plus one aggregated delay, by numerical inversion of the multichain generating function (Choudhury-Leung-Whitt, J |
| pfqn_cntol.h | Chandy-Neuse population-scaled termination cutoff for approximate MVA |
| pfqn_comb_common.h | Integer-composition enumeration shared by the CoMoM and MVAC ports |
| pfqn_comom.h | CoMoM (class-oriented method of moments), the general basis formulation, and the original repairman-model implementation that preceded pfqn_comomrm |
| pfqn_comomrm.h | CoMoM (class-oriented method of moments) for the finite repairman model: one queueing station of multiplicity m plus a delay |
| pfqn_comomrm_ld.h | CoMoM for the repairman model with an arbitrary LOAD-DEPENDENT rate lattice at the single queueing station |
| pfqn_comomrm_ms.h | CoMoM for the MULTISERVER repairman model: one queueing station with S servers (optionally replicated m times), plus a delay |
| pfqn_conv.h | Multichain convolution algorithm with class-dependent service rates (Sauer 1983, "Computational Algorithms for State-Dependent Queueing Networks", ACM TOCS 1(1):67-92, Section 5.2) |
| pfqn_conwayms.h | Conway's multiserver Linearizer for chain-dependent FCFS queues (Conway 1989, "Fast Approximate Solution of Queueing Networks with Multi-Server Chain-Dependent FCFS Queues") |
| pfqn_cub.h | Normalizing constant by Grundmann-Moeller cubature over the simplex |
| pfqn_cub_evals.h | Integrand-evaluation count of pfqn_cub, and the budget pfqn_nc prices it against |
| pfqn_cyclet_ofree.h | Exact passage-time law along an OVERTAKE-FREE PATH of a closed single-chain tree-like product-form network |
| pfqn_dac.h | Distribution Analysis by Chain (de Souza e Silva, UCLA CSD-870023, 1987): the JOINT queue-length distribution of a closed product-form network with single-server, infinite-server and queue-dependent centers |
| pfqn_dmlin.h | De Souza e Silva-Muntz Improved Linearizer (IL) |
| pfqn_dnc.h | Distinct-load Normalizing Constant (DNC) at a nonintegral population |
| pfqn_egflinearizer.h | Extended generalized fixed-point Linearizer (De Souza e Silva and Muntz's generalization of Chandy and Neuse's Linearizer, with a per-class scaling exponent alpha_r) |
| pfqn_expand.h | Expand per-station metrics from a reduced model back to the original station set |
| pfqn_explicit.h | Explicit closed-form normalizing constant of a multiclass closed network |
| pfqn_explicit_ld.h | Explicit closed-form normalizing constant of a multiclass LIMITED LOAD-DEPENDENT network |
| pfqn_fnc.h | Load-dependent rates of the functional server f(n) = n + c |
| pfqn_gerasimov.h | Gerasimov's residue (closed-form) normalizing constant, generalized to R classes |
| pfqn_gflinearizer.h | Generalized fixed-point Linearizer with a single scaling exponent shared by every class (De Souza e Silva and Muntz) |
| pfqn_gld.h | Exact normalizing constant of a closed product-form network whose stations may be load dependent (generalized Buzen, Reiser-Kobayashi 1975) |
| pfqn_gldsingle.h | Exact normalizing constant of a SINGLE-CLASS closed network whose stations are load dependent |
| pfqn_grnmol.h | Normalizing constant by the closed-form Grundmann-Moeller rule |
| pfqn_harel_bounds.h | Harel-Namn-Sturm throughput bounds for a single-class closed network |
| pfqn_hst.h | Operational sensitivity of throughput to homogeneous-service-time (HST) violations, and the constrained worst case (Suri 1983) |
| pfqn_is.h | Importance-sampling estimate of the normalizing constant of a closed LOAD-INDEPENDENT product-form network |
| pfqn_jdfun.h | AMVA joint-dependence function for non-product-form scaling |
| pfqn_joint.h | Joint queue-length probability of a closed product-form network |
| pfqn_jointmarg.h | Joint probability of the per-station TOTAL queue lengths |
| pfqn_kt.h | Knessl-Tier asymptotic expansion of the normalizing constant |
| pfqn_lap.h | Laplace approximation of the normalizing constant of a repairman (single-queue, multiclass) model |
| pfqn_lcfsqn_ca.h | Convolution algorithm for the two-station multiclass LCFS queueing network of Casale, "A family of multiclass LCFS queueing networks with order-dependent product-form solutions", QUESTA 2026 |
| pfqn_lcfsqn_mva.h | Exact mean value analysis of the two-station multiclass LCFS network of Casale, QUESTA 2026 (station 1 LCFS, station 2 LCFS-PR) |
| pfqn_lcfsqn_nc.h | Normalizing constant of the two-station multiclass LCFS network as a sum of PERMANENTS, the closed form of Casale, QUESTA 2026 |
| pfqn_lcp.h | Bard Large Customer Population (LCP) approximate MVA |
| pfqn_ld_is.h | Importance-sampling estimate of the normalizing constant of a closed LOAD-DEPENDENT product-form network |
| pfqn_ldbcmp.h | Anselmi-Cremonesi (2008) lower throughput bound for a closed single-class BCMP network with load-dependent stations |
| pfqn_ldmx_ec.h | Bruell-Balbo-Afshari effective-capacity terms for a MIXED open/closed network with limited load dependence |
| pfqn_le.h | Logistic expansion (LE) asymptotic approximation of the normalizing constant of a closed product-form network |
| pfqn_lekt.h | The common corrected asymptotic expansion (LE-KT), computed on the cheaper side |
| pfqn_linearizer.h | Chandy-Neuse Linearizer for single-server stations |
| pfqn_linearizerms.h | Multiserver Linearizer (Krzesinski's Linearizer as described in Conway 1989, with De Souza e Silva and Muntz's presentation of the marginal-probability recursions) |
| pfqn_linearizermx.h | Linearizer for mixed open/closed queueing networks |
| pfqn_lldfun.h | AMVA-QD limited-load-dependence function |
| pfqn_lldsingle.h | Exact normalizing constant of a SINGLE-CLASS closed network whose stations are LIMITED load dependent, i.e |
| pfqn_looping.h | Eager Looping bounds for closed multiclass product-form networks |
| pfqn_ls.h | Logistic-sampling estimate of the normalizing constant of a closed product-form network |
| pfqn_manjunath.h | Exact normalizing constant of a closed multiclass product-form network whose state space carries arbitrary linear integer constraints (Manjunath-Sikdar) |
| pfqn_marie.h | Marie's iterative aggregation-decomposition for closed networks with FCFS general (Coxian) service |
| pfqn_mc_common.h | Randomness scaffolding shared by the Monte Carlo normalizing-constant estimators (pfqn_mci, pfqn_is, pfqn_ld_is, pfqn_oi_is, pfqn_pas_is, pfqn_ls, pfqn_mmsample2) and by the perfect sampler pfqn_cftp |
| pfqn_mci.h | Monte Carlo Integration estimate of the normalizing constant of a closed product-form network (Ross, Wang and Yao; MonteQueue 2.0) |
| pfqn_mcmc.h | Chen-O'Cinneide REGULARIZATION: a Markov chain Monte Carlo estimator of the class throughputs X(r) = G(N-e_r)/G(N) and of the mean queue lengths Q(i,r) of a CLOSED multiclass product-form (BCMP, no type changes) network |
| pfqn_mcub.h | Kerola's multiclass composite bound (Perf |
| pfqn_mmint2.h | McKenna-Mitra integral form of the normalizing constant of a repairman model (one queueing station, R classes, per-class think time), in its three MATLAB quadratures |
| pfqn_mmsample2.h | Sampled McKenna-Mitra integral form of the normalizing constant of a repairman (single-queue plus delay) model |
| pfqn_momlin.h | Moment linearizer: approximate first and second queue-length moments of a large closed product-form network |
| pfqn_mu_ms.h | Aggregate load-dependent rate of m identical c-server FCFS stations |
| pfqn_mushift.h | Shift the load-dependent service-rate lattice of selected stations |
| pfqn_mva.h | Exact Mean Value Analysis for closed product-form networks (Reiser and Lavenberg 1980) |
| pfqn_mva_interval.h | Exact interval-valued MVA for single-class closed product-form networks |
| pfqn_mvac.h | MVAC: exact mean value analysis BY CHAIN of a closed multichain product-form network (Conway, de Souza e Silva and Lavenberg, IEEE Trans |
| pfqn_mvacld.h | MVAC for networks with queue-length dependent (QLD) service centers, the Section V extension of Conway, de Souza e Silva and Lavenberg (1989) |
| pfqn_mvajd.h | Joint-dependent name of pfqn_mvaoi: the mean-value analysis of a closed network whose station rates read the whole per-class occupancy vector |
| pfqn_mvams.h | Exact Mean Value Analysis for mixed open/closed networks with multiserver stations |
| pfqn_mvaoi.h | Mean-value analysis of a closed network with order-independent (OI) stations, the composition-dependent generalization of Conditional MVA |
| pfqn_mvaoi_marg.h | Exact marginal load-dependent MVA for a closed network of delay, load-independent and ANY number of order-independent (OI) stations |
| pfqn_mwrbb.h | Majumdar-Woodside robust box bounds on the per-class throughput of a closed multiclass network with mixed scheduling disciplines (Perf |
| pfqn_nc.h | Normalizing constant of a product-form queueing network: the dispatcher |
| pfqn_nc_sanitize.h | Preprocessing shared by the normalizing-constant solvers: drop the classes that cannot contribute, rescale the demands per class, and order the classes so that the zero-think-time ones come first |
| pfqn_ncjd.h | Joint-dependent name of pfqn_ncoi: the balance-function convolution of a closed network whose station rates read the whole per-class occupancy vector |
| pfqn_ncld.h | Normalizing constant of a LOAD-DEPENDENT closed network: the dispatcher |
| pfqn_ncldmx.h | Normalizing constant of a MIXED open/closed network with limited load dependence |
| pfqn_ncoi.h | Normalizing constant of a closed network of ORDER-INDEPENDENT (OI) / pass-and-swap stations with empty swap graph, plus one aggregated delay |
| pfqn_nintmva.h | Mean value analysis at a nonintegral population (fractional-base aMVA) |
| pfqn_nre.h | Norlund-Rice inversion of the normalizing constant on a SADDLE-TILTED contour, with a second-order Edgeworth correction |
| pfqn_nrl.h | Norlund-Rice inversion of the normalizing constant, in its logistic (NRL) and probit (NRP) substitutions |
| pfqn_oi_fnc.h | Order-independent (OI) functional server: the balance function Psi and the rate mu_f of an auxiliary station whose insertion turns the mean of a queue-dependent function into a ratio of normalizing constants |
| pfqn_oi_insvc.h | Conditional mean number of IN-SERVICE jobs per class at an order-independent station |
| pfqn_oi_is.h | Importance-sampling estimate of the normalizing constant of a closed two-station order-independent (OI) tandem |
| pfqn_pam.h | Hsieh-Lam Proportional Approximation Methods (PAMB / PAMI / PAMT) |
| pfqn_panacea.h | PANACEA normal-usage asymptotic expansion of the normalizing constant (Ramakrishnan and Mitra, BSTJ 61(10):2849-2872, 1982) |
| pfqn_panaceald.h | PANACEA normal-usage asymptotic expansion for LOAD-DEPENDENT closed networks (Mitra and McKenna, JACM 33(3):568-592, 1986) |
| pfqn_pas_is.h | Importance-sampling estimate of the normalizing constant of a single communicating class of a cyclic two-station pass-and-swap (P&S) network with swap graph H |
| pfqn_pas_nc.h | Normalizing constant G_C of one communicating class of a closed PASS-AND-SWAP (P&S) network, plus one aggregated delay |
| pfqn_pbh.h | Performance Bound Hierarchy (Eager and Sevcik 1983, ACM TOCS 1(2):99-115) for single-class closed product-form networks, and the two iterative families that are defined in terms of it |
| pfqn_perm.h | Permanent of a matrix with repeated columns, by Ryser's formula |
| pfqn_pff_delay.h | Product-form factor of a delay station |
| pfqn_procomom.h | ProCoMoM: marginal queue-length probabilities of a closed multiclass product-form network by the class-oriented method of moments |
| pfqn_propfair.h | Proportionally fair allocation estimate of the normalizing constant (Schweitzer 1979; Walton, "Proportional fairness and its relationship with multi-class queueing networks", 2009) |
| pfqn_qdamva.h | QD-AMVA: queue-dependent approximate mean value analysis |
| pfqn_qdlin.h | QD-LIN: the Linearizer arm of AMVA-LD, on a plain demand matrix |
| pfqn_qlen_joint_moments.h | Joint moments of the queue-length vector of a closed product-form network, obtained from normalizing constants |
| pfqn_qsa.h | Queue-Shift Approximation (QSA) for closed product-form networks |
| pfqn_qzgblow.h | Geometric-bound lower bound on the queue length at station i |
| pfqn_qzgbup.h | Geometric-bound upper bound on the queue length at station i |
| pfqn_rd.h | Reduction heuristic (RD) for the normalizing constant of a closed LOAD-DEPENDENT product-form network |
| pfqn_recal.h | RECAL (REcursive CALculation) for the exact normalizing constant of a closed product-form network (Conway and Georganas 1986) |
| pfqn_respt_ps_moments.h | Sojourn-time moments at the processor-sharing station of a closed terminal-driven system (Mitra and Morrison 1983) |
| pfqn_rgf.h | Recursion by Generating Functions (RGF) for the normalizing constant of a SINGLE-CLASS closed product-form network with replicated stations |
| pfqn_rgfmc.h | Multiclass Recursion by Generating Functions (RGF), with think times |
| pfqn_scat.h | Neuse-Chandy SCAT (Self-Correcting Approximation Technique) approximate MVA |
| pfqn_scb.h | Dowdy-Carlson-Krantz-Tripathi (1992) single-class bounds of multi-class queueing networks, J |
| pfqn_schmidt.h | Schmidt's MVA for closed networks with general scheduling disciplines and class-dependent multiserver FCFS stations |
| pfqn_schmidt_ext.h | Extended Schmidt MVA with queue-aware alpha corrections |
| pfqn_sdr.h | Product-form state-dependent routing |
| pfqn_sens.h | Exact analytic derivatives of the mean performance measures {X,Q,U,R} of a closed product-form (BCMP) network with respect to the demands L(i,r) and the think times Z(r) |
| pfqn_sens_ldmx_ec.h | Effective capacity terms of the mixed load-dependent MVA of Bruell-Balbo-Afshari, together with their exact derivatives with respect to the open-class load Lo(i) of each station |
| pfqn_sens_linearizer.h | Approximate moments E[Q_i], Var[Q_i], Cov[Q_i,Q_j], E[Q_i^2] and E[Q_i^3] of the per-station total queue lengths of a closed product-form network, by the LINEARIZER-2 / LINEARIZER-3 algorithms of Strelen (Performance Evaluation 11:127-142, 1990, Section 5) |
| pfqn_sens_mom.h | Exact moments E[Q], Var[Q], E[Q^2] and E[Q^3] of the grouped queue lengths of a closed product-form network, by second-order differentiation of the MVA recursion |
| pfqn_sens_mva.h | Exact per-station queue-length variances and covariances of a closed product-form network, by the MVA-like moment recursion of de Souza e Silva and Muntz (IEEE TC 37(9):1125-1129, 1988, Corollary 1) |
| pfqn_sens_mvaldmx.h | Exact queue-length variances and covariances of a mixed open/closed product-form network with limited load dependence, the load-dependent and mixed counterpart of pfqn_sens_mva |
| pfqn_sens_respt.h | Exact raw moments E[W^t], t = 1..3, of the sojourn time of a job at an FCFS b-server center of a closed product-form network |
| pfqn_sib.h | Successively Improving Bounds (Srinivasan 1985/1987) on the cycle time and throughput of a single-class closed product-form network |
| pfqn_simplex.h | Shared machinery for closures of the simplex factor of the McKenna-Mitra integral, used by pfqn_aghq.h |
| pfqn_sjn.h | Closed networks with non-preemptive shortest-job-next (SJN/SJF) stations |
| pfqn_sqni.h | Square-root non-iterative (SQNI) approximation for a single queueing station with per-class delay |
| pfqn_ssd.h | Server-Station Disaggregation bounds for a multiserver closed network (Dallery and Suri, SIGMETRICS 1986) |
| pfqn_stdf.h | Sojourn-time distribution at multiserver FCFS stations of a closed product-form network (J |
| pfqn_stdf_heur.h | Heuristic sojourn-time distribution at multiserver FCFS stations, a variant of J |
| pfqn_tay.h | Tay's arrival-instant approximate MVA |
| pfqn_unique.h | Station consolidation and its inverse: merge identical demand rows into one station with a multiplicity, and expand per-station results back |
| pfqn_wangsevcik.h | Two approximate MVA schemes: Queue-Line and Fraction-Line |
| pfqn_xia.h | Xia's asymptotic approximation of the normalizing constant of a load-dependent (multiserver) closed network |
| pfqn_xzabalow.h | Asymptotic-bound-analysis lower bound on throughput |
| pfqn_xzabaup.h | Asymptotic-bound-analysis upper bound on throughput |
| pfqn_xzgsblow.h | Geometric-square-root bound, lower bound on throughput |
| pfqn_xzgsbup.h | Geometric-square-root bound, upper bound on throughput |
| polling | |
| polling_qsys_1limited.h | Mean waiting times in polling systems: 1-limited and decrementing service |
| polling_qsys_exhaustive.h | Mean waiting times of a polling system under exhaustive service |
| qsys | |
| qsys_bmapm1.h | BMAP/M/1 by the matrix-analytic (M/G/1-type) method |
| qsys_bmapphnn_retrial.h | The BMAP/PH/N/N bufferless retrial queue with flexible retrial admission control |
| qsys_dmc.h | D/M/c: deterministic interarrival times, exponential service |
| qsys_gg1.h | G/G/1 dispatcher: exact where a two-moment description determines the answer, Allen-Cunneen otherwise |
| qsys_ggingi_tga.h | Truncated Gaussian approximation (TGA-G) for the G/GI/n+GI queue |
| qsys_ggisgi_fluid.h | Steady state of the G/GI/s+GI fluid model |
| qsys_ggnm_diffusion.h | Diffusion approximation for the G/GI/n/m queue |
| qsys_gig1_approx_allencunneen.h | Allen-Cunneen approximation of the mean response time of a G/I/G/1 queue |
| qsys_gig1_approx_gelenbe.h | Gelenbe diffusion approximation with instantaneous-return boundary |
| qsys_gig1_approx_heyman.h | Heyman approximation of the mean response time of a G/I/G/1 queue |
| qsys_gig1_approx_kimura.h | Kimura diffusion-interpolation approximation for the G/I/G/1 queue |
| qsys_gig1_approx_klb.h | Kraemer and Langenbach-Belz approximation for the G/I/G/1 queue |
| qsys_gig1_approx_kobayashi.h | Kobayashi diffusion approximation for the G/I/G/1 queue |
| qsys_gig1_approx_marchal.h | Marchal approximation of the mean response time of a G/I/G/1 queue |
| qsys_gig1_approx_myskja.h | Myskja's third-moment approximation of the mean response time of a G/I/G/1 queue |
| qsys_gig1_approx_myskja2.h | Myskja's enhanced third-moment approximation of the mean response time of a G/I/G/1 queue |
| qsys_gig1_approx_whitt.h | Whitt's approximation of the G/G/1 mean response time |
| qsys_gig1_bnds_extremal.h | Extremal two-moment bounds for the GI/GI/1 queue |
| qsys_gig1_lbnd.h | Fundamental lower bound on the mean response time of a G/G/1 queue |
| qsys_gig1_rq.h | Robust Queueing (RQ) approximation of a G/GI/1 queue characterized by its arrival index of dispersion and the first two service moments |
| qsys_gig1_rqt.h | Robust Queueing Theory (RQT) worst-case system time of a G/G/1 FCFS queue, the single-server case of qsys_gigk_rqt (Theorem 2 and eq |
| qsys_gig1_ubnd_kingman.h | Kingman upper bound on the mean waiting time of a G/G/1 queue |
| qsys_gigk_approx.h | Default G/I/G/k approximation of the mean response time |
| qsys_gigk_approx_cosmetatos.h | Cosmetatos / Page interpolation approximation for the GI/G/k queue |
| qsys_gigk_approx_kingman.h | Kingman (Lee-Longton) scaling of the exact M/M/k waiting time |
| qsys_gigk_approx_whitt.h | Whitt (1993) approximation for the GI/G/k queue, eqs |
| qsys_gigk_rqt.h | Robust Queueing Theory (RQT) worst-case system time of a G/G/k FCFS queue |
| qsys_gigk_rqt_gamma.h | Service variability parameter of the Robust Queueing Theory (RQT) framework |
| qsys_gm1.h | Exact mean response time of the G/M/1 queue |
| qsys_gtmtst_fluid.h | The Gt/Mt/st+GI many-server fluid queue, and the network of them |
| qsys_hh1_lindley.h | Conditional waiting-time moments of the Hl/Hn/1 Lindley recursion |
| qsys_ldps_workload.h | Stationary distribution of the unfinished work in a single-stage load-dependent generalized-processor-sharing station with Poisson arrivals and blocking |
| qsys_lindley_moment.h | One conditional Lindley moment for exponential primitives |
| qsys_mapd1.h | The MAP/D/1 FCFS queue: deterministic service of length s fed by a Markovian arrival process |
| qsys_mapdc.h | The MAP/D/c FCFS queue: c servers, deterministic service of length s, fed by a Markovian arrival process |
| qsys_mapg1.h | The MAP/G/1 FCFS queue, by moment-matching the general service time to a phase-type distribution |
| qsys_mapg1k.h | The MAP/G/1/K queue with tail drop: Markovian arrivals, an arbitrary service law F, and a buffer of K packets counting the one in transmission |
| qsys_mapg1k_perflow.h | Per-flow throughput and loss ratio of a tail-drop FIFO buffer fed by N flows of mutually different statistical character |
| qsys_mapm1.h | The MAP/M/1 FCFS queue, the single-server case of MAP/M/c |
| qsys_mapmap1.h | The MAP/MAP/1 FCFS queue: mean number in system, waiting time, sojourn time, utilization and the queue-length distribution |
| qsys_mapmc.h | The MAP/M/c FCFS queue: c identical exponential servers of rate mu fed by a Markovian arrival process |
| qsys_mapph1.h | The MAP/PH/1 FCFS queue |
| qsys_mapphc.h | The MAP/PH/c FCFS queue, solved exactly |
| qsys_maxima_twomoment.h | Two-moment approximation for the maximum of n iid non-negative variables |
| qsys_mdc_crommelin.h | M/D/c by Crommelin's embedded chain |
| qsys_mg1.h | Exact mean response time of the M/G/1 queue (Pollaczek-Khinchine) |
| qsys_mg1_fb.h | M/G/1 under FB (feedback), also called LAS (least attained service) |
| qsys_mg1_lrpt.h | M/G/1 under LRPT (longest remaining processing time) |
| qsys_mg1_prio.h | M/G/1 with non-preemptive head-of-line priorities: per-class mean response times from the Cobham/Kleinrock formula |
| qsys_mg1_ps.h | Sojourn-time distribution of the M/G/1 processor-sharing queue |
| qsys_mg1_psjf.h | M/G/1 under PSJF (preemptive shortest job first) |
| qsys_mg1_setf.h | M/G/1 under SETF (shortest elapsed time first), the non-preemptive counterpart of FB/LAS |
| qsys_mg1_srpt.h | M/G/1 under SRPT (shortest remaining processing time), by the Schrage-Miller formula |
| qsys_mg1k_loss.h | Exact M/G/1/K loss probability, via the chain embedded at service-start epochs |
| qsys_mg1k_loss_mgs.h | MacGregor Smith's closed-form approximation of the M/G/1/K loss probability |
| qsys_mginf.h | Exact solution of the M/G/infinity queue |
| qsys_mgisrgi_whitt.h | Engineering solution of the call-center model M/GI/s/r+GI |
| qsys_mm1.h | Exact mean response time of the M/M/1 queue |
| qsys_mm1_dps.h | Multiclass M/M/1 under DPS (discriminatory processor sharing), solved numerically on the truncated population chain |
| qsys_mm1_lindley.h | Conditional waiting-time moments of the M/M/1 Lindley recursion |
| qsys_mm1_ps.h | Exact sojourn-time moments of the multiclass M/M/1-PS queue |
| qsys_mm1_tandem_lindley.h | Conditional waiting time at the SECOND station of an M/M/1 -> /M/1 tandem |
| qsys_mm1k_loss.h | Blocking probability of the M/M/1/K queue |
| qsys_mmapg1k.h | Exact per-class throughput and loss ratio of an MMAP[K]/G/1/K tail-drop queue |
| qsys_mmapgk1.h | The MMAP[K]/G[K]/1 FCFS queue: K customer types with class-dependent GENERAL service, fed by a marked Markovian arrival process |
| qsys_mmcc_retrial_fp.h | Fixed-point approximation for the M/M/c/c retrial queue |
| qsys_mmck.h | Exact analysis of the M/M/c/K queue (truncated Erlang form) |
| qsys_mmk.h | Exact mean response time of the M/M/k queue (Erlang-C) |
| qsys_mmk_qed.h | Halfin-Whitt QED approximation for the M/M/s queue, and the square-root staffing rule that inverts it |
| qsys_mtginf.h | Exact time-varying analysis of the Mt/G/infinity queue |
| qsys_mtgs0_mol.h | Modified-offered-load and pointwise-stationary approximations for a time-varying multiserver system |
| qsys_mxm1.h | M^X/M/1: the batch-arrival queue with exponential service |
| qsys_phm1.h | Exact PH/M/1, the GI/M/1 queue with phase-type interarrival times |
| qsys_phmc.h | Exact PH/M/c by Neuts' matrix-geometric method |
| qsys_phph1.h | The PH/PH/1 FCFS queue |
| qsys_quadrature.h | Adaptive quadrature for the qsys functions whose MATLAB originals call integral(), and the cumulative trapezoid rule for the one that calls cumtrapz() |
| qsys_tandem_lindley.h | Sample-path Lindley recursion along a tandem of single-server FCFS queues |
| qsys_tandem_ub_ciucu.h | Tail bounds for a GI/Hn/1 -> |
| qsys_types.h | Shared return type and arithmetic helpers for the templated qsys port |
| retrieval | |
| cache_retrieval_inputs.h | Extract the delayed-hit retrieval-algorithm inputs from a NetworkStruct, a port of matlab/src/api/retrieval/cache_retrieval_inputs.m |
| retrieval_fpi.h | Fixed-point heuristic for a delayed-hit (list-based) cache |
| retrieval_fpi_latency.h | FPI-based approximation of the delayed-hit count and the expected latency of a list-based cache with a phase-type retrieval system |
| retrieval_metrics.h | Exact miss, hit and delayed-hit metrics of a delayed-hit (list-based) cache |
| retrieval_mva.h | Exact MVA-style recursion for delayed-hit (list-based) cache metrics |
| retrieval_nc.h | Exact normalizing constant E(v,m) of a delayed-hit (list-based) cache |
| retrieval_rayint.h | Ray (WKB) asymptotic expansion of the list-based cache normalizing constant |
| sim | |
| sim_dist.h | Normal and Student t quantiles used by the output-analysis routines |
| sim_firquest.h | Fixed-sample-size quantile interval from independent replications |
| sim_fquest.h | Fixed-sample-size confidence interval for a steady-state quantile |
| sim_quest_heuristic_ci.h | Fallback interval used when a QUEST stage test fails |
| sim_quest_options.h | Options of the QUEST procedures, with the published FQUEST defaults |
| sim_runlength.h | Run-length planning for steady-state simulation |
| sim_shapirowilk.h | Shapiro-Wilk test for univariate normality |
| sim_sts_quantile_areas.h | Standardized time series areas of the batched quantile process |
| sim_types.h | Shared arithmetic helpers for the templated simulation output-analysis port |
| sim_vonneumann.h | Von Neumann ratio test for randomness of a sequence |
| sn | |
| sn_aggregate_chains.h | Collapse every chain onto one class, port of ModelAdapter.aggregateChains |
| sn_arrival_rate_fun.h | Port of matlab/src/api/sn/sn_arrival_rate_fun.m |
| sn_compat_rate.h | Total service rate of a station served by heterogeneous server pools with a class-compatibility graph, and the peak that normalizes its utilization |
| sn_fj_nodevisits_mmt.h | Post-MMT node visits of a fork-join model |
| sn_fj_visits_spn.h | Fork-join node visit ratios, via the auxiliary closed SPN |
| sn_gd_balance.h | Whittle balance check for a globally state-dependent rate scaling |
| sn_get_buffer_size.h | Physical buffer size of a station, in jobs, the one in service included |
| sn_has_bursty_arrival.h | Port of matlab/src/api/sn/sn_has_bursty_arrival.m |
| sn_has_classdep_routing.h | Port of matlab/src/api/sn/sn_has_classdep_routing.m |
| sn_is_discrete_time.h | Port of matlab/src/api/sn/sn_is_discrete_time.m |
| sn_is_phasetype.h | Whether a (D0, D1, ...) list is a valid phase-type / MAP representation |
| sn_join_droprate.h | Quorum joins: how many siblings a Join fires on, and what that drops |
| sn_map_modulation.h | Port of matlab/src/api/sn/sn_map_modulation.m |
| sn_node_metrics.h | Ports of matlab/src/api/sn/sn_get_node_arvr_from_tput.m and sn_get_node_tput_from_tput.m: the NODE-level arrival rate and throughput tables behind getAvgNode, getAvgNodeTable and the node chain getters |
| sn_nonmarkov_toph.h | Replace every non-Markovian service and firing law by a Markovian surrogate |
| sn_open_prob_terms.h | Open-class contribution to an aggregate state probability at one station |
| sn_patience_handles.h | Port of matlab/src/api/sn/sn_patience_handles.m |
| sn_pn_firing_rates.h | Ports of matlab/src/api/sn/sn_pn_firing_rates.m and sn_pn_avg_rates.m |
| sn_predicates.h | Ports of the sn_has_* / sn_is_* predicate family of matlab/src/api/sn |
| sn_print.h | Port of matlab/src/api/sn/sn_print.m, jline.api.sn.SnPrint and the python sn_print in api/sn/utils.py: the full debug dump of a NetworkStruct, one field: value line per field, matrices in the compact [a b; c d] form, integer-valued entries printed as integers |
| sn_print_routing_matrix.h | The human-readable form of sn.rtnodes: one line per positive (node, class) to (node, class) edge |
| sn_region_members.h | Port of matlab/src/api/sn/sn_region_members.m |
| sn_remove_class.h | Drop one job class from a model, port of ModelAdapter.removeClass |
| sn_routing_ergodic.h | Reducibility of a network's ROUTING, and the repair that makes it ergodic |
| sn_rt_stations.h | Port of matlab/src/api/sn/sn_rt_stations.m |
| sn_rtnodes_to_rtorig.h | Port of matlab/src/api/sn/sn_rtnodes_to_rtorig.m |
| sn_schedule_nominal.h | Port of matlab/src/api/sn/sn_schedule_nominal.m: unpack the MAPt or PHt slot of sn.proc at one (station, class) into the per-segment (D0, D1) pairs and their width-weighted time average |
| sn_setters.h | Ports of the sn_set_* family and of sn_refresh_process_fields (matlab/src/api/sn) |
| sn_state.h | Ports of matlab/src/api/sn/sn_get_state_aggr.m and sn_is_state_valid.m |
| sn_to_qrf_alpha.h | The QRF load-dependent rate scaling alpha(i,n), derived from an sn |
| sn_to_qrf_blocking.h | The QRF BAS blocking tables (f, MR, BB, MM, ZZ, MM1), derived from an sn |
| sn_validate.h | Consistency checks on a NetworkStruct, a port of jar/src/main/java/jline/api/sn/SnValidate.java and ValidationLevel.java |
| snc | |
| snc_bound_backlog.h | Violation probability of a backlog level |
| snc_bound_delay.h | Violation probability of a delay target |
| snc_conv.h | Min-plus convolution of two service envelopes (tandem concatenation) |
| snc_env_cpoisson.h | MGF arrival envelope of a compound Poisson flow with Exp job sizes |
| snc_env_map.h | MGF arrival envelope of a MAP/MMPP flow with unit-size jobs |
| snc_env_poisson.h | MGF arrival envelope of a Poisson flow with unit-size jobs |
| snc_env_tokenbucket.h | Deterministic token-bucket arrival envelope |
| snc_leftover.h | Leftover service envelope under blind (arbitrary) multiplexing |
| snc_mean_backlog.h | Upper bound on the mean backlog, from integrating the backlog tail bound |
| snc_mean_delay.h | Upper bound on the mean delay, from integrating the delay tail bound |
| snc_output.h | Output (departure) arrival envelope of a flow leaving a server |
| snc_perc_backlog.h | Backlog quantile at a prescribed violation probability |
| snc_perc_delay.h | Delay quantile at a prescribed violation probability |
| snc_srv_exp.h | MGF service envelope of an exponential server, in JOB units |
| snc_srv_rate.h | MGF service envelope of a constant-rate work-conserving server |
| snc_thetaopt.h | Minimizes a Chernoff bound over the free parameter theta |
| snc_types.h | Shared types of the stochastic network calculus domain |
| spn | |
| spn_conv.h | Convolution algorithm for the normalising constant of an S-invariant reachable product-form stochastic Petri net |
| spn_lpbnd.h | Linear-programming bounds on the mean marking and the throughputs of a stochastic timed Petri net |
| spn_mdd.h | Decision-diagram reachable set and Kronecker rate descriptor of a stochastic Petri net, so that mdd::mdd_mcd can analyse it |
| spn_metrics.h | Stationary measures of a product-form stochastic Petri net from the MDD-rec masses |
| spn_pf.h | Product form of a stochastic Petri net: decide whether one exists and derive the per-level factors g_l that mdd_rec and spn_metrics take as input |
| spn_rec_enabled.h | Enabling-degree distribution of one mode of a product-form stochastic Petri net, by the masked MDD-rec recursion |
| spn_sinvariants.h | Minimal-support S-invariants (P-invariants) of a stochastic Petri net, and the load vector V = S m0 |
| sum | |
| sum_closed.h | Summation method (SUM) and its extension (ESUM) for closed queueing networks, including non-product-form stations with generally distributed service times |
| sum_closing.h | Closing method for open and mixed non-product-form queueing networks, solved with the summation method |
| sym | |
| sage_rest_engine.h | SymEngine backed by the line-sage-rest service |
| sym_engine.h | Computer algebra operations LINE needs, as seen by this port |
| sym_engines.h | Resolves the symbolic backend to use, and owns the container that serves it |
| trace | |
| autocov.h | Sample autocovariance sequence of a trace, lags 0 |
| mtrace_backward_moment.h | Backward moments of a marked trace: the moments of the inter-arrival time that PRECEDES an event of each class, |
| mtrace_bootstrap.h | Block-bootstrap confidence intervals for the descriptors of a marked trace |
| mtrace_count.h | Per-class count process of a marked trace on a fixed resolution: the number of events of each class in the successive windows of length t that start at the first arrival epoch |
| mtrace_cov.h | Class-pair covariance matrices of a marked trace |
| mtrace_cross_moment.h | Class-pair cross moments of a marked trace: the k-th moment of the interval that separates an event of class i from the next event, of class j, |
| mtrace_forward_moment.h | Forward moments of a marked trace: the moments of the inter-arrival time that FOLLOWS an event of each class, |
| mtrace_iat2counts.h | Per-class counting processes of a marked trace: for each arrival, how many events of each class fall in the window of length scale that starts at that arrival |
| mtrace_joint.h | Class-dependent joint moments of a marked trace, |
| mtrace_mean.h | Per-type sample mean of a trace |
| mtrace_merge.h | Superposes two single-class traces into one marked trace, labelling the events of the first stream 1 and those of the second 2 |
| mtrace_moment.h | Empirical class-dependent moments of a marked trace |
| mtrace_moment_simple.h | Class-pair cross moments of a marked trace |
| mtrace_pc.h | Class probabilities of a marked trace, p_c = count_c / N |
| mtrace_sigma.h | One-step class transition frequencies of a marked trace, |
| mtrace_sigma2.h | Two-step class transition frequencies of a marked trace, |
| mtrace_split.h | Splits a marked trace into its per-class traces: for each class, the inter-arrival times BETWEEN CONSECUTIVE EVENTS OF THAT CLASS, with the first interval measured from the origin |
| mtrace_summary.h | Descriptor set of a marked trace: the first five raw moments of the inter-arrival times, the autocorrelation function, the first two forward and backward moments, the first two class-pair cross moments, the class probabilities and the one-step class transition frequencies |
| mtrace_var.h | Per-class variance of a marked trace |
| trace_acf.h | Autocorrelation coefficients of a trace at the requested lags |
| trace_bicov.h | Bicovariance of a trace on a lag grid |
| trace_gamma.h | Autocorrelation decay rate of a trace: the gamma of the geometric model rho(k) = rho0 * gamma^k, with rho0 = (1 - 1/scv)/2 fixed by the second moment and gamma fitted by least squares on the empirical acf |
| trace_iat2bins.h | Bins a trace on a fixed time grid: the number of arrivals falling in each interval ((i-1)*scale, i*scale], and the bin index of each arrival |
| trace_iat2counts.h | Counting process of a trace: the number of arrivals in the window of length scale that starts at each arrival epoch |
| trace_idc.h | Index of dispersion for counts, estimated by its asymptotic equality with the index of dispersion for intervals at a large aggregation level |
| trace_idi.h | Index of dispersion for intervals, |
| trace_joint.h | Joint moments of a trace, E[X_i^{k_1} X_{i+l_2}^{k_2} ...] |
| trace_mean.h | Sample mean of a trace |
| trace_pmf.h | Empirical probability mass function of a discrete trace (counts, batch sizes, queue-length samples) |
| trace_scv.h | Squared coefficient of variation of a trace, var/mean^2 |
| trace_shuffle.h | Random permutation of a trace |
| trace_skew.h | Bias-corrected sample skewness (MATLAB's skewness(S,0), equivalently the G1 estimator) |
| trace_summary.h | Descriptive summary of a trace: moments, shape, order statistics, autocorrelation and burstiness |
| trace_types.h | Shared declarations for the empirical trace statistics domain |
| trace_var.h | Sample variance of a trace |
| wf | |
| wf_analyzer.h | The workflow analyzer: detect every pattern, collapse them, report the two complexities and the recommendations that follow |
| wf_auto_integration.h | Workflow-aware solver recommendation: the port of jar/src/main/java/jline/api/wf/Wf_auto_integration.java |
| wf_branch_detector.h | Branch (probabilistic choice) pattern detection in a workflow network |
| wf_link_matrix.h | Shared conventions of the workflow pattern detectors |
| wf_loop_detector.h | Loop pattern detection in a workflow network |
| wf_parallel_detector.h | Parallel (fork-join) pattern detection in a workflow network |
| wf_pattern_updater.h | Collapse the detected workflow patterns and convolve their service laws |
| wf_sequence_detector.h | Sequence pattern detection in a workflow network |
| workflow_manager.h | The workflow facade: the port of jar/src/main/java/jline/api/wf/WorkflowManager.java |
| inference | |
| param_estimator.h | Sample collection and estimator orchestration for queueing-network parameters |
| sampled_metric.h | Observed metric data supplied to parameter estimators |
| io | |
| docker_image.h | Docker primitives for the backends that legitimately ship an image |
| environment_reader.h | Reader for the LINE model.json interchange of an ENVIRONMENT model into an env::Environment<T> |
| jmt_dist.h | The distribution subtree of a JMT .jsimg file, and the scalar formatting every JMT writer shares |
| jmt_writer.h | Port of @@JMTIO: a refreshed NetworkStruct written out as a JMT .jsimg simulation model |
| jmva_writer.h | Port of @@JMTIO/writeJMVA.m: the CHAIN-level product-form model in the JMVA interchange format |
| jsim_reader.h | Read a JMT .jsim / .jsimg / .jsimw model into a qn::Network |
| line_citations.h | Bibliographic references for the algorithms a run used |
| lqn_json_reader.h | model.json with type: "LayeredNetwork" -> LqnStruct, via LqnBuilder |
| map2renv.h | Port of matlab/src/io/map2renv.m and matlab/src/io/MAPQN2RENV.m (python twin in api/io/converters.py): the Markov-modulated image of a network with MAP/MMPP/MMAP arrival or service processes as a queueing network in a random environment |
| marshal.h | Boundary marshalling for host bindings (MATLAB MEX, pybind11, the JSON CLI) |
| network_reader.h | Reader for the LINE model.json interchange (a Network model) into a qn::Network<T> built through the programmatic builder |
| network_writer.h | qn::NetworkStruct -> model.json, the inverse of network_reader.h |
| pnml.h | PNML (ISO/IEC 15909-2) place/transition nets, read and written |
| qn2lqn.h | Convert a closed queueing network into the layered model used by SolverLQNS |
| qn_reader.h | Reader for the .qn closed-network model format of mp_pfqn |
| workflow_reader.h | Reader for the LINE model.json interchange (a Workflow model) into a workflow::Workflow<T> built through the programmatic builder |
| lang | |
| lqn | |
| lqn_builder.h | Build a layered queueing network in code, as the MATLAB constructors do |
| lqn_reader.h | .lqnx -> LqnStruct, a port of matlab/src/lang/layered/@LayeredNetwork/parseXML.m followed by .../getStruct.m |
| lqn_struct.h | LayeredNetworkStruct, the flattened description of a layered queueing network |
| lqn_writer.h | LqnModel -> .lqnx, a port of matlab/src/lang/layered/@LayeredNetwork/writeXML.m |
| processes | |
| markov_chain.h | The MarkovProcess / MarkovChain object surface |
| qn | |
| environment.h | A random environment: a port of matlab/src/lang/Environment.m, restricted to what SolverENV reads out of it |
| feature_set.h | The language-feature gate: what a MODEL uses against what a SOLVER declares |
| fj_tag.h | Port of matlab/src/api/fj/sn_fj_validate.m and matlab/src/io/@@ModelAdapter/fjtag.m: the model-to-model transform that makes a closed fork-join network EXACTLY solvable by a Markov chain |
| network_builder.h | The Network constructor API: Queue, Delay, Source, Sink, Router, ClassSwitch, Cache, Fork and Join, the job classes, and link |
| network_struct.h | A queueing network and its refreshed NetworkStruct |
| nodes.h | The model API a user writes, spelled as its Python twin |
| polling_info.h | State.pollingInfo and the controller description it returns |
| qn_layer.h | One SolverLN layer: a NetworkStruct plus the LQN annotations that say which element of the layered model each station and class stands for |
| solver_feature_sets.h | The DECLARED side of the gate: one feature set per solver |
| state.h | Port of the MATLAB +State package: the encoding that turns a station's state row into marginal job counts |
| state_events.h | Port of the event half of MATLAB's +State package: the successor states an event produces at one node, with their rates and probabilities |
| tag_chain.h | Port of matlab/src/io/@ModelAdapter/tagChain.m: the model-to-model transform that isolates ONE job of a chain so that its passage can be observed |
| workflow | |
| workflow.h | An activity workflow reduced to one phase-type law |
| dist_fitters.h | The moment fitters the reference distributions carry as STATIC FACTORIES: Erlang.fitMeanAndOrder, HyperExp.fitMeanAndSCV, Coxian.fitMeanAndSCV, Cox2.fitCentral, APH.fitMeanAndSCV, APH.fitCentral, Gamma.fitMeanAndSCV, Pareto.fitMeanAndSCV |
| dist_scale_rate.h | Rate-scaled copy of a distribution, preserving its shape |
| distribution.h | What refreshProcessRepresentations and refreshLST compute FROM a distribution: the (D0,D1) pair that reaches sn.proc, the arrival-phase vector sn.pie, and the Laplace-Stieltjes transform sn.lst |
| distributions.h | The distributions a user names, spelled as their Python twins |
| lang_types.h | Enumerations and the minimal distribution descriptor shared by the model layer of the C++ port |
| prior.h | Prior: parameter uncertainty as a weighted set of alternative models |
| lib | |
| smc | |
| etaqa.h | ETAQA: the aggregated stationary vector and the queue-length moments of an M/G/1-type and of a GI/M/1-type Markov chain |
| mg1.h | The M/G/1-type and GI/M/1-type fundamental-matrix solvers of MAMSolver / SMCSolver, ported from matlab/lib/thirdparty/MG1files: stat.m, MG1_EG.m, MG1_Decay.m, GIM1_Caudal.m, MG1_Shifts.m, MG1_CR.m, MG1_FI.m and GIM1_R.m |
| num | |
| complex_number.h | std::complex<double> as a number type for the generic linear algebra |
| number.h | Number-type abstraction for the templated API port |
| sym_number.h | An exact symbolic scalar, as a num_traits numeric type |
| opt | |
| de | |
| differential_evolution.h | Port of matlab/src/opt/+opt/+de/DifferentialEvolution.m |
| mt19937.h | Bit-exact port of matlab/src/opt/+opt/+de/MT19937.m |
| numpy_random_state.h | Bit-exact port of matlab/src/opt/+opt/+de/NumpyRandomState.m |
| bisection_solver.h | Binary search for the smallest, or largest, feasible value of ONE variable |
| decomposition.h | Solving a large problem as a sequence of smaller ones |
| evaluator.h | Solves the model at one point of the variable space |
| layered_variables.h | The decision variables of a layered queueing network |
| line_opt_solver.h | The optimizer: search the variable space for the best feasible point |
| objectives.h | The objectives to minimize and the constraints to respect |
| pareto.h | The epsilon-constraint sweep: one Pareto front from a sequence of solves |
| problem.h | The optimization problem: a model, the decision variables to search over, an objective, and the constraints a solution must satisfy |
| results.h | What an evaluation and a solve return |
| sensitivity.h | Parametric sensitivities of a solved network, as optimizer input |
| variables.h | The decision variables of a flat queueing network |
| reg | |
| api_dispatch.h | Direct invocation of a single API function from named JSON arguments |
| api_json.h | The one conversion policy between JSON and the templated API layer |
| registry.h | Coverage registry of the C++ port |
| solvers | |
| ag | |
| ag_dispatch.h | The -s ag entry point: gates, fixed point, mean measures |
| ag_exec.h | Execution backends of the reversed-rate fixed point |
| ag_types.h | Options of the agent-based (RCAT) solver |
| ag_worker_client.h | Coordinator-side connections to the ag-worker processes |
| solver_ag.h | Port of solver_ag.m: the RCAT (Reversed Compound Agent Theorem) analyzers, reached by methods 'inap', 'inapplus', 'inapinf' and 'exact' |
| solver_ag_autocat.h | solver_ag_autocat.m, the optimization-based search for RCAT product-form solutions |
| solver_ag_runner.h | The gates and the dispatch of the agent-based (RCAT) solver |
| auto | |
| auto_methods.h | SolverAUTO.listValidMethods: the method names THIS MODEL can actually run |
| solver_auto.h | The SolverAUTO chooser: which solver a model is handed to |
| ba | |
| solver_ba_analyzer.h | Port of matlab/src/solvers/BA/solver_ba_analyzer.m, the bound-analysis handler behind SolverBA |
| solver_ba_bgt.h | Piecewise-linear Lyapunov UPPER bound on the steady-state queue lengths of a multitype open Markovian network, valid for EVERY work-conserving Markovian policy |
| solver_ba_bpt.h | Achievable-region LOWER bound on the mean response times of a multiclass open Markovian network, valid for EVERY non-idling scheduling policy at every station |
| solver_ba_qrf_analyzer.h | Port of matlab/src/solvers/BA/solver_ba_qrf_analyzer.m, the adapter that bridges the sn struct to the QRF (Quadratic Reduction Framework) bounds |
| solver_ba_runner.h | The SolverBA class surface: @@SolverBA/runAnalyzer.m, listValidMethods, getBounds and getBoundsTable |
| solver_ba_snc.h | Stochastic network calculus UPPER bound on the mean response times and queue lengths of a feed-forward open network, valid for EVERY work-conserving scheduling policy at every station |
| solver_ba_spnlp.h | Linear-programming bounds on the mean marking and the throughputs of a stochastic timed Petri net |
| ctmc | |
| ctmc_stationary.h | Port of matlab/src/solvers/CTMC/ctmc_stationary.m: the single entry point for the stationary distribution of a CTMC generated from a NetworkStruct |
| solver_ctmc.h | Port of solver_ctmc.m: the infinitesimal generator of a queueing network, assembled from the enumerated state space and the synchronization list |
| solver_ctmc_analyzer.h | Port of solver_ctmc_analyzer.m and the parts of @@SolverCTMC/runAnalyzer.m that surround one solve: the method gate, the open-model CUTOFF, the state space and synchronization construction, the stationary solve with its reducible-generator handling, and the mapping onto the AvgTable columns |
| solver_ctmc_cdf.h | Port of @@SolverCTMC/getCdfRespT.m and @@SolverCTMC/getCdfSysRespT.m: the exact distribution of the response time, not just its mean |
| solver_ctmc_cftp.h | The cftp and cftp.approx methods of SolverCTMC: stationary analysis of a closed single-class product-form network by PERFECT SAMPLING rather than state-space enumeration |
| solver_ctmc_chain.h | Port of matlab/src/solvers/CTMC/solver_ctmc_chain.m and solver_ctmc_chain_transient.m: SolverCTMC applied to a USER-SUPPLIED Markov chain rather than to a queueing network |
| solver_ctmc_fcr.h | Finite Capacity Regions in SolverCTMC: the DROP rule, as a filter on the enumerated state space, and the gate that refuses WAITQ |
| solver_ctmc_getters.h | The remaining @@SolverCTMC accessors: getGenerator / getInfGen, getStateSpace / getStateSpaceAggr and the getTranProb* family |
| solver_ctmc_mdd_analyzer.h | The mdd method of SolverCTMC: stationary analysis of a closed single-class network whose state space is held in a decision diagram and solved by level aggregation |
| solver_ctmc_prob.h | The SolverCTMC probability family: solver_ctmc_joint, _jointaggr, _marg, _margaggr, and the gate @@SolverCTMC/assertPhaseTypeStates puts in front of all four |
| solver_ctmc_reward.h | Port of solver_ctmc_reward.m and the @@SolverCTMC reward surface (runRewardAnalyzer, getAvgReward, getTranReward) |
| solver_ctmc_sample.h | Port of the @@SolverCTMC sampling surface: sample, sampleAggr, sampleSys, sampleSysAggr |
| solver_ctmc_sens.h | Port of @@SolverCTMC/getSensitivity and getSensitivityRanking: the parametric sensitivity of a steady-state reward to a scalar model parameter, following Trivedi and Bobbio (2017), Sec |
| solver_ctmc_symbolic.h | Port of @@SolverCTMC/getSymbolicGenerator and getSymbolicSolution |
| solver_ctmc_transient.h | Port of solver_ctmc_transient_analyzer.m: the time-dependent counterpart of solver_ctmc_analyzer, integrating dpi/dt = pi Q from a point mass on the initial state instead of solving pi Q = 0 |
| solver_ctmc_waitq.h | Port of solver_ctmc_fcr_waitq.m: the reachability-built generator of a model whose finite capacity region applies WAITQ |
| env | |
| env_dispatch.h | The SolverENV entry surface: a port of the analyzer selection that @@SolverENV/SolverENV.m's init performs (lines 311-327) and of the compression switch setCompression arms (line 160, applied at line 412) |
| solver_env.h | SolverENV: a queueing network in a random environment |
| solver_env_limit.h | The two CLOSED-FORM environment limits: SolverENV.solveEnvLimit, reached by options.method in {avg, dec} |
| solver_env_meanfield.h | SolverENV, the default mean-field path: ENVIRONMENT COMPRESSION |
| solver_env_statevec.h | SolverENV, method = "statevec": a port of matlab/src/solvers/ENV/solver_env_statevec_analyzer.m |
| fluid | |
| fluid_aoi.h | Age of Information by Markovian fluid queues: a port of solver_mfq_aoi.m (identical to solver_fluid_aoi.m) with the gate aoi_is_aoi.m, the parameter map aoi_extract_params.m, and the two aoi-fluid algorithms solveBufferless.m and solveSingleBuffer.m |
| fluid_cacheqn.h | The INTEGRATED caching-queueing network under the fluid solver: ports of solver_fld_cacheqn_analyzer.m (steady state) and solver_fld_cacheqn_tran.m (transient cache trajectory) |
| fluid_closing.h | Port of solver_fluid_initsol.m, and of the entry point of solver_fluid_closing.m that consumes it |
| fluid_closures.h | The moment closures the fluid drift is built from: fluid_min_closure.m, fluid_capacity_closure.m, fluid_lld_scaling.m, fluid_share_closure.m and fluid_gps_share.m |
| fluid_conservation_guard.h | Detects a moment-closure trajectory that has left the model |
| fluid_dae.h | The min-normal closure as a DIFFERENTIAL-ALGEBRAIC system: solver_fluid_dae.m |
| fluid_diffusion.h | The diffusion method: a port of solver_fluid_diffusion.m |
| fluid_export_odes.h | @@SolverFLD/exportODEs.m: the fluid ODE system as a standalone LaTeX document, in a form meant to be read by a person AND parsed by a program |
| fluid_jacobian.h | Port of @@SolverFLD/getJacobian, all four of its outputs |
| fluid_kp.h | Port of solver_fluid_kp.m: the fluid AND diffusion limits of the (MAP_t/Ph_t/inf)^N network of Y |
| fluid_matrix.h | The matrix fluid method: a port of solver_fluid_matrix.m, the formulation of Ruuskanen, Berg, Lehtinen et al., PEVA 151 (2021) |
| fluid_mfq.h | The mfq method: a port of solver_mfq.m and the single-queue gate fluid_is_single_queue.m |
| fluid_mfq_prio.h | The priority branch of the mfq method: a port of solver_mfq_prio.m |
| fluid_moments.h | The second-order fluid methods: fluid_moment_terms.m, fluid_lyapunov.m, fluid_drift_jacobian.m, fluid_refine_meanfield.m and solver_fluid_moments.m, which back options.method minnormal and refined |
| fluid_mvn_rectangle.h | Port of fluid_mvn_rectangle.m: the rectangle probability P(a <= Y <= b) for Y ~ Normal(m, C), the cell integral behind getProbAggr under the moment-closure methods |
| fluid_nonhyperbolic.h | The one exception the fluid fallback ladder catches |
| fluid_odes.h | The fluid drift: a port of solver_fluid_odes.m and the ode_jumps_new / ode_rate_base / ode_rates_closing triple it drives on the DEFAULT (closing) method |
| fluid_odes_statedep.h | The state-dependent fluid drifts: ports of ode_statedep.m, ode_softmin.m and ode_pnorm.m |
| fluid_passage.h | Response-time distribution by tagged fluid: a port of solver_fluid_passage_time.m, which is what @@SolverFLD/getCdfRespT delegates to |
| fluid_petri.h | Fluid analysis of a stochastic Petri net: one simultaneous algebraic solve per active set |
| fluid_petri_system.h | The closures, the closed enabling term, the rate vector and the drift Jacobian of a stochastic Petri net's fluid limit |
| fluid_petri_terms.h | Event-based representation of the fluid marking process of a stochastic Petri net |
| fluid_qsys.h | Port of matlab/src/solvers/FLD/solver_fluid_qsys_analyzer.m: the single-station fluid limits |
| fluid_runner.h | The fluid solver's outermost entry point: @@SolverFLD/runAnalyzer.m's method resolution over solver_fluid_analyzer.m's dispatch |
| fluid_stiff.h | Port of ode_eliminate_immediate.m, eliminate_immediate_matrix.m and ode_solve_stiff.m: the two answers to an IMMEDIATE transition |
| fluid_symodes.h | A symbolic description of the fluid ODE system: a port of solver_fluid_symodes.m, which is what @@SolverFLD/exportODEs renders |
| fluid_tbi.h | The tbi method: a port of solver_fluid_tbi_iteration.m and tbi_partition.m |
| solver_fluid.h | SolverFluid: the closing method, a port of solver_fluid.m, solver_fluid_iteration.m and solver_fluid_closing.m |
| ldes | |
| ldes_busyperiod.h | Busy period measurement for the native LDES engine |
| ldes_cache.h | The Cache node of the native LDES engine |
| ldes_engine.h | The NATIVE LDES discrete-event engine |
| ldes_ln_engine.h | The NATIVE LDES engine for LAYERED (LQN) models, the C++ twin of jline/solvers/ldes/handlers/Solver_ssj_ln.java |
| ldes_region.h | Finite capacity regions for the native LDES engine |
| ldes_sampler.h | The variate generators of the native LDES engine |
| ldes_spn.h | The Petri-net layer of the native LDES engine: Places and Transitions |
| ldes_ssj_variates.h | The variate layer of the Java LDES engine, reproduced: SSJ's randvar generators as inverse-CDF functions of one uniform |
| ldes_station.h | The scheduling disciplines of the native LDES engine |
| ldes_stats.h | The estimators of the native LDES engine: running integrals, the MSER-5 warmup filter, and the batch-means confidence intervals |
| ln | |
| lqn_analyzers.h | The @SolverLN methods that solver_ln.h does not carry |
| lqn_helpers.h | Standalone LQN routines that SolverLN needs but does not contain |
| solver_ln.h | SolverLN: layered decomposition of a layered queueing network |
| mam | |
| mam_dispatch.h | Port of solver_mam_analyzer.m: one inner solve, choosing the analyzer that fits the model and the requested method |
| mam_types.h | The option and result types SolverMAM shares with its analyzers |
| solver_mam_basic.h | Port of solver_mam_basic.m, the dec.source analyzer and the default algorithm of SolverMAM |
| solver_mam_basic_mmap.h | Port of solver_mam_basic_mmap.m, solver_mam_basic_mmap_inner.m and solver_mam_basic_mmap_closed.m: the MMAP fork-join decomposition, reached as the dec.source.mmap method and as branch 2b of the dispatch (every open fork-join model that is not in the homogeneous class solver_mam_fj serves) |
| solver_mam_bgchain.h | Port of solver_mam_bgchain.m and its three helpers: the analyzer that treats the CLOSED classes as a background modulating chain and the OPEN classes as matrix-analytic queues driven by it |
| solver_mam_bmap.h | The batch-arrival and batch-service queues of the MAM solver, and the two finite-capacity helpers solver_mam_basic.m shares with them: solver_mam_bmap_map_1.m, solver_mam_map_bmap_1.m, mam_detect_mmck.m and mam_truncate_renorm.m |
| solver_mam_decmmap.h | Port of solver_mam.m, the dec.mmap method: the per-class departure-process decomposition |
| solver_mam_dt.h | Port of solver_mam_dt.m: discrete-time (slotted) analysis of an open network whose interarrival and service laws all live on the slot lattice |
| solver_mam_fj.h | Port of solver_mam_fj.m, the fork-join route of SolverMAM |
| solver_mam_ldqbd.h | Port of solver_mam_ldqbd.m: the level-dependent QBD analyzer for a single-class network of one infinite server and one FCFS queue |
| solver_mam_ldqbd_flatten.h | The two reductions that let an LD-QBD stand in for an enumerated CTMC |
| solver_mam_ldqbd_transient.h | Port of solver_mam_ldqbd_transient.m: transient queue length, utilization and throughput of a single-class OPEN queue, and the fast path behind getTranAvg |
| solver_mam_mapmap1_exact.h | Port of solver_mam_mapmap1_exact.m: the exact fast path SolverMAM tries BEFORE anything else, for a single-class open Source -> FCFS Queue -> Sink model whose arrival or service is a genuinely CORRELATED MAP |
| solver_mam_passage_time.h | Port of solver_mam_passage_time.m: the response-time (sojourn-time) distribution of a single open queue, which is what getCdfRespT, getSjrnT / sjrnT and the CDF path of getPerctRespT return |
| solver_mam_prob.h | Port of @@SolverMAM/getProb.m and @@SolverMAM/getProbMarg.m: the joint (level, phase) and marginal queue-length distributions at the model's single queue, plus @@SolverMAM/getMAMResult.m, which exposes the matrix-analytic internals themselves |
| solver_mam_retrial.h | Port of solver_mam_retrial.m, the customer-impatience analyzer of SolverMAM |
| solver_mam_runner.h | The SolverMAM class surface: @@SolverMAM/runAnalyzer.m and the gates around it |
| solver_mam_traffic.h | Port of solver_mam_traffic.m and solver_mam_traffic_mmap.m: the traffic step of the dec.mmap decomposition |
| solver_mam_transient_qbd.h | Transient analysis of a single-class open queue by the Laplace-domain transient QBD plus numerical inverse Laplace, the port of matlab/src/solvers/MAM/solver_mam_transient_qbd.m |
| solver_mna.h | Port of solver_mna_open.m and solver_mna_closed.m, the two analyzers behind SolverMAM's mna method |
| mva | |
| fj_driver.h | The fork-join fixed point that drives one inner MVA solve |
| fj_ht.h | The Heidelberger-Trivedi fork-join transform, options.config.fork_join='ht' |
| fj_mmt.h | The fork-join transform SolverMVA applies before solving a layer that contains a Fork |
| mva_dispatch.h | Port of @@SolverMVA/mvaDispatch.m: one inner solve, choosing the analyzer that fits the model |
| mva_types.h | The option and result types every MVA analyzer shares |
| sn_chain.h | Chain aggregation and de-aggregation |
| solver_mapqn.h | SolverMVA method 'amva.mapqn': the horizontal-cut mean value analysis (mapqn_amva) of a closed multiclass model with one exponential delay station and one FCFS single-server queue whose class-r service is a MAP |
| solver_mva.h | SolverMVA over a SolverLN layer |
| solver_mva_cache.h | The non-reentrant cache analyzer: a Source-Cache-Sink model |
| solver_mva_cacheqn.h | Integrated caching-queueing analyzer, a port of matlab/src/solvers/MVA/solver_mva_cacheqn_analyzer.m |
| solver_mva_cacheqn_retrieval.h | Port of solver_mva_cacheqn_retrieval_analyzer.m: a CLOSED integrated cache-queueing model whose Cache carries a delayed-hit retrieval system |
| solver_mva_oi.h | Exact mean-value analysis for networks with order-independent stations |
| solver_mva_polling.h | The multiclass open polling analyzer (ladder branch 5) |
| solver_mva_prob.h | The state-probability half of the SolverMVA class surface |
| solver_mva_retrieval.h | Delayed-hit (retrieval-system) cache analyzer, a port of matlab/src/solvers/MVA/solver_mva_retrieval_analyzer.m |
| solver_mva_runner.h | The SolverMVA class surface: @@SolverMVA/runAnalyzer.m and the gates around it |
| solver_mva_sjn.h | Closed networks with shortest-job-next (SJF) stations, ladder branch 0 |
| solver_mvac.h | MVAC, exact mean value analysis BY CHAIN (Conway, de Souza e Silva and Lavenberg, IEEE Trans |
| solver_qna.h | QNA, the two-moment open-network decomposition analyzer |
| solver_rqna.h | Robust Queueing Network Analyzer (RQNA), a port of matlab/src/solvers/MVA/solver_rqna.m |
| solver_rqt.h | Robust Queueing Network Analyzer (RQNA) of Robust Queueing Theory, a port of matlab/src/solvers/MVA/solver_rqt.m, cross-checked against jar/src/main/java/jline/solvers/mva/handlers/Solver_rqt.java |
| nc | |
| nc_dispatch.h | Port of solver_nc_analyzer.m, solver_ncld_analyzer.m and @@SolverNC/ncDispatch.m: one inner solve, choosing the analyzer that fits |
| nc_types.h | Controls and result shape shared by the normalizing-constant analyzers |
| sn_pf_params.h | Port of matlab/src/api/sn/sn_get_product_form_params.m: the CLASS-level product-form parameters |
| solver_nc.h | Port of solver_nc.m: the load-INDEPENDENT normalizing-constant analyzer |
| solver_nc_busyp.h | Port of @SolverNC/getAvgBusyPeriod.m and of the Python-native SolverNC.getAvgBusyPeriod: the mean busy period of order n for a set of stations, from pfqn_busyp (Daduna, J |
| solver_nc_cache.h | Port of solver_nc_cache_analyzer.m: the NON-REENTRANT cache, a model that is exactly a Source, a Cache and a Sink |
| solver_nc_cacheqn.h | Port of solver_nc_cacheqn_analyzer.m: the INTEGRATED caching-queueing network, where a Cache sits inside a queueing network rather than between a Source and a Sink |
| solver_nc_cacheqn_retrieval.h | Port of solver_nc_cacheqn_retrieval_analyzer.m: a CLOSED integrated cache-queueing model whose Cache carries a delayed-hit retrieval system |
| solver_nc_cdf.h | Port of @@SolverNC/getCdfRespT.m, and of its two aliases getSjrnT and sjrnT |
| solver_nc_conv.h | Exact convolution analysis of a closed network with class-dependent service rates |
| solver_nc_dps.h | Heavy-usage asymptotic analysis of the closed two-station network with one think (infinite-server) station and one discriminatory processor-sharing station, by the generating-function expansion of J.A |
| solver_nc_dt.h | Exact normalizing-constant analysis of a discrete-time (slotted) model |
| solver_nc_lcfsqn.h | The two-station LCFS + LCFS-PR closed network |
| solver_nc_lossn.h | Port of solver_nc_lossn_analyzer.m: the open LOSS NETWORK, which is a Source, ONE multiclass Delay sitting inside a Finite Capacity Region under a DROP rule, and a Sink |
| solver_nc_mem.h | Port of solver_nc_mem.m and solver_nc_mem_supports.m: the Maximum Entropy Method of Kouvatsos (1994) |
| solver_nc_oi.h | Order-independent (OI) and pass-and-swap (P&S) normalizing-constant analysis |
| solver_nc_prob.h | The state-probability half of the SolverNC class surface: ports of solver_nc_marg.m, solver_nc_margaggr.m, solver_nc_joint.m, solver_nc_jointaggr.m and solver_nc_jointaggr_ld.m, with the five @@SolverNC/getProb* entry points on top of them |
| solver_nc_retrieval.h | Port of solver_nc_retrieval_analyzer.m: the OPEN delayed-hit (retrieval-system) cache |
| solver_nc_runner.h | The SolverNC class surface: @@SolverNC/runAnalyzer.m and the gates around it |
| solver_nc_sdr.h | Exact product-form analysis under state-dependent routing |
| solver_nc_spn.h | Stationary analysis of a PRODUCT-FORM stochastic Petri net by MDD-rec |
| solver_ncld.h | Port of solver_ncld.m: the LOAD-DEPENDENT normalizing-constant analyzer |
| sens | |
| solver_sens_table.h | Performance sensitivities with respect to service rates |
| ssa | |
| solver_ssa_getters.h | The SolverSSA queries that are not the average table: getProb, getProbAggr, getProbSys, getProbSysAggr, and the four samplers sample, sampleAggr, sampleSys, sampleSysAggr |
| solver_ssa_nrm.h | SolverSSA, the nrm method: a port of solver_ssa_nrm.m and its analyzer solver_ssa_analyzer_nrm.m |
| solver_ssa_nrm_space.h | SolverSSA, the EXPLICIT STATE SPACE variant of the Next Reaction Method: a port of solver_ssa_nrm_space.m and of the else branch of solver_ssa_analyzer_nrm.m that consumes it, together with solver_ssa_findenabled.m |
| solver_ssa_parallel.h | SolverSSA, the para / parallel method: a port of solver_ssa_analyzer_parallel.m |
| solver_ssa_serial.h | SolverSSA, the serial method: a port of solver_ssa_reachability.m, of the run loop of solver_ssa.m, and of solver_ssa_analyzer_serial.m |
| ssa_dispatch.h | The SolverSSA entry surface: a port of @@SolverSSA/runAnalyzer.m's method whitelist, of solver_ssa_analyzer.m's eligibility gate (isNrmEligible and the per-feature *NrmOK predicates) and of solver_ssa_analyzer_nrm.m's own scheduling validation |
| ssa_event_cache.h | Port of EventCache.m and of the lookup that State.afterEvent performs against it (afterEvent.m lines 24-44 and its write-back sites) |
| ssa_types.h | Controls, results and the random source of SolverSSA |
| tr | |
| fj_tag_transform.h | Fork-join TAG AUGMENTATION: the fold-back half of the transform/lift pair that CTMC and SSA share |
| transform_solve.h | Solver-agnostic driver of a model TRANSFORMATION, the sibling of solvers/mva/fj_driver.h |
| uq | |
| solver_uq.h | SolverUQ: uncertainty quantification by expansion over a Prior |
| uq_dispatch.h | The stage solver of SolverUQ, named rather than passed |
| wrappers | |
| jmt | |
| jmt_logs.h | The log-driven half of SolverJMT: linkAndLog, parseLogs, parseTranState, parseTranRespT, sampleAggr, sampleSysAggr, getProbAggr, getProbSysAggr, getCdfRespT and getTranProbAggr |
| solver_jmt.h | Port of SolverJMT, the Java Modelling Tools client |
| ldes | |
| ldes_options.h | The option and result records of SolverLDES, the discrete-event simulator |
| ldes_probe.h | Where the LDES engine is, and whether this machine can run it |
| solver_ldes.h | Port of SolverLDES, the discrete-event simulator, as its C++ client |
| lqns | |
| lqns_probe.h | Is a usable lqns installed on this machine? |
| solver_lqns.h | SolverLQNS: the layered model solved by the external lqns / lqsim binaries |
| qns | |
| solver_qns.h | Port of @@SolverQNS, the wrapper around qnsolver of the RADS/LQNS distribution |
| avg_table.h | The result tables a solver returns |
| cache_metrics.h | What a solver observed about the Cache nodes of a model |
| solver.h | The solver API a user writes, spelled as its Python twin |
| solver_chain_tables.h | The CHAIN-level and SYSTEM-level views of a solved model |
| solver_default_cdf.h | The base-class fallback for a response-time CDF |
| solver_node_tables.h | The NODE-indexed view of a station result, behind getAvgNodeTable |
| solver_options.h | The keyword arguments a solver takes, as one struct |
| util | |
| auglag.h | Augmented Lagrangian method for equality- and inequality-constrained minimization, with line/util/neldermead.h or line/util/levmar.h as the inner unconstrained solver |
| decimal.h | Decimal literal -> T, without a detour through double when T is exact |
| eig.h | Eigenvalues and singular values, backed by LAPACK |
| error.h | The exception types the port throws |
| expm.h | Matrix exponential by scaling and squaring with a diagonal Pade approximant |
| fdlibm.h | The fdlibm elementary functions Java specifies, reproduced, for the code paths whose whole purpose is to land on the same bits as a Java reference |
| fft.h | Discrete Fourier transform of arbitrary length, in double complex |
| http.h | Minimal HTTP/1.1 client, enough to talk to a line-*-rest service |
| levmar.h | Levenberg-Marquardt for nonlinear least squares |
| linalg.h | Dense linear algebra over the templated number type: products, identity, inverse, and powers |
| line_console.h | Running progress log of a LINE solver run (the "solver console") |
| lp_highs.h | A sparse LP backend for line::lp::LpModel, on HiGHS (MIT) |
| lsoda.h | LSODA: the LINE-facing wrapper over the vendored solver in third_party/lsoda.hpp |
| lstsq.h | Least squares for a rectangular system, exact-capable |
| lu.h | LU factorization with partial pivoting, templated on the number type |
| matrix.h | Dense matrix and non-owning view |
| method_type.h | Classification of a solution method, as printed in the solver banner: "<accuracy>, <randomness>" with accuracy in {exact, approximate, bound} and randomness in {deterministic, randomized} |
| neldermead.h | Derivative-free simplex minimization (Nelder and Mead, 1965), with optional box bounds imposed by a change of variables |
| ode.h | Adaptive stiff ODE integrator: a four-stage Rosenbrock method of order four with an embedded order-three estimate for step-size control |
| population.h | Population-vector enumeration and combinatorics |
| rng_ssj.h | The two random number generators the Java LDES engine draws from, reproduced exactly: SSJ's MRG32k3a and java.util.Random |
| rootfind.h | Deterministic scalar root finding |
| simplex.h | Templated primal simplex with Bland's rule |
| subprocess.h | Running an external command and capturing its output, with a deadline |
| svd.h | Singular value decomposition WITH the singular vectors, and the Moore-Penrose pseudo-inverse built from it |
| sylvester.h | The Sylvester equation A X + X B = C, and MATLAB's lyap(A,B,C) |
| tempdir.h | A scratch directory for the subprocess wrappers, the port's lineTempName |
| websocket.h | Minimal RFC 6455 WebSocket server, enough to serve LineWebSocketServer's protocol |
| xml.h | A minimal XML DOM: read for the .lqnx interchange format, write for the JMT .jsimg and .jmva model files |
| src | |
| api | |
| mam | |
| iltcme_table.cpp | |
| cli | |
| ldes_cli.cpp | ldes: the native LDES engine behind the interface of jline.cli.LdesCLI |
| line_cli.cpp | |
| io | |
| line_citations.cpp | The citation registry table and its lookup |
| reg | |
| api_dispatch.cpp | |
| solvers | |
| solver_facade.cpp | The one translation unit that instantiates the solver stack for the facade |
1.18.0