Package jline.api.lossn

Class Lossn_kr_dim

java.lang.Object

jline.api.lossn.Lossn_kr_dim

public final class Lossn_kr_dim
extends Object

Dimensions a multirate link by the Kaufman-Roberts recursion.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static final class	Lossn_kr_dim.LossnKrDimResult	Result of lossn_kr_dim(Matrix, Matrix, Matrix).

Method Summary

Modifier and Type	Method	Description
static Lossn_kr_dim.LossnKrDimResult	lossn_kr_dim(Matrix rho, Matrix b, double Btarget)	Smallest link capacity meeting a common blocking target for every class.
static Lossn_kr_dim.LossnKrDimResult	lossn_kr_dim(Matrix rho, Matrix b, Matrix Btarget)	Smallest link capacity meeting per-class blocking targets.

Methods inherited from class java.lang.Object

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

Method Details

lossn_kr_dim

public static Lossn_kr_dim.LossnKrDimResult lossn_kr_dim(Matrix rho,
 Matrix b,
 Matrix Btarget)

Smallest link capacity meeting per-class blocking targets.

Returns the smallest integer capacity C such that every class of the stochastic knapsack (see Lossn_kr) has blocking B_k(C) no larger than its target. The unnormalized Kaufman-Roberts terms

      n q(n) = sum_k b_k rho_k q(n - b_k),   q(0) = 1,
 

do not depend on C, so the search extends a single recursion one unit at a time and evaluates B_k(C) = sum_{n>C-b_k} q(n) / sum_{n<=C} q(n) at each step, at a total cost of O(C K). The search scans every C upwards rather than bisecting because the blocking of a wide class need not decrease monotonically in C (Ross 1995, Sec. 2.6).

Parameters:

rho - offered load of class k (1xK, nonnegative)

b - bandwidth units held by a class-k call (1xK, nonnegative integers)

Btarget - blocking target, 1x1 (applied to every class) or 1xK, each in (0,1]

Returns:

the smallest feasible capacity C and the blocking B at C

lossn_kr_dim

public static Lossn_kr_dim.LossnKrDimResult lossn_kr_dim(Matrix rho,
 Matrix b,
 double Btarget)

Smallest link capacity meeting a common blocking target for every class.

Parameters:

rho - offered load of class k (1xK, nonnegative)

b - bandwidth units held by a class-k call (1xK, nonnegative integers)

Btarget - blocking target in (0,1], applied to every class

Returns:

the smallest feasible capacity C and the blocking B at C