Loss tandem networks with blocking -- a semi-Markov approach
From MaRDI portal
Publication:554346
DOI10.2478/V10175-010-0072-9zbMATH Open1228.60095OpenAlexW1969369268MaRDI QIDQ554346FDOQ554346
Authors: W. Oniszczuk
Publication date: 3 August 2011
Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)
Full work available at URL: http://bulletin.pan.pl/(58-4)673.html
Recommendations
- Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation
- Open tandem networks with blocking analysis -- two approaches
- A tandem queue with blocking and Markovian arrival process
- Marked Markovian arrivals in a tandem G-network with blocking
- Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers
Markov renewal processes, semi-Markov processes (60K15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cites Work
- Title not available (Why is that?)
- A tandem queue with blocking and Markovian arrival process
- A finite buffer queue with priorities
- Approximate mean value performance analysis of cyclic queueing networks with production blocking
- Throughput estimation in cyclic queueing networks with blocking
- Title not available (Why is that?)
- Analysis of queueing networks with blocking
- Blocking in a shared resource environment with batched Poisson arrival processes
- Maximum entropy two-station cyclic queues with multiple general servers
- Product form stationary distributions for queueing networks with blocking and rerouting
- A survey of product form queueing networks with blocking and their equivalences
- MVA for product-form cyclic queueing networks with blocking
- Analysis of queueing networks with blocking using a new aggregation technique
- Large tandem queueing networks with blocking
- A two-level queueing network model with blocking and non-blocking messages
- Performance evaluation of closed tandem queueing networks with finite buffers
- Acceptance instant distributions in product-form closed queueing networks with blocking
- Blocking probabilities for multiple class batched Poisson arrivals to a shared resource
- Mean value analysis of product form solution queueing networks with repetitive service blocking
Cited In (1)
This page was built for publication: Loss tandem networks with blocking -- a semi-Markov approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554346)