![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Port of matlab/src/api/sn/sn_has_bursty_arrival.m. More...
#include <cmath>#include <cstddef>#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.
Namespaces | |
| namespace | line |
| namespace | line::api |
Functions | |
| template<class T> | |
| bool | line::api::sn_has_bursty_arrival (const qn::NetworkStruct< T > &sn) |
Port of matlab/src/api/sn/sn_has_bursty_arrival.m.
True iff some external (Source) arrival process is non-renewal (bursty). A MAP (D0, D1) is renewal iff D1 equals its rank-one renewal form t0*pie, with t0 = -D0 e = D1 e and pie the embedded stationary vector; any departure from that form signals correlation between successive inter-arrival times. A single-phase arrival (Poisson) is renewal by construction. This is the exact test SolverMVA.resolveMethod uses to upgrade method='default' to 'rqna'.
ARITHMETIC: field. map_pie is a linear solve; no transcendental appears.
Definition in file sn_has_bursty_arrival.h.