Package jline.examples.java.discrete

Class DiscreteExamples

java.lang.Object

jline.examples.java.discrete.DiscreteExamples

public class DiscreteExamples
extends Object

Discrete-time (slotted) examples, one per feature of the discrete-time normalizing-constant route.

SolverNC enters this route only when options.config.slotted is true, the same switch SolverLDES uses; it is never inferred from the presence of a Geometric distribution. When the switch is on and the model falls outside the discrete-time product form, the solver errors instead of approximating.

Reference: H. Daduna, Queueing Networks with Discrete Time Scale, LNCS 2046, Springer, 2001.

Constructor Summary

Constructors

Constructor	Description
DiscreteExamples()

Method Summary

Modifier and Type	Method	Description
static void	ex1_geogeo1()	Geo/Geo/1 with an unbounded buffer.
static void	ex2_geogeo1_loss()	Geo/Geo/1/L loss system and its blocking probability.
static void	ex3_bernoulli_loaddep()	Load-dependent Bernoulli server, and the discrete-time arrival theorem.
static void	ex4_cycle()	Closed cycle of Bernoulli servers.
static void	ex5_cycle_loaddep()	Closed cycle with state dependent service probabilities.
static void	ex6_cycle_multiclass()	Multichain closed cycle.
static void	main(String[] args)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

DiscreteExamples

public DiscreteExamples()

Method Details

ex1_geogeo1

public static void ex1_geogeo1()
                        throws IllegalAccessException

Geo/Geo/1 with an unbounded buffer.

Throws:

IllegalAccessException

ex2_geogeo1_loss

public static void ex2_geogeo1_loss()
                             throws IllegalAccessException

Geo/Geo/1/L loss system and its blocking probability.

Throws:

IllegalAccessException

ex3_bernoulli_loaddep

public static void ex3_bernoulli_loaddep()
                                  throws IllegalAccessException

Load-dependent Bernoulli server, and the discrete-time arrival theorem.

Example 2.10 notes that a discrete-time M/M/c queue has no exactly equivalent state dependent single server, but that p(n) = p min(n,c) reproduces its conditional service intensity. The arrival law of theorem 2.11 is printed alongside the time-stationary one: discrete time has no PASTA analogue and the two differ.

Throws:

IllegalAccessException

ex4_cycle

public static void ex4_cycle()
                      throws IllegalAccessException

Closed cycle of Bernoulli servers.

Throws:

IllegalAccessException

ex5_cycle_loaddep

public static void ex5_cycle_loaddep()
                              throws IllegalAccessException

Closed cycle with state dependent service probabilities.

Throws:

IllegalAccessException

ex6_cycle_multiclass

public static void ex6_cycle_multiclass()
                                 throws IllegalAccessException

Multichain closed cycle.

Throws:

IllegalAccessException

main

public static void main(String[] args)
                 throws IllegalAccessException

Throws:

IllegalAccessException