Package jline.api.lossn

Class Lossn_erlangfp

java.lang.Object

jline.api.lossn.Lossn_erlangfp

public final class Lossn_erlangfp
extends Object

Method Summary

Modifier and Type	Method	Description
static Ret.lossnErlangFP	lossn_erlangfp(Matrix nuVec, Matrix Amat, Matrix cVec)	Erlang fixed point (reduced-load) approximation for loss networks.

Methods inherited from class java.lang.Object

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

Method Details

lossn_erlangfp

public static Ret.lossnErlangFP lossn_erlangfp(Matrix nuVec,
 Matrix Amat,
 Matrix cVec)

Erlang fixed point (reduced-load) approximation for loss networks.

Calls on route r arrive as a Poisson stream of rate nu_r with unit mean holding times, under the link constraints sum_r A(j,r) n(j,r) <= C(j). Link j sees route r offered at nu_r thinned by the blocking of r on every OTHER link, and its occupancy is the Kaufman-Roberts distribution (Kaufman 1981, Roberts 1981), so B(j,r) = P(more than C(j)-A(j,r) units busy). Unit requirements reduce this to Kelly's Erlang fixed point; the earlier form fed the multi-unit load to Erlang B, counting a call of size a as one unit. A fractional row is first scaled to integers by the least common denominator of A(j,:) and C(j), which leaves the admissible set unchanged.

Parameters:

nuVec - offered load of route r (1xR)

Amat - capacity requirement of link j for route r (JxR)

cVec - capacity of link j (Jx1)

Returns:

QLen and Loss per route, the (JxR) blocking of route r on link j, and the sweep count