Constructor Detail

• StateProbabilitiesModel

  StateProbabilitiesModel()

Method Detail

• statepr_aggr

   static Network statepr_aggr()

  Basic closed network for state probability analysis.

  Features: - Two closed classes: Class1 (2 jobs), Class2 (0 jobs) - Three stations: Delay, PS Queue1, 2-server PS Queue2 - Serial routing: Delay → Queue1 → Queue2 → Delay - Different service rates for each class at each station - Simple topology for state space analysis

  Returns:

  configured network for state probability computation

• statepr_aggr_large

   static Network statepr_aggr_large()

  Four-class closed network with matrix-based routing.

  Features: - Four closed classes with populations [1,0,4,0] - Complex class switching patterns defined by routing matrices - Class1 → Class2 after Queue2, Class2 → Class1 after Queue2 - Class3 → Class4 after Queue2, Class4 → Class3 after Queue2 - Demonstrates state-dependent class transformations

  Returns:

  configured multi-class state probability model

• statepr_sys_aggr

   static Network statepr_sys_aggr()

  Complex four-class network with class switching.

  Features: - Four closed classes with populations [1,0,3,0] - Three nodes: Delay, Queue1 (PS), Queue2 (2-server PS) - Class1 ↔ Class2 and Class3 ↔ Class4 transformations - Matrix-based routing with class switching - Demonstrates complex class switching patterns

  Returns:

  configured state probability model

• statepr_sys_aggr_large

   static Network statepr_sys_aggr_large()

  Three-queue network with symmetric class populations.

  Features: - Four closed classes with 1 job each (symmetric populations) - Three PS queues: Queue1, Queue2, 3-server Queue3 - Class switching patterns defined by routing matrices - Class1 ↔ Class2 and Class3 ↔ Class4 transformations - Demonstrates balanced state space with equal populations

  Returns:

  configured symmetric state probability model

• statepr_allprobs_ps

   static Network statepr_allprobs_ps()

  Two-class network with bidirectional class switching.

  Features: - Two closed classes: Class1 (2 jobs), Class2 (0 jobs) - Class switching occurs at Queue1: both classes can transform - Class1 → Class2 from Queue1 to Queue2 - Class2 → Class1 from Delay to Queue1 - Simplified topology for analyzing bidirectional switching

  Returns:

  configured bidirectional switching model

• statepr_allprobs_fcfs

   static Network statepr_allprobs_fcfs()

  Mixed scheduling network with class switching.

  Features: - Two closed classes: Class1 (2 jobs), Class2 (0 jobs) - Mixed scheduling: PS Queue1, 2-server FCFS Queue2 - Same bidirectional class switching pattern as example 5 - Demonstrates impact of scheduling strategy on state probabilities - FCFS vs PS comparison with identical routing

  Returns:

  configured mixed scheduling state probability model

• main

   static void main(Array<String> args)

  Main method for testing and demonstrating state probability examples.

  Currently configured to create statepr_aggr_large() without running any solvers or analysis.

  Parameters:

  args - command line arguments (not used)