![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Robust Queueing Network Analyzer (RQNA), a port of matlab/src/solvers/MVA/solver_rqna.m. More...
#include <cstddef>#include <functional>#include <vector>#include "line/api/mam/map_count_idc.h"#include "line/api/mam/map_moment.h"#include "line/api/npfqn/npfqn_feedback_elim.h"#include "line/api/npfqn/npfqn_traffic_idc.h"#include "line/api/qsys/qsys_gig1_rq.h"#include "line/lang/distribution.h"#include "line/lang/qn/network_struct.h"#include "line/solvers/mva/mva_types.h"#include "line/util/error.h"#include "line/util/linalg.h"#include "line/util/matrix.h"Go to the source code of this file.
Namespaces | |
| namespace | line |
| namespace | line::mva |
Functions | |
| template<class T> | |
| MvaSolution< T > | line::mva::solver_rqna (const qn::NetworkStruct< T > &L, const MvaOptions &opt) |
Robust Queueing Network Analyzer (RQNA), a port of matlab/src/solvers/MVA/solver_rqna.m.
Single-class open network of single-server FCFS queues with Markovian routing and general (non-renewal) external arrival and (non-exponential) service. Implements Whitt & You (2018) Algorithm 1: traffic-rate + limiting-variability equations, time-dependent IDC equations (via npfqn_traffic_idc / npfqn_traffic_idc_at), and the robust-queueing workload approximation (qsys_gig1_rq), plus the near-immediate feedback elimination of Algorithm 2 / Section 4.1-4.2, applied by default.
REFERENCE INDEXING, REPRODUCED. Like solver_qna, the reference indexes the stateful-indexed sn.rt with STATION indices, which is exact only when every stateful node is a station; that precondition is asserted. Single class, so sn.rt(i,j) is the station-to-station routing directly.
ARITHMETIC: transcendental (counting-process IDC needs expm, the RQ workload a square root), so under Rational the whole body is discarded and RQNA is refused by name, matching solver_qna.
Definition in file solver_rqna.h.