Package jline.api.pfqn

package jline.api.pfqn

Product-Form Queueing Network (PFQN) analysis algorithms.

This package contains algorithms for analyzing queueing networks with product-form solutions, including Mean Value Analysis (MVA), normalizing constant, and load-dependent algorithms. Product-form networks have closed-form solutions that can be computed efficiently.

Sub-packages

• jline.api.pfqn.mva - Mean Value Analysis algorithms
• jline.api.pfqn.nc - Normalizing Constant algorithms
• jline.api.pfqn.ld - Load-dependent algorithms

Since:

LINE 2.0

See Also:

• jline.api.npfqn

Related Packages

Package	Description
jline.api	Procedural algorithms for solving stochastic models and analyzing queueing systems.
jline.api.pfqn.lcfs
jline.api.pfqn.ld	Load-dependent Product Form Queueing Network algorithms.
jline.api.pfqn.mva	Mean Value Analysis algorithms for Product Form Queueing Networks.
jline.api.pfqn.nc	Normalizing constant algorithms for Product Form Queueing Networks.
jline.api.pfqn.sens

Class	Description
Pfqn_busyp	Mean busy period of order n for a subnetwork, after H.
Pfqn_busyp_clw	Busy period of a subnetwork evaluated from point values of the normalizing constant rather than from the whole population ladder.
Pfqn_busyp_multiclass	Multichain generalization of Pfqn_busyp.
Pfqn_busyp.RateFunction	The load-dependent rate of one node, as a FUNCTION of the jobs it holds.
Pfqn_cftp	Perfect/approximate stationary state sampler for closed single-class multiserver product-form networks.
Pfqn_cftp.PfqnCftpReturn	Result holder mirroring the MATLAB [Q,X,T] return of pfqn_cftp.
Pfqn_harel_bounds
Pfqn_joint
Pfqn_jointmarg	Joint probability of the per-station TOTAL queue lengths.
Pfqn_jointmarg.Ret_jointmarg	Result of a joint total-queue-length evaluation.
Pfqn_marie	Marie's iterative aggregation-decomposition (Marie 1979/1980) for closed queueing networks with FCFS non-exponential (Coxian) service.
Pfqn_marie.MultiResult	Result of Pfqn_marie.pfqn_marie_multi(jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix).
Pfqn_marie.Result	Result of Pfqn_marie.pfqn_marie(jline.util.matrix.Matrix, double, double, jline.util.matrix.Matrix).
Pfqn_mwrbb	Majumdar-Woodside robust box bounds on throughput for closed multiclass queueing networks with mixed scheduling disciplines.
Pfqn_mwrbb.Result	Result holder for Pfqn_mwrbb.pfqn_mwrbb(jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix).
Pfqn_replicas
Pfqn_respt_ps_moments	Sojourn-time moments at the processor-sharing station of the closed terminal-driven system of Mitra and Morrison (1983): a bank of terminals in series with a single processor-sharing CPU, with class-dependent exponential think times (mean Z[r]) and class-dependent exponential service times (mean S[r]), and N[r] jobs of class r cycling between the two.
Pfqn_sdr	Product-form state-dependent routing of Krzesinski (1987), "Multiclass Queueing Networks with State-Dependent Routing", Performance Evaluation 7(2):125-143, the multiclass generalization of Towsley (1980), J.
Pfqn_sdr.Coeff	Derived coefficients of an SDR structure, eqs.
Pfqn_sdr.Result	Mean performance measures returned by Pfqn_sdr.pfqn_sdr(jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.lang.StateDepRouting, jline.util.matrix.Matrix).
PfqnResptPsResult	Sojourn-time moments at the processor-sharing station of the closed terminal-driven system of Mitra and Morrison (1983).
PfqnUniqueResult	Result class for pfqn_unique containing all output matrices and mapping information.