Class StateProbSysMargExample

java.lang.Object
jline.examples.java.advanced.StateProbSysMargExample

public class StateProbSysMargExample extends Object
Joint probability of the per-station TOTAL queue lengths, all classes summed out, from SolverNC.getProbSysMarg(Matrix).

Compare with getProbSysAggr, which fixes the PER-CLASS population of every station: each probability here is the sum of that one over every per-class table with these row sums. The fibre grows combinatorially, so the quantity is evaluated as a permanent of the demand matrix replicated once per job (H. J. Ryser, "Combinatorial Mathematics", MAA 1963) rather than by enumerating it.

The law is exact, so its first moments are the mean queue lengths and the example checks them against SolverCTMC. The approximate permanent engines are also exercised: they trade accuracy for cost on models whose class count makes the exact expansion dear, need a demand matrix with full support, and refuse a structural zero rather than flooring it.

  • Constructor Details

    • StateProbSysMargExample

      public StateProbSysMargExample()
  • Method Details

    • main

      public static void main(String[] args)