![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Port of matlab/src/api/sn/sn_arrival_rate_fun.m. More...
#include <cmath>#include <cstddef>#include <functional>#include <limits>#include <vector>#include "line/api/mam/map_moment.h"#include "line/lang/distribution.h"#include "line/lang/qn/network_struct.h"#include "line/num/number.h"Go to the source code of this file.
Classes | |
| struct | line::api::ArrivalRateFun< T > |
| lambda(t), with whether it actually varies and the cycle length. More... | |
Namespaces | |
| namespace | line |
| namespace | line::api |
Functions | |
| template<class T> | |
| ArrivalRateFun< T > | line::api::sn_arrival_rate_fun (const qn::NetworkStruct< T > &sn, std::size_t ist, std::size_t r) |
| Build lambda(t) for station ist (0-based), class r. | |
Port of matlab/src/api/sn/sn_arrival_rate_fun.m.
The arrival rate of a station-class pair AS A FUNCTION OF TIME. The time-varying analyses (Mt/G/inf, the modified offered load, the Gt/Mt/st+GI fluid queue) consume lambda(t) itself, not a mean rate: their whole content is the LAG between when work arrives and when it is felt, and a time-averaged rate has no lag. LINE carries a time-varying arrival as an NHPP or a MAPt, whose schedule is piecewise constant, so lambda(t) is read off the segment in force at t.
For any other process the rate is constant and the handle returns it, which is what lets a caller ask for the time-varying analysis of a stationary model and get the stationary answer rather than an error.
ARITHMETIC: field. map_pie is a linear solve; no transcendental appears.
Definition in file sn_arrival_rate_fun.h.