Stochastic discrete flow networks: Diffusion approximations and bottlenecks (Q1180566): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1214/aop/1176990220 / rank
Normal rank
 
Property / author
 
Property / author: Avishai Mandelbaum / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q1180565 / rank
Normal rank
 
Property / author
 
Property / author: Avishai Mandelbaum / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jevsey Morozov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1214/aop/1176990220 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080216545 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1214/AOP/1176990220 / rank
 
Normal rank

Latest revision as of 16:05, 10 December 2024

scientific article
Language Label Description Also known as
English
Stochastic discrete flow networks: Diffusion approximations and bottlenecks
scientific article

    Statements

    Stochastic discrete flow networks: Diffusion approximations and bottlenecks (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    The congested discrete flow queueing networks, both open and closed, are described in terms of the bottlenecks of the networks. The main results stated as functional central limit theorems provide diffusion approximations for irreducible closed, open networks and networks with priorities. The joint limits for workload process, queue-size process, busy time process and sojourn time process are given. It is proved that the limits are reflected Brownian motions on nonnegative orthant (for open networks) and on the simplex (for closed ones).
    0 references
    heavy traffic
    0 references
    queueing networks
    0 references
    functional central limit theorems
    0 references
    reflected Brownian motion
    0 references

    Identifiers

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