Package jline.examples.java.discrete

Class DiscreteModel

java.lang.Object

jline.examples.java.discrete.DiscreteModel

public class DiscreteModel
extends Object

Discrete-time (slotted) model builders.

Time advances one slot at a time; in each slot a job in service completes with probability p and an arrival occurs with probability b, both recorded at the end of the slot with the departure resolved before the arrival (Daduna's LA rule and D/A rule). Every rate is therefore a per-slot probability and every time is a number of slots.

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

Constructor Summary

Constructors

Constructor	Description
DiscreteModel()

Method Summary

Modifier and Type	Method	Description
static double[]	defaultCycleRates()	Service probabilities used by the cycle examples.
static Network	dt_bernoulli_loaddep(double a, double s, int c, int L)	Load-dependent Bernoulli server, p(n) = s min(n,c), the discrete-time multiserver approximation of example 2.10.
static Network	dt_cycle(double[] p, int N)	Closed cycle of Bernoulli servers (corollary 3.4).
static Network	dt_cycle_loaddep(double[] p, int N, int ldStation, int ldServers)	Closed cycle whose station ldStation runs at p(n) = p min(n,ldServers) (theorem 3.2).
static Network	dt_cycle_multiclass(double[] p, int[] pops)	Multichain closed cycle (section 3.2).
static Network	dt_geogeo1(double a, double s)	Geo/Geo/1 with an unbounded buffer (theorem 2.3, corollary 2.7).
static Network	dt_geogeo1_loss(double a, double s, int L)	Geo/Geo/1/L loss system (corollary 2.8).

Methods inherited from class java.lang.Object

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

Constructor Details

DiscreteModel

public DiscreteModel()

Method Details

dt_geogeo1

public static Network dt_geogeo1(double a,
 double s)

Geo/Geo/1 with an unbounded buffer (theorem 2.3, corollary 2.7).

dt_geogeo1_loss

public static Network dt_geogeo1_loss(double a,
 double s,
 int L)

Geo/Geo/1/L loss system (corollary 2.8).

dt_bernoulli_loaddep

public static Network dt_bernoulli_loaddep(double a,
 double s,
 int c,
 int L)

Load-dependent Bernoulli server, p(n) = s min(n,c), the discrete-time multiserver approximation of example 2.10.

dt_cycle

public static Network dt_cycle(double[] p,
 int N)

Closed cycle of Bernoulli servers (corollary 3.4).

dt_cycle_loaddep

public static Network dt_cycle_loaddep(double[] p,
 int N,
 int ldStation,
 int ldServers)

Closed cycle whose station ldStation runs at p(n) = p min(n,ldServers) (theorem 3.2).

dt_cycle_multiclass

public static Network dt_cycle_multiclass(double[] p,
 int[] pops)

Multichain closed cycle (section 3.2). Both chains follow the same cycle and never switch class, so the joint queue length law is the unichain one at the aggregate population.

defaultCycleRates

public static double[] defaultCycleRates()

Service probabilities used by the cycle examples.