![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
The popularity LAW each class declared, beside the pmf it expands to. More...
#include <line/lang/qn/network_struct.h>
Public Attributes | |
| lang::ProcessType | type = lang::ProcessType::NONE |
| double | s = 0.0 |
| Zipf exponent. | |
| std::size_t | n = 0 |
| support size of a Zipf or a DiscreteSampler | |
The popularity LAW each class declared, beside the pmf it expands to.
Every solver reads pread, which is why the pmf is what the reader materializes. The law is kept because JMT's Cache section takes a PARAMETRIC popularity – a Zipf exponent or a uniform range – and cannot be given a pmf; without this, exporting a Zipf cache would have to either guess the exponent back out of the pmf or drop the popularity. type is NONE when the pmf was supplied directly.
Definition at line 507 of file network_struct.h.
| std::size_t line::qn::CacheParam< T >::Popularity::n = 0 |
support size of a Zipf or a DiscreteSampler
Definition at line 510 of file network_struct.h.
| double line::qn::CacheParam< T >::Popularity::s = 0.0 |
Zipf exponent.
Definition at line 509 of file network_struct.h.
| lang::ProcessType line::qn::CacheParam< T >::Popularity::type = lang::ProcessType::NONE |
Definition at line 508 of file network_struct.h.