Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates
From MaRDI portal
Publication:4431307
DOI10.1081/STM-120025401zbMath1037.60081OpenAlexW2072795571MaRDI QIDQ4431307
No author found.
Publication date: 19 October 2003
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/stm-120025401
bottleneck behavior, asymptotic queue-length distribution.product-form networks, steady-state analysis
Discrete-time Markov processes on general state spaces (60J05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Cites Work
- Unnamed Item
- Asymptotic behavior of the stationary distribution for a closed queueing system
- Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
- Bottleneck analysis in multiclass closed queueing networks and its application
- Queue length and occupancy in discrete-time cyclic networks with several types of nodes
- Asymptotic behavior of large discrete-time cyclic queueing networks
- Features of some discrete-time cyclic queueing networks
- Monotonicity and asymptotic queue-length distribution in discrete-time networks
- The effect of increasing service rates in a closed queueing network
- Behavior of Tandem Buffers with Geometric Input and Markovian Output
- Packet Transmission in a Noisy-Channel Ring Network
- Discrete time tandem networks of queues
- Closed Queuing Systems with Exponential Servers
- Queueing networks with discrete time scale. Explicit expressions for the steady state behaviour of discrete time stochastic networks