Monotonicity and asymptotic queue-length distribution in discrete-time networks (Q1598900)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Monotonicity and asymptotic queue-length distribution in discrete-time networks
scientific article

    Statements

    Monotonicity and asymptotic queue-length distribution in discrete-time networks (English)
    0 references
    0 references
    28 May 2002
    0 references
    Monotonicity of performance measures for closed, cyclic, discrete-time networks with one server per node and with independent geometric service times in equilibrium is established. It is observed that the joint distribution of queue-length random variables is negatively associated. The queue-length distribution at any node converges in a strong sense to a distribution that is conditionally geometric and the \(r\)-th moment converges to the corresponding moment of the limiting distribution for any positive \(r\). Some consequences are derived.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete-time network
    0 references
    cyclic network
    0 references
    queue-length random variable
    0 references
    distribution
    0 references
    monotonicity
    0 references
    negative association
    0 references
    asymptotic analysis
    0 references