Package jline.api.dpfqn

package jline.api.dpfqn
Discrete-time (slotted) product-form queueing network algorithms.

Counterparts of jline.api.pfqn for models that live on a lattice of unit slots rather than on the continuous time axis. In each slot a busy server 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).

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

  • Classes
    Class
    Description
    Dpfqn_nc
    Buzen-style recursions for the discrete-time closed cycle of Bernoulli servers with state independent service probabilities.
    Dpfqn_ncld
    Convolution over the discrete-time product form of a closed cycle of state dependent Bernoulli servers.
    DpfqnNcLdResult
    Normalizing constants of a discrete-time closed cycle of state dependent Bernoulli servers.
    DpfqnNcResult
    Normalizing constants of a discrete-time closed cycle of Bernoulli servers with state independent service probabilities.