A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes
From MaRDI portal
Publication:1698901
DOI10.1016/J.EJOR.2016.09.031zbMath1380.90094OpenAlexW2521189837WikidataQ115575535 ScholiaQ115575535MaRDI QIDQ1698901
Publication date: 16 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.09.031
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analytic finite capacity queueing network model capturing the propagation of congestion and blocking
- Approximate analysis for queueing networks with finite capacity and customer loss
- Reversed processes, product forms and a non-product form
- A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes
- Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers
- Modeling Cross Correlation in Three-Moment Four-Parameter Decomposition Approximation of Queueing Networks
- An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis
- Queuing Networks with Population Size Constraints
- Store-and-Forward Buffer Requirements in a Packet Switching Network
- Competitive buffer management for shared-memory switches
This page was built for publication: A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes
