Diffusion approximations for open Jackson networks with reneging (Q364617)

From MaRDI portal
Revision as of 21:12, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Diffusion approximations for open Jackson networks with reneging
scientific article

    Statements

    Diffusion approximations for open Jackson networks with reneging (English)
    0 references
    0 references
    0 references
    9 September 2013
    0 references
    The paper considers a sequence of generalized Jackson networks with \(K\) stations. In the \(n\)th system, let the patience time distribution for customers at the \(k\) station be \(F_k^n(x)\). It is assumed that for any \(x \geqslant 0\), \(\sqrt n F_k^n({n^{ - {1 \mathord{\left/{\vphantom {1 2}} \right.\kern-\nulldelimiterspace} 2}}}x) \to {f_k}(x)\) for some Lipschitz continuous function \({f_k}(x)\). The objective of the paper is to establish the diffusion approximations for both the queue length process and the abandonment-count process with the FCFS discipline under the conventional heavy traffic limit regime.
    0 references
    reneging
    0 references
    open Jackson network
    0 references
    diffusion approximation
    0 references
    queue length process
    0 references
    abandonment-count process
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references