![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Stochastically stable distribution of a perturbed Markov chain (Wicks 2009). More...
#include <algorithm>#include <cmath>#include <cstddef>#include <limits>#include <string>#include <vector>#include "line/api/mc/ctmc_gth.h"#include "line/api/mc/stronglyconncomp.h"#include "line/util/error.h"#include "line/util/lu.h"#include "line/util/matrix.h"Go to the source code of this file.
Namespaces | |
| namespace | line |
| Conservation laws of a layered queueing network, enumerated from its structure. | |
| namespace | line::mc |
Functions | |
| std::vector< double > | line::mc::ctmc_ssd (const Matrix< double > &Cin, const Matrix< double > &Rin) |
| Stochastically stable distribution, rates C(i,j) eps^R(i,j) (Wicks 2009). | |
| std::vector< double > | line::mc::dtmc_ssd (const Matrix< double > &C, const Matrix< double > &R) |
| SSD of a perturbed transition matrix P_eps(i,j) ~ C(i,j) eps^R(i,j); equals ctmc_ssd. | |
Stochastically stable distribution of a perturbed Markov chain (Wicks 2009).
Port of matlab/src/api/mc/ctmc_ssd.m and dtmc_ssd.m; JAR twin jline.api.mc.Ctmc_ssd, Python twin line_solver.api.mc.gth.ctmc_ssd. The off-diagonal rates behave as Q_eps(i,j) ~ C(i,j) eps^R(i,j) as eps -> 0+ (rows are sources; a zero rate is R = Inf or C = 0), and the result is the exact limit of the stationary vector, no eps ever substituted. Q_eps must be irreducible for eps > 0. The recursion (see ctmc_ssd.m for the full account):
Definition in file ctmc_ssd.h.