Class InitStateExamples
-
- All Implemented Interfaces:
public class InitStateExamples
Examples demonstrating initial state configurations in queueing networks. This class provides Java implementations corresponding to the Kotlin notebooks in jline.examples.kotlin.advanced.initState package.
-
-
Constructor Summary
Constructors Constructor Description InitStateExamples()
-
Method Summary
Modifier and Type Method Description static void
init_state_fcfs_exp()
Demonstrates initial state with FCFS queues and exponential service times (init_state_fcfs_exp.ipynb). static void
init_state_fcfs_nonexp()
Demonstrates initial state with FCFS queues and non-exponential service times (init_state_fcfs_nonexp.ipynb). static void
init_state_ps()
Demonstrates initial state with processor sharing (PS) discipline (init_state_ps.ipynb). static void
main(Array<String> args)
Main method to run all initial state examples. -
-
Method Detail
-
init_state_fcfs_exp
static void init_state_fcfs_exp()
Demonstrates initial state with FCFS queues and exponential service times (init_state_fcfs_exp.ipynb). This example shows how to specify and analyze the transient behavior of a queueing network starting from a specific initial state. The FCFS discipline with exponential service times allows for Markovian analysis of the transient behavior. Features: - FCFS (First-Come-First-Served) scheduling discipline - Exponential service time distributions - Specific initial customer distribution - Transient and steady-state analysis comparison
-
init_state_fcfs_nonexp
static void init_state_fcfs_nonexp()
Demonstrates initial state with FCFS queues and non-exponential service times (init_state_fcfs_nonexp.ipynb). This example extends the FCFS initial state analysis to non-exponential service times. Non-exponential distributions make the transient analysis more complex as the system is no longer Markovian, requiring simulation or approximation techniques. Features: - FCFS scheduling with non-exponential service times - Erlang and deterministic distributions - Impact of service time variability on transient behavior - Simulation-based transient analysis
-
init_state_ps
static void init_state_ps()
Demonstrates initial state with processor sharing (PS) discipline (init_state_ps.ipynb). This example analyzes initial state configurations in processor sharing queues. PS discipline provides different transient behavior compared to FCFS, as all customers receive service simultaneously at reduced rates. Features: - Processor Sharing (PS) scheduling discipline - Analysis of fairness in transient regime - Comparison with FCFS initial state behavior - Impact on response time distributions
-
-
-
-