Package jline.api.npfqn
package jline.api.npfqn
Non-Product Form Queueing Network algorithms.
This package implements analysis algorithms for queueing networks that do not have product-form solutions, typically requiring more advanced techniques such as approximation methods or simulation.
- Since:
- LINE 2.0
-
ClassDescriptionPiecewise-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.Outcome of one solve.First-order linear-programming relaxation of the achievable region of a multiclass open Markovian queueing network.Outcome of one solve.Two-term heavy-usage asymptotic approximation for a closed queueing network with one infinite-server (think) station and one discriminatory processor-sharing (DPS) station, after J.A.Mean queue lengths, sojourn times and throughputs, with the intermediate constants.Near-immediate feedback elimination for the robust queueing network analyzer.Time-varying open network of many-server fluid queues with abandonment.Result of the network solve.Selects how downstream blocking is aggregated for a station.Selects how the load-dependent rate scale V1 is updated across populations.Service-IDC handle whose per-queue evaluation time differs by queue.