On the stability of open networks: A unified approach by stochastic dominance

DOI10.1007/BF01189239zbMath0789.60077OpenAlexW2021446368MaRDI QIDQ1319172

Cheng-Shang Chang, Shaw-Hwa Kiang, Joy A. Thomas

Publication date: 19 June 1994

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01189239

zbMATH Keywords

stabilitystochastic orderingstochastic dominancequeue length processopen Jackson networkscharacterization of point processes

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Conditions for finite moments of waiting times in \(G/G/1\) queues ⋮ Ergodicity of Jackson-type queueing networks ⋮ The stability of a non-homogeneous queueing system with regenerative input ⋮ Stability and nonproduct form of stochastic fluid networks with Lévy inputs ⋮ Steady-state GI/G/\(n\) queue in the Halfin-Whitt regime ⋮ Parametric and structural optimization of the capacity of a queuing network ⋮ Optimization of handling capability for opened queueing network customers ⋮ Parameter estimation for product-form distributions of queueing networks ⋮ Bounds on the Mean Delay in Multiclass Queueing Networks under Shortfall-Based Priority Rules ⋮ Perfect Sampling of Generalized Jackson Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic ordering and thinning of point processes
• The stability of open queueing networks
• Some properties of open queueing networks
• Finiteness of waiting-time moments in general stationary single-server queues
• An introduction to the theory of point processes
• Stochastic inequalities on partially ordered spaces
• Queues with nonstationary inputs
• Stability of generalized Jackson networks
• A calculus for network delay. I. Network elements in isolation
• A calculus for network delay. II. Network analysis
• Notes on the stability of closed queueing networks
• On the Characteristics of the General Queueing Process, with Applications to Random Walk
• Monotonicity of throughput in non-Markovian networks
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• Stability of Markovian processes I: criteria for discrete-time Chains
• Stochastic monotonicity in general queueing networks
• Limit Theorems for Queueing Networks. I
• On the Theory of Queues With Many Servers