![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Arrival rates at stations fed by a JSQ or SQ(d) dispatcher, from flow balance. More...
#include <cmath>#include <cstddef>#include <vector>#include "line/lang/qn/network_struct.h"#include "line/num/number.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::sn |
Functions | |
| template<class T> | |
| void | line::sn::sn_arvr_state_dependent_balance (const qn::NetworkStruct< T > &L, Matrix< T > &AN, const Matrix< T > &TN, Matrix< T > *WN) |
Arrival rates at stations fed by a JSQ or SQ(d) dispatcher, from flow balance.
Port of MATLAB sn_arvr_state_dependent_balance.m. sn_get_arvr_from_tput reads the routing matrix, which for a state-dependent dispatcher holds only the static RAND split: under JSQ it reported ArvR 0.5/0.5 at two stations whose throughputs were 0.57/0.42. At a station a job leaves only by completing service (no finite buffer, no impatience, no retrial) arrivals and departures balance in steady state, so ArvR = Tput there whatever the routing. Residence times derived from the same static visit ratios are rescaled by the same factor. Other stations are left as computed.
Definition in file sn_arvr_state_dependent_balance.h.